Quality mesh generation in three dimensions
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Triangulating polygons without large angles
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A new approach to the minimum cut problem
Journal of the ACM (JACM)
A volumetric method for building complex models from range images
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Consistent solid and boundary representations from arbitrary polygonal data
Proceedings of the 1997 symposium on Interactive 3D graphics
Tetrahedral mesh generation by Delaunay refinement
Proceedings of the fourteenth annual symposium on Computational geometry
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graphcut textures: image and video synthesis using graph cuts
ACM SIGGRAPH 2003 Papers
Proceedings of the 2003 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Context-based surface completion
ACM SIGGRAPH 2004 Papers
Robust repair of polygonal models
ACM SIGGRAPH 2004 Papers
Filling the Signed Distance Field by Fitting Local Quadrics
3DPVT '04 Proceedings of the 3D Data Processing, Visualization, and Transmission, 2nd International Symposium
Symmetry descriptors and 3D shape matching
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
A Surface Reconstruction Method Using Global Graph Cut Optimization
International Journal of Computer Vision
The power crust, unions of balls, and the medial axis transform
Computational Geometry: Theory and Applications
Geometric modeling based on triangle meshes
ACM SIGGRAPH 2006 Courses
A Sharpness-Dependent Filter for Recovering Sharp Features in Repaired 3D Mesh Models
IEEE Transactions on Visualization and Computer Graphics
Journal on Computing and Cultural Heritage (JOCCH)
3D modeling of complex and detailed cultural heritage using multi-resolution data
Journal on Computing and Cultural Heritage (JOCCH)
Fixing geometric errors on polygonal models: a survey
Journal of Computer Science and Technology
Feature suppression based CAD mesh model simplification
Computer-Aided Design
Mesh repair with user-friendly topology control
Computer-Aided Design
Toward an automatic hole characterization for surface correction
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part I
Technical Section: Automatic hole-filling of CAD models with feature-preserving
Computers and Graphics
Polygon mesh repairing: An application perspective
ACM Computing Surveys (CSUR)
Robust inside-outside segmentation using generalized winding numbers
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Screened poisson surface reconstruction
ACM Transactions on Graphics (TOG)
Surface patches for 3D sketching
Proceedings of the International Symposium on Sketch-Based Interfaces and Modeling
| Hi-index | 0.00 |
The increased use of scanned geometry for applications in computer graphics and 3D hardcopy output has highlighted the need for general, robust algorithms for reconstruction of watertight 3D models given partial polygonal meshes as input. We present an algorithm for 3D hole filling based on a decomposition of space into atomic volumes, which are each determined to be either completely inside or completely outside the model. By defining the output model as the union of interior atomic volumes we guarantee that the resulting mesh is watertight. Individual volumes are labeled as "inside" or "outside" by computing a minimum-cost cut of a graph representation of the atomic volume structure, patching all the holes simultaneously in a globally sensitive manner. User control is provided to select between multiple topologically distinct, yet still valid, ways of filling holes. Finally, we use an octree decomposition of space to provide output-sensitive computation time. We demonstrate the ability of our algorithm to fill complex, non-planar holes in large meshes obtained from 3D scanning devices.