From 582c1f92c81b264f3eb52d745bf8e607bc9a6ee6 Mon Sep 17 00:00:00 2001 From: Gael Guennebaud Date: Sat, 22 Nov 2008 19:51:05 +0000 Subject: doc: add a "non stable" warning for parts which are not part of the stable API yet and a couple of other minor doc updates... --- doc/TutorialGeometry.dox | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) (limited to 'doc/TutorialGeometry.dox') diff --git a/doc/TutorialGeometry.dox b/doc/TutorialGeometry.dox index 8742341f5..5a1a3e06e 100644 --- a/doc/TutorialGeometry.dox +++ b/doc/TutorialGeometry.dox @@ -67,7 +67,7 @@ might still be interesting to write generic and efficient algorithms taking as i kind of transformations. Any of the above transformation types can be converted to any other types of the same nature, -or to a more generic type. Here are come additional examples: +or to a more generic type. Here are some additional examples: -
\code Rotation2Df r = Matrix2f(..); // assumes a pure rotation matrix @@ -176,7 +176,7 @@ t.pretranslate(Vector_(tx,ty,..)); t *= Translation_(tx,ty,..); t = Translation_(tx,ty,..) * t; \endcode
\b Rotation \n In 2D, any_rotation can also \n be an angle in radian\code +
\b Rotation \n In 2D and for the procedural API, any_rotation can also \n be an angle in radian\code t.rotate(any_rotation); t.prerotate(any_rotation); \endcode\code @@ -216,7 +216,7 @@ t = Translation_(..) * t * RotationType(..) * Translation_(..) * Scaling_(..);
Euler angles might be convenient to create rotation objects. -On the other hand, since there exist 24 differents convensions,they are pretty confusing to use. This example shows how +On the other hand, since there exist 24 differents convension,they are pretty confusing to use. This example shows how to create a rotation matrix according to the 2-1-2 convention.\code Matrix3f m; m = AngleAxisf(angle1, Vector3f::UnitZ()) -- cgit v1.2.3