Content deleted Content added
m Bot: Migrating 2 interwiki links, now provided by Wikidata on d:q1191935 |
dab |
||
Line 15:
Note that the tests are given in order of increasing computational difficulty.
Note also that the polygons must be [[plane (geometry)|planar]].
If the tests are all false, then 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.
| |||