55 search results - page 1 / 11 » A time efficient Delaunay refinement algorithm |
SODA
2004
ACM
14 years 8 days ago
2004
ACM
In this paper we present a Delaunay refinement algorithm for generating good aspect ratio and optimal size triangulations. This is the first algorithm known to have sub-quadratic ...
CCCG
2008
14 years 11 days ago
2008
We are interested in the following mesh refinement problem: given an input set of points P in Rd , we would like to produce a good-quality triangulation by adding new points in P....
COMPGEOM
2008
ACM
14 years 21 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, ...
ASPDAC
2001
ACM
14 years 2 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
IJCGA
2002
13 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...