Surface reconstruction from unorganized points
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
SIGGRAPH '93 Proceedings of the 20th annual conference on Computer graphics and interactive techniques
Zippered polygon meshes from range images
SIGGRAPH '94 Proceedings of the 21st annual conference on Computer graphics and interactive techniques
Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing
SMA '95 Proceedings of the third ACM symposium on Solid modeling and applications
Consistent solid and boundary representations from arbitrary polygonal data
Proceedings of the 1997 symposium on Interactive 3D graphics
Cutting and Stitching: Converting Sets of Polygons to Manifold Surfaces
IEEE Transactions on Visualization and Computer Graphics
Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator
FCRC '96/WACG '96 Selected papers from the Workshop on Applied Computational Geormetry, Towards Geometric Engineering
Computer Aided Geometric Design
Simplification and Repair of Polygonal Models Using Volumetric Techniques
IEEE Transactions on Visualization and Computer Graphics
Tight cocone: a water-tight surface reconstructor
SM '03 Proceedings of the eighth ACM symposium on Solid modeling and applications
Matchmaker: constructing constrained texture maps
ACM SIGGRAPH 2003 Papers
What Energy Functions Can Be Minimizedvia Graph Cuts?
IEEE Transactions on Pattern Analysis and Machine Intelligence
A unified approach for modeling complex occlusions in fluid simulations
ACM SIGGRAPH 2003 Sketches & Applications
Consistent Normal Orientation for Polygonal Meshes
CGI '04 Proceedings of the Computer Graphics International
Robust repair of polygonal models
ACM SIGGRAPH 2004 Papers
Interpolating and approximating implicit surfaces from polygon soup
ACM SIGGRAPH 2004 Papers
Spectral surface reconstruction from noisy point clouds
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Large mesh deformation using the volumetric graph Laplacian
ACM SIGGRAPH 2005 Papers
Mean value coordinates for closed triangular meshes
ACM SIGGRAPH 2005 Papers
Variational tetrahedral meshing
ACM SIGGRAPH 2005 Papers
The maple symbolic computation system
ACM SIGSAM Bulletin
Automatic restoration of polygon models
ACM Transactions on Graphics (TOG)
Graph Cuts and Efficient N-D Image Segmentation
International Journal of Computer Vision
Isosurface stuffing: fast tetrahedral meshes with good dihedral angles
ACM SIGGRAPH 2007 papers
Automatic rigging and animation of 3D characters
ACM SIGGRAPH 2007 papers
Atomic volumes for mesh completion
SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
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
Combinatorial 3-Manifolds from Sets of Tetrahedra
CW '07 Proceedings of the 2007 International Conference on Cyberworlds
Adaptive physics based tetrahedral mesh generation using level sets
Engineering with Computers
Lapped solid textures: filling a model with anisotropic textures
ACM SIGGRAPH 2008 papers
Diffusion curves: a vector representation for smooth-shaded images
ACM SIGGRAPH 2008 papers
Visibility-driven Mesh Analysis and Visualization through Graph Cuts
IEEE Transactions on Visualization and Computer Graphics
Fixing geometric errors on polygonal models: a survey
Journal of Computer Science and Technology
A lightweight approach to repairing digitized polygon meshes
The Visual Computer: International Journal of Computer Graphics
Efficient elasticity for character skinning with contact and collisions
ACM SIGGRAPH 2011 papers
Bounded biharmonic weights for real-time deformation
ACM SIGGRAPH 2011 papers
Enforcing topological constraints in random field image segmentation
CVPR '11 Proceedings of the 2011 IEEE Conference on Computer Vision and Pattern Recognition
SHREC'10 track: robust shape retrieval
EG 3DOR'10 Proceedings of the 3rd Eurographics conference on 3D Object Retrieval
Reconstructing Open Surfaces via Graph-Cuts
IEEE Transactions on Visualization and Computer Graphics
Consistent volumetric discretizations inside self-intersecting surfaces
SGP '13 Proceedings of the Eleventh Eurographics/ACMSIGGRAPH Symposium on Geometry Processing
Hi-index | 0.00 |
Solid shapes in computer graphics are often represented with boundary descriptions, e.g. triangle meshes, but animation, physically-based simulation, and geometry processing are more realistic and accurate when explicit volume representations are available. Tetrahedral meshes which exactly contain (interpolate) the input boundary description are desirable but difficult to construct for a large class of input meshes. Character meshes and CAD models are often composed of many connected components with numerous self-intersections, non-manifold pieces, and open boundaries, precluding existing meshing algorithms. We propose an automatic algorithm handling all of these issues, resulting in a compact discretization of the input's inner volume. We only require reasonably consistent orientation of the input triangle mesh. By generalizing the winding number for arbitrary triangle meshes, we define a function that is a perfect segmentation for watertight input and is well-behaved otherwise. This function guides a graphcut segmentation of a constrained Delaunay tessellation (CDT), providing a minimal description that meets the boundary exactly and may be fed as input to existing tools to achieve element quality. We highlight our robustness on a number of examples and show applications of solving PDEs, volumetric texturing and elastic simulation.