245
edits
(Merging of the FreeSCI Pathfinding documentation. Work in progress.) |
m (oops, wrote <u> instead <i>) |
||
Line 4: | Line 4: | ||
This function computes a path from a start point to an end point, avoiding a set of polygons. We start out by formalizing the main notions from Section 2.2. | This function computes a path from a start point to an end point, avoiding a set of polygons. We start out by formalizing the main notions from Section 2.2. | ||
A point v is a position in the plane. Let < | A point v is a position in the plane. Let <i>x(v)</i> denote the x–coordinate of <i>v</i> and <i>y(v)</i> the y–coordinate of <i>v</i>. | ||
A path is a list of points (v<sub>0</sub> , …, v<sub>n</sub> ) and a polygon is a closed path. We now define the near point: | A path is a list of points (v<sub>0</sub> , …, v<sub>n</sub> ) and a polygon is a closed path. We now define the near point: |
edits