245
edits
Difference between revisions of "SCI/FreeSCI/Pathfinding/Specification"
Jump to navigation
Jump to search
m
SCI/FreeSCI/Pathfinding/Specification (view source)
Revision as of 03:04, 30 January 2009
, 03:04, 30 January 2009Fixing anchors
m (Added name anchors for linking) |
m (Fixing anchors) |
||
| Line 32: | Line 32: | ||
:We proceed by formalizing the two assumptions from Section 3.1. | :We proceed by formalizing the two assumptions from Section 3.1. | ||
:;<span id=" | :;<span id="anchor">Assumption 1</span> : All polygons in the polygon set are not self-intersecting. | ||
:;<span id=" | :;<span id="anchor">Assumption 2</span> : Let <i>S</i> be the polygon set. For all points <i>p</i> there is at most one polygon <i>P</i> in <i>S</i> for which <i>p</i> is contained in the barred area of <i>P</i>. | ||
::We now specify the sub-functions of <tt>AvoidPath</tt>. The first sub-function is Contained. | ::We now specify the sub-functions of <tt>AvoidPath</tt>. The first sub-function is Contained. | ||
::'''Specification 1''' CONTAINED(</ | ::'''Specification 1''' CONTAINED(<i>v</i>, <i>P</i> ) | ||
::Input: | ::Input: | ||
::* Apointv | ::* Apointv | ||
::* ApolygonP | ::* ApolygonP | ||
::Output: true when <i>v</i> is contained in <i>P</i>, false otherwise. | ::Output: true when <i>v</i> is contained in <i>P</i>, false otherwise. | ||