Computing directional constrained Delaunay triangulations
| Autor: | Núria Pla, Marc Vigo |
|---|---|
| Rok vydání: | 2000 |
| Předmět: |
Pitteway triangulation
Constrained Delaunay triangulation Delaunay triangulation General Engineering Chew's second algorithm Computer Graphics and Computer-Aided Design Bowyer–Watson algorithm Human-Computer Interaction Combinatorics Surface triangulation Voronoi diagram Algorithm Ruppert's algorithm Mathematics |
| Zdroj: | Computers & Graphics. 24:181-190 |
| ISSN: | 0097-8493 |
| DOI: | 10.1016/s0097-8493(99)00153-3 |
| Popis: | In this work, two generalizations of the algorithm for obtaining a constrained Delaunay triangulation of a general planar graph set forth in Vigo (Technical Report LSI-95-UR-R, Universitat Politecnica de Catalunya, 1995; Computer & Graphics 1997;21(2):215–23) are presented. While the first generalization works with elliptical distances, the second one can deal with a set of deforming ellipses associated to each point of the plane. The pseudo-code of the procedures involved in the algorithms is included, the suitability of the algorithms is analyzed, and several examples are given. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full Text from ScienceDirect