Revision as of 00:34, 14 July 2014 edit Ulric1313 (talk \| contribs) Extended confirmed users, Pending changes reviewers, Rollbackers 185,073 edits dab ← Previous edit		Revision as of 21:07, 4 June 2018 edit undo Nelsonmax (talk \| contribs) 4 edits Revised to "If the tests are all false, then switch the order of P and Q in the sort, record having done so, and try again. If there is an attempt to switch the order of a polygon a second time, there is a visibility cycle, and the polygons must be split." to give more detail on the detection of cycles. Next edit →
Line 17: Note also that the polygons must be [[plane (geometry)\|planar]]. If the tests are all false, then switch the order of P and Q in the sort, record having done so, and try again. If there is an attempt to switch the order of a polygon a second time, there is a visibility cycle, and the polygons must be split. Splitting is accomplished by selecting one polygon and cutting it along the line of intersection with the other polygon. The above tests are again performed, and the algorithm continues until all polygons pass the above tests. ==References==

Newell's algorithm: Difference between revisions