5 search results - page 1 / 1 » Delaunay triangulations approximate anchor hulls |
COMGEO
2007
ACM
14 years 10 months ago
2007
ACM
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding qu...
113
Voted
COMPGEOM
2005
ACM
15 years 7 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...
109
Voted
COMPGEOM
1996
ACM
15 years 2 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...
98
Voted
ICCV
2007
IEEE
16 years 7 days ago
2007
IEEE
We present a novel method to reconstruct the 3D shape of a scene from several calibrated images. Our motivation is that most existing multi-view stereovision approaches require so...
78
Voted
CIE
2005
Springer
15 years 3 months ago
2005
Springer
We promote the concept of object directed computability in computational geometry in order to faithfully generalise the wellestablished theory of computability for real numbers and...