245
edits
m (Fixing anchors) |
m (Anchors fixed again) |
||
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="assumption_1">Assumption 1</span> : All polygons in the polygon set are not self-intersecting. | ||
:;<span id=" | :;<span id="assumption_2">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. |
edits