Triangulating multiply-connected polygons: A simple, yet efficient algorithm.
| dc.contributor.author | Ronfard, Remi P. | en_US |
| dc.contributor.author | Rossignac, Jarek R. | en_US |
| dc.date.accessioned | 2014-10-21T07:31:19Z | |
| dc.date.available | 2014-10-21T07:31:19Z | |
| dc.date.issued | 1994 | en_US |
| dc.description.abstract | We present a new, simple, yet efficient algorithm for triangulating multiply-connected polygons. The algorithm requires sorting only local concave minima (sags). The order in which triangles are created mimics a flooding process of the interior of the polygon. At each stage, the algorithm analyses the positions and neighborhoods of two vertices only, and possibly checks for active sags, so as to determine which of five possible actions to take. Actions are based on a local decomposition of the polygon into monotonic regions, or gorges (raise the water level in the current gorge, spill into an adjacent gorge, jump to the other bank of a filled gorge, divide a gorge into two, and fill a gorge to its top). The implementation is extremely simple and numerically robust for a large class of polygons. It has been tested on millions of cases as a preprocessing step of a walkthrough and inspection program for complex mechanical and architectural scenes. Extensive experimental results indicate that the observed complexity in terms of the number of vertices, remains under in all cases. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 13 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.1330281 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 281-292 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.1330281 | en_US |
| dc.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
| dc.title | Triangulating multiply-connected polygons: A simple, yet efficient algorithm. | en_US |