42 search results - page 1 / 9 » Conforming Delaunay triangulations in 3D |
COMGEO
2004
ACM
14 years 10 months ago
2004
ACM
78
Voted
SODA
2003
ACM
14 years 11 months ago
2003
ACM
Though Delaunay triangulations are very well known geometric data structures, the problem of the robust removal of a vertex in a three-dimensional Delaunay triangulation is still ...
73
Voted
IMR
2005
Springer
15 years 3 months ago
2005
Springer
94
Voted
ISCSCT
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
106
Voted
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...