Triangulating multiply-connected polygons: A simple yet efficient algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer Graphics Forum Year : 1994

Triangulating multiply-connected polygons: A simple yet efficient algorithm

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 analyzes 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. The implementation is extremely simple and numerically robust for a large class of polygons. It has been tested on millions of cases as a pre-processing 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 O(N^3/2) in all cases.
No file

Dates and versions

inria-00545173 , version 1 (11-09-2014)

Identifiers

  • HAL Id : inria-00545173 , version 1

Cite

Rémi Ronfard, J. Rossignac. Triangulating multiply-connected polygons: A simple yet efficient algorithm. Computer Graphics Forum, 1994, Eurographics, 13 (3), pp.281-292. ⟨inria-00545173⟩
119 View
0 Download

Share

Gmail Facebook X LinkedIn More