126 search results - page 12 / 26 » Self-improving algorithms for delaunay triangulations |
105
click to vote
CGF
2000
14 years 9 months ago
2000
We present a fast, memory efficient algorithm that generates a manifold triangular mesh S passing through a set of unorganized points P R3 . Nothing is assumed about the geometry,...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We introduce a new feature size for bounded domains in the plane endowed with an intrinsic metric. Given a point x in a domain X, the homotopy feature size of X at x measures half...
COMGEO
2006
ACM
14 years 9 months ago
2006
ACM
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
ALGORITHMICA
1999
14 years 9 months ago
1999
Abstract. This paper describes the design and implementation of a practical parallel algorithm for Delaunay triangulation that works well on general distributions. Although there h...
SIROCCO
2001
14 years 11 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...