Commit e9d91d23 authored by Jan Möbius's avatar Jan Möbius

Fixed documentation warnings

git-svn-id: http://www.openflipper.org/svnrepo/OpenFlipper/branches/Free@15767 383ad7c9-94d9-4d36-a494-682f7c89f535
parent c0af06cb
......@@ -79,8 +79,8 @@ void SkinT<MeshT>::deformSkin()
* SkeletonT::PrepareSkin.
*
* Two algorithms are implemented:
* - Linear Blend Skinning (LBS) or Skeletal Space Deformation (SSD), e.g. see \cite LCF00 "[2]", \cite RLN06 "[3]"
* - Spherical Blend Skinning (SBS), see \cite KZ05 "[1]"
* - Linear Blend Skinning (LBS) or Skeletal Space Deformation (SSD)
* - Spherical Blend Skinning (SBS), Ladislav Kavan and Jiri Zara: Spherical blend skinning, a real-time deformation of articulated models
*
* @par Linear Blend Skinning
* Every vertex will be transformed by every joint with a non-null weight. First
......
......@@ -15,7 +15,7 @@ Decimates a given mesh to a low poly mesh.
\section quick_tutorial Quick Tutorial
First select one of the \ref decimaters .
The \ref incremental provides the best quality, while
the \multiple_choice is the fastest one.
the \ref multiple_choice is the fastest one.
Now, you can choose your constraints and the decimation order.
Don't forget to define stop conditions.
......@@ -35,7 +35,7 @@ They will not be updated, until <i>Initialize</i> is pressed again.
\section decimater Decimater
\section decimaters Decimaters
\subsection incremental Incremental Decimater
......@@ -45,7 +45,7 @@ Use \ref multiple_choice or \ref mixed to get faster, but less accurate results.
\subsection multiple_choice Multiple Choice Decimater
The multiple choice decimater checks #Random Samples and takes the best one for the next collapse.
The multiple choice decimater checks Nuber of Random Samples and takes the best one for the next collapse.
As there is no heap involved, this is usually <b>faster</b> than the incremental approach but as it is randomized,
the result is not guarantied to be the best, but still inside the specified constraints.
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment