A triangulation of a set of points in the Euclidean space is a simplicial complex that covers the convex hull of , and whose vertices belong to . In… (More)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Francesca Pelosi, Carlotta Giannelli, Carla Manni, Maria Lucia Sampoli, Hendrik Speleers
- Computer-Aided Design
- 2017

Is this relevant?

2011

2011

- Wael El Oraiby, Dominique Schmitt, Jean-Claude Spehner
- Int. J. Comput. Geometry Appl.
- 2011

Given a set V of n points in the plane, no three of them being collinear, a convex inclusion chain of V is an ordering of the… (More)

Is this relevant?

2008

2008

- Jonathan Richard Shewchuk
- Discrete & Computational Geometry
- 2008

Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh… (More)

Is this relevant?

2003

2003

- Jonathan Richard Shewchuk
- Symposium on Computational Geometry
- 2003

I discuss algorithms based on bistellar flips for inserting and deleting constraining (d - 1)-facets in d-dimensional constrained… (More)

Is this relevant?

2001

2001

- Jeff Erickson
- ArXiv
- 2001

The spread of a finite set of points is the ratio between the longest and shortest pairwise distances. We prove that the Delaunay… (More)

Is this relevant?

2001

2001

- Piotr Mankiewicz, Carsten Schütt
- Journal of Approximation Theory
- 2001

“Almost exact” estimates for the Delone triangulation numbers are given. In particular lim n→∞ deln−1 n = 1 2πe = 0.0585498… (More)

Is this relevant?

1996

1996

- Jesús A. De Loera
- Discrete & Computational Geometry
- 1996

We exhibit a nonregular triangulation for the product of two tetrahedra. This answers a question by Gel'fand, Kapranov, and… (More)

Is this relevant?

1995

1995

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

- Michael A. Facello
- Computer Aided Geometric Design
- 1995

Is this relevant?

Highly Cited

1992

Highly Cited

1992

- Herbert Edelsbrunner, Nimish R. Shah
- Algorithmica
- 1992

A set ofn weighted points in general position in ℝ d defines a unique regular triangulation. This paper proves that if the points… (More)

Is this relevant?

1986

1986

- Andrzej Lingas
- Symposium on Computational Geometry
- 1986

Manacher and Zorbrist conjectured that the greedy triangulation heuristic for minimum weight triangulation of <italic>n</italic… (More)

Is this relevant?