[Adonthell-commits] CVS: adonthell/doc/devel map.dxt,1.1.2.2,1.1.2.3

[Alexandre Courbot <address@hidden>]

Update of /cvsroot/adonthell/adonthell/doc/devel
In directory subversions:/tmp/cvs-serv10067/doc/devel

Modified Files:
      Tag: Branch_road_to_0-4
        map.dxt 
Log Message:
autogen now copies files instead of linking them
removed some useless files
updated a little bit the map doc


Index: map.dxt
===================================================================
RCS file: /cvsroot/adonthell/adonthell/doc/devel/map.dxt,v
retrieving revision 1.1.2.2
retrieving revision 1.1.2.3
diff -C2 -r1.1.2.2 -r1.1.2.3
*** map.dxt     11 Aug 2002 20:57:44 -0000      1.1.2.2
--- map.dxt     29 Sep 2002 19:30:37 -0000      1.1.2.3
***************
*** 23,27 ****
  allow complex forms to be described. The most appropriate
  representation that matches both requirements is the polygon-based
! representation 
   
  \subsection mobjs_repr_describe Describing the Shape of Objects with Polygons
--- 23,27 ----
  allow complex forms to be described. The most appropriate
  representation that matches both requirements is the polygon-based
! representation.
   
  \subsection mobjs_repr_describe Describing the Shape of Objects with Polygons
***************
*** 172,183 ****
  Once we have \e r and \e s, we can assume that if \f$0 <= r <= 1\f$
  and \f$0 <= s <= 1\f$, then there actually is an
! intersection. Otherwise the segments intersects, but not in the limits
! of our lines. We can get the exact coordinates of the intersection
  point \e P with:
  
  \f$P_x = A_x + r(B_x - A_x)\f$
  \f$P_y = A_y + r(B_y - A_y)\f$
  
! So if used as if, this algorithm will require one float division and four
  float multiplications. We can avoir working on floats all the time
  because we have a very small unit measure.
--- 172,184 ----
  Once we have \e r and \e s, we can assume that if \f$0 <= r <= 1\f$
  and \f$0 <= s <= 1\f$, then there actually is an
! intersection. Otherwise the lines intersects, but not in the limits
! of our segments. We can get the exact coordinates of the intersection
  point \e P with:
  
  \f$P_x = A_x + r(B_x - A_x)\f$
+ 
  \f$P_y = A_y + r(B_y - A_y)\f$
  
! So if used as is, this algorithm will require one float division and four
  float multiplications. We can avoir working on floats all the time
  because we have a very small unit measure.