Sciweavers

653 search results - page 2 / 131
» Efficient reconstruction from non-uniform point sets
Sort
View
CGF
2008
98views more  CGF 2008»
13 years 10 months ago
Surface Reconstruction from Unorganized Point Data with Quadrics
We present a reverse engineering method for constructing a surface approximation scheme whose input is a set of unorganized noisy points in space and whose output is a set of quad...
Marek Vanco, Bernd Hamann, Guido Brunnett
CGF
2010
179views more  CGF 2010»
13 years 10 months ago
Binary Orientation Trees for Volume and Surface Reconstruction from Unoriented Point Clouds
Given a complete unoriented point set, we propose a binary orientation tree (BOT) for volume and surface representation, which roughly splits the space into the interior and exter...
Yi-Ling Chen, Bing-Yu Chen, Shang-Hong Lai, Tomoyu...
CAD
2005
Springer
13 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
ICCV
2007
IEEE
14 years 11 months ago
Efficient Multi-View Reconstruction of Large-Scale Scenes using Interest Points, Delaunay Triangulation and Graph Cuts
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...
Patrick Labatut, Jean-Philippe Pons, Renaud Kerive...
COMGEO
2012
ACM
12 years 5 months ago
Preserving geometric properties in reconstructing regions from internal and nearby points
The problem of reconstructing a region from a set of sample points is common in many geometric applications, including computer vision. It is very helpful to be able to guarantee ...
Ernest Davis