Sciweavers

1245 search results - page 22 / 249
» Triangulation for Points on Lines
Sort
View
CAD
2005
Springer
14 years 9 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
Chuan-Chu Kuo, Hong-Tzong Yau
ICIP
2009
IEEE
15 years 10 months ago
Segmentation On Surfaces With The Closest Point Method
We propose a method to detect objects and patterns in textures on general surfaces. Our approach applies the Chan?Vese variational model for active contours without edges to the p...
SGP
2004
15 years 1 days ago
Spectral Surface Reconstruction From Noisy Point Clouds
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...
Ravi Krishna Kolluri, Jonathan Richard Shewchuk, J...
CCCG
2006
14 years 11 months ago
Tight Bounds for Point Recolouring
In their paper on delineating boundaries from geographic data, Reinbacher et al. [9] use a recolouring method to reclassify points so that the boundaries that separate points of d...
Yurai Núñez Rodríguez, David ...
97
Voted
CCCG
2003
14 years 11 months ago
Estimation of the necessary number of points in Riemannian Voronoi
G. Leibon and D. Letscher showed that for general and sufficiently dense point set its Delaunay triangulation and Voronoi diagram in Riemannian manifold exist. They also proposed ...
Kensuke Onishi, Jin-ichi Itoh