✦ LIBER ✦

Triangulating point sets in space

✍ Scribed by David Avis; Hossam ElGindy

Publisher: Springer
Year: 1987
Tongue: English
Weight: 684 KB
Volume: 2
Category: Article
ISSN: 0179-5376
DOI: 10.1007/bf02187874

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An optimal speed-up parallel algorithm f

An optimal speed-up parallel algorithm for triangulating simplicial point sets in space

✍ Hossam ElGindy 📂 Article 📅 1986 🏛 Springer 🌐 English ⚖ 394 KB

Regular triangulations of dynamic sets o

Regular triangulations of dynamic sets of points

✍ Marc Vigo; Núria Pla; Josep Cotrina 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 596 KB

The Delaunay triangulations of a set of points are a class of triangulations which play an important role in a variety of different disciplines of science. Regular triangulations are a generalization of Delaunay triangulations that maintain both their relationship with convex hulls and with Voronoi

Nice Point Sets Can Have Nasty Delaunay

Nice Point Sets Can Have Nasty Delaunay Triangulations

✍ Erickson 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 326 KB

On polyhedra induced by point sets in sp

On polyhedra induced by point sets in space

✍ Pankaj K. Agarwal; Ferran Hurtado; Godfried T. Toussaint; Joan Trias 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 315 KB

ACM sets of points in multiprojective sp

ACM sets of points in multiprojective space

✍ Elena Guardo; Adam Van Tuyl 📂 Article 📅 2008 🏛 Universitat de Barcelona 🌐 Spanish ⚖ 301 KB

Note – On the Number of Triangulations o

Note – On the Number of Triangulations of Planar Point Sets

✍ Raimund Seidel 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 110 KB