✦ LIBER ✦

Computing constrained triangulation and Delaunay triangulation: a new algorithm

✍ Scribed by Zhou Jian-Ming; Shao Ke-Ran; Zhou Ke-Ding; Zhan Qiong-Hua

Book ID: 114547180
Publisher: IEEE
Year: 1990
Tongue: English
Weight: 380 KB
Volume: 26
Category: Article
ISSN: 0018-9464
DOI: 10.1109/20.106412

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithm for constrained delaunay trian

Algorithm for constrained delaunay triangulation

✍ Tsung-Pao Fang; Les A. Piegl 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 973 KB

Computing directional constrained Delaun

Computing directional constrained Delaunay triangulations

✍ Marc Vigo; Núria Pla 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 679 KB

Sweep‐line algorithm for constrained Del

Sweep‐line algorithm for constrained Delaunay triangulation

✍ Domiter, V.; Žalik, B. 📂 Article 📅 2008 🏛 Taylor and Francis Group 🌐 English ⚖ 600 KB

A faster circle-sweep Delaunay triangula

A faster circle-sweep Delaunay triangulation algorithm

✍ Ahmad Biniaz; Gholamhossein Dastghaibyfard 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 976 KB

New Memoryless Online Routing Algorithms

New Memoryless Online Routing Algorithms for Delaunay Triangulations

✍ Weisheng Si; Zomaya, A.Y. 📂 Article 📅 2012 🏛 IEEE 🌐 English ⚖ 584 KB

An optimal algorithm for realizing a Del

An optimal algorithm for realizing a Delaunay triangulation

✍ Timothy Lambert 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 456 KB

## Dillencourt ( 1990) gives a constructive proof for the realizability as a Delaunay triangulation of any triangulation of the interior of a simple polygon. A naive implementation of the construction will take 0( n\*) time. I give a simple O(n) algorithm for this problem. An application of this a