✦ LIBER ✦

An algorithm for automatic Delaunay triangulation of arbitrary planar domains

✍ Scribed by Chongjiang Du

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 545 KB
Volume: 27
Category: Article
ISSN: 0965-9978
DOI: 10.1016/0965-9978(96)00004-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Robust boundary triangulation and delaun

Robust boundary triangulation and delaunay triangulation of arbitrary planar domains

✍ G. Subramanian; V. V. S. Raveendra; M. Gopalakrishna Kamath 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 536 KB

A triangulation algorithm for arbitrary

A triangulation algorithm for arbitrary planar domains

✍ J.M. Nelson 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 514 KB

Automatic triangulation of arbitrary pla

Automatic triangulation of arbitrary planar domains for the finite element method

✍ James C. Cavendish 📂 Article 📅 1974 🏛 John Wiley and Sons 🌐 English ⚖ 840 KB

Point placement algorithms for Delaunay

Point placement algorithms for Delaunay triangulation of polygonal domains

✍ L. R. Nackman; V. Srinivasan 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 904 KB

An implementation of Watson's algorithm

An implementation of Watson's algorithm for computing 2-dimensional delaunay triangulations

✍ S.W. Sloan; G.T. Houlsby 📂 Article 📅 1984 🏛 Elsevier Science ⚖ 499 KB

Simulations of dynamically triangulated

Simulations of dynamically triangulated gravity — an algorithm for arbitrary dimension

✍ S. Catterall 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Recent models for discrete Euclidean quantum gravity incorporate a sum over simplicial triangulations. We describe an algorithm for simulating such models in arbitrary dimension. As illustration we show results from simulations in four dimensions.