205 search results - page 2 / 41 » On Deletion in Delaunay Triangulations |
139
click to vote
CIAC
2010
Springer
15 years 6 months ago
2010
Springer
Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optim...
127
click to vote
FSTTCS
2007
Springer
15 years 7 months ago
2007
Springer
Given a set S of line segments in the plane, we introduce a new family of partitions of the convex hull of S called segment triangulations of S. The set of faces of such a triangul...
120
click to vote
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. We demonstrate a connection between a regular triangulation and a constrained Delaunay triangulation in 2D. We propose an algorithm for edge enforcement in the constraine...
SODA
2003
ACM
15 years 2 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
107
click to vote
ESA
2001
Springer
15 years 6 months ago
2001
Springer
Computing the Delaunay triangulation of n points requires usually a minimum of (n log n) operations, but in some special cases where some additional knowledge is provided, faster a...