Guaranteed-quality mesh generation for curved surfaces
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Surface reconstruction by Voronoi filtering
Proceedings of the fourteenth annual symposium on Computational geometry
Geometric structures for three-dimensional shape representation
ACM Transactions on Graphics (TOG)
Detecting undersampling in surface reconstruction
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Delaunay based shape reconstruction from large data
PVG '01 Proceedings of the IEEE 2001 symposium on parallel and large-data visualization and graphics
Smooth-surface reconstruction in near-linear time
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Complexity of the delaunay triangulation of points on surfaces the smooth case
Proceedings of the nineteenth annual symposium on Computational geometry
Multi-level partition of unity implicits
ACM SIGGRAPH 2003 Papers
Curve and Surface Reconstruction: Algorithms with Mathematical Analysis (Cambridge Monographs on Applied and Computational Mathematics)
A flexible framework for surface reconstruction from large point sets
Computers and Graphics
Parameterization-free projection for geometry reconstruction
ACM SIGGRAPH 2007 papers
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Reconstruction with Voronoi centered radial basis functions
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Poisson surface reconstruction
SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Voronoi-based variational reconstruction of unoriented point sets
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Multilevel streaming for out-of-core surface reconstruction
SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
Reconstruction Using Witness Complexes
Discrete & Computational Geometry
On the Locality of Extracting a 2-Manifold in
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
How much geometry it takes to reconstruct a 2-manifold in R3
Journal of Experimental Algorithmics (JEA)
Polyhedra of minimal area as 3D object models
IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 2
Parallel Poisson Surface Reconstruction
ISVC '09 Proceedings of the 5th International Symposium on Advances in Visual Computing: Part I
SMI 2011: Full Paper: Point set silhouettes via local reconstruction
Computers and Graphics
SMI 2012: Full Consensus meshing
Computers and Graphics
Quasi-interpolation for surface reconstruction from scattered data with radial basis function
Computer Aided Geometric Design
Boundary extraction and simplification of a surface defined by a sparse 3D volume
Proceedings of the Third Symposium on Information and Communication Technology
Multi-level hermite variational interpolation and quasi-interpolation
The Visual Computer: International Journal of Computer Graphics
Hi-index | 0.00 |
We introduce a surface reconstruction algorithm suitable for large point sets. The algorithm is an octree-based version of the Cocone reconstruction algorithm [4], allowing independent processing of small subsets of the total input point set. When the points are sufficiently sampled from a smooth surface, the global guarantee of topological correctness of the original algorithm is preserved, together with the geometric accuracy guarantees.