9 search results - page 1 / 2 » Splitting a Delaunay Triangulation in Linear Time |
91
Voted
ESA
2001
Springer
15 years 2 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...
102
click to vote
COMPGEOM
2008
ACM
15 years 4 days ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...
113
click to vote
COMPGEOM
2005
ACM
15 years 9 days ago
2005
ACM
Star splaying is a general-dimensional algorithm that takes as input a triangulation or an approximation of a convex hull, and produces the Delaunay triangulation, weighted Delaun...
ESA
1997
Springer
15 years 1 months ago
1997
Springer
IJCGA
2002
14 years 10 months ago
2002
This paper presents how the space of spheres and shelling may be used to delete a point from a d-dimensional triangulation efficiently. In dimension two, if k is the degree of the...