126 search results - page 8 / 26 » Self-improving algorithms for delaunay triangulations |
101
click to vote
SODA
2000
ACM
14 years 11 months ago
2000
ACM
A strategy is presented to find a set of points which yields a Conforming Delaunay tetrahedralization of a three-dimensional Piecewise-Linear Complex (PLC). This algorithm is nove...
ICDAR
2007
IEEE
15 years 3 months ago
2007
IEEE
An integrated map of all utility services in a locale would facilitate better management of the road infrastructure and the utilities themselves. To meet this goal, there exists a...
75
Voted
CAIP
2007
Springer
15 years 3 months ago
2007
Springer
The image segmentation plays an important role in medical image processing. Many segmentation algorithms exist. Most of them produce raster data which is not suitable for 3D geomet...
ASPDAC
2001
ACM
15 years 1 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...
105
click to vote
COMPGEOM
1996
ACM
15 years 1 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...