Content deleted Content added
No edit summary |
Linked list is just implementation detail. |
||
Line 18:
}}</ref> It can process both self-intersecting and non-convex polygons. It can be trivially generalized to compute other [[Boolean operations on polygons]], such as union and difference.
The algorithm is based on the definition of the "inside" of a polygon based on the [[winding number]]. It considers regions with odd winding number to be inside the polygon; this is known as the [[even–odd rule]]. It takes two lists of polygons as input
In its original form, the algorithm is divided into three phases:
| |||