ALGORITHM AND DATA STRUCTURE FOR TRIANGULATING MULTIPLY CONNECTED POLYGONAL DOMAINS

Authors
PIEGL LA RICHARD AM
Citation
La. Piegl et Am. Richard, ALGORITHM AND DATA STRUCTURE FOR TRIANGULATING MULTIPLY CONNECTED POLYGONAL DOMAINS, Computers & graphics, 17(5), 1993, pp. 563-574
Citations number
25
Categorie Soggetti
Computer Sciences, Special Topics","Computer Applications & Cybernetics
Journal title
Computers & graphics → ACNP
ISSN journal
00978493
Volume
17
Issue
5
Year of publication
1993
Pages
563 - 574
Database
ISI
SICI code
0097-8493(1993)17:5<563:AADSFT>2.0.ZU;2-L
Abstract
A fast algorithm for triangulating multiply connected polygonal domain s is presented. The algorithm is an application of the ideas presented in [25], to arbitrary domains. The main contributions are the extensi on of range searching to handle arbitrary domains and constraint edges , and the generation of the output on the fly without storing triangle s that lie outside the valid region.