Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes
ACM Transactions on Graphics (TOG)
Convergence and continuity criteria for discrete approximations of the continuous planar skeleton
CVGIP: Image Understanding
ACM Computing Surveys (CSUR)
Boundaries through scattered points of unknown density
Graphical Models and Image Processing
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
3D Surface Reconstruction Using Occluding Contours
International Journal of Computer Vision
A triangulation-based object reconstruction method
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A new Voronoi-based surface reconstruction algorithm
Proceedings of the 25th annual conference on Computer graphics and interactive techniques
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
r-regular shape reconstruction from unorganized points
Computational Geometry: Theory and Applications - special issue on applied computational geometry
Spiraling edge: fast surface reconstruction from partially organized sample points
VIS '99 Proceedings of the conference on Visualization '99: celebrating ten years
Accurate and efficient unions of balls
Proceedings of the sixteenth annual symposium on Computational geometry
A simple algorithm for homeomorphic surface reconstruction
Proceedings of the sixteenth annual symposium on Computational geometry
Smooth surface reconstruction via natural neighbour interpolation of distance functions
Proceedings of the sixteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Multidimensional binary search trees used for associative searching
Communications of the ACM
The Ball-Pivoting Algorithm for Surface Reconstruction
IEEE Transactions on Visualization and Computer Graphics
Graph-Based Surface Reconstruction Using Structures in Scattered Point Sets
CGI '98 Proceedings of the Computer Graphics International 1998
Computational Geometry: Theory and Applications
A geometric convection approach of 3-D reconstruction
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A New Combinatorial Approach to Surface Reconstruction with Sharp Features
IEEE Transactions on Visualization and Computer Graphics
Gabriel meshes and Delaunay edge flips
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Novel approach for 3-D reconstruction of coronary arteries from two uncalibrated angiographic images
IEEE Transactions on Image Processing
A heuristic approach to reconstruct triangle mesh from unorganized point cloud
FSKD'09 Proceedings of the 6th international conference on Fuzzy systems and knowledge discovery - Volume 5
A new region growing algorithm for triangular mesh recovery from scattered 3D points
Transactions on edutainment VI
3D geometry from uncalibrated images
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
3D shape from unorganized 3d point clouds
ISVC'05 Proceedings of the First international conference on Advances in Visual Computing
SMI 2013: Minimizing edge length to connect sparsely sampled unstructured point sets
Computers and Graphics
| Hi-index | 0.00 |
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants, which are polygonal approximations of curves and surfaces satisfying a new regularity condition. This new condition, which is an extension of the popular notion of r-sampling to the practical case of discrete shapes, seems much more realistic than previously proposed conditions based on properties of the underlying continuous shapes. Indeed, contrary to previous sampling criteria, our regularity condition can be checked on the basis of the samples alone and can be turned into a provably correct curve and surface reconstruction algorithm. Our reconstruction methods can also be applied to non-regular and unorganized point sets, revealing a larger part of the inner structure of such point sets than past approaches. Several real-size reconstruction examples validate the new method.