✦ LIBER ✦

Point placement algorithms for Delaunay triangulation of polygonal domains

✍ Scribed by L. R. Nackman; V. Srinivasan

Publisher: Springer
Year: 1994
Tongue: English
Weight: 904 KB
Volume: 12
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01377180

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for automatic generating inte

Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front technique

✍ Li, S. S. ;Shi, John Z. 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 612 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

Implementation of a randomized algorithm

Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

✍ Michael A. Facello 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

An algorithm for the construction of int

An algorithm for the construction of intrinsic delaunay triangulations with applications to digital geometry processing

✍ M. Fisher; B. Springborn; P. Schröder; A. I. Bobenko 📂 Article 📅 2007 🏛 Springer Vienna 🌐 English ⚖ 495 KB

A bijection for triangulations of a poly

A bijection for triangulations of a polygon with interior points and multiple edges

✍ Dominique Poulalhon; Gilles Schaeffer 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Loopless triangulations of a polygon with k vertices in k + 2n triangles (with interior points and possibly multiple edges) were enumerated by Mullin in 1965, using generating functions and calculations with the quadratic method. In this article we propose a simple bijective interpretation of Mulli

An optimal parallel algorithm for triang

An optimal parallel algorithm for triangulating a set of points in the plane

✍ Ed Merks 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 510 KB