Robust inside-outside segmentation using generalized winding numbers

@article{Jacobson2013RobustIS,
  title={Robust inside-outside segmentation using generalized winding numbers},
  author={Alec Jacobson and Ladislav Kavan and Olga Sorkine-Hornung},
  journal={ACM Transactions on Graphics (TOG)},
  year={2013},
  volume={32},
  pages={1 - 12}
}
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… 
Mesh arrangements for solid geometry
TLDR
This work proposes a systematic recipe for conducting a family of exact constructive solid geometry operations, which generalizes unary mesh-repair operations, classic binary boolean differencing, and n-ary operations such as finding all regions inside at least k out of n inputs.
Signed distance fields for polygon soup meshes
TLDR
A robust and efficient automatic approach to define and compute a signed distance field for arbitrary triangular geometry and proves that exterior grid points can reuse a shifted original unsigned distance field, whereas for interior cells, the signed field is computed from the offset surface geometry.
Repairing Non-Manifold Boundaries of Segmented Simplicial Meshes
TLDR
This paper proposes alternatives to repair non-manifold boundaries of segmented simplicial meshes, among them is the Delaunay based one, which uses common data structures and only considers 2 and 3 dimensions.
Algorithms and interfaces for real-time deformation of 2D and 3D shapes
TLDR
This thesis investigates computer algorithms and user interfaces which assist in the process of deforming raster images, vector graphics, geometric models and animated characters in real time, and aims at skinning weight computation for deforming shapes in real-time using linear blend skinning (LBS).
Convex polyhedral meshing for robust solid modeling
TLDR
This work introduces a new technique to create a mesh of convex polyhedra representing the interior volume of a triangulated input surface, and leverages on the recent concept of indirect geometric predicate to provide an unprecedented combination of guaranteed robustness and speed, thus enabling the practical implementation of robust though flexible solid modeling systems.
Tetrahedral meshing in the wild
TLDR
This work proposes a novel tetrahedral meshing technique that is unconditionally robust, requires no user interaction, and can directly convert a triangle soup into an analysis-ready volumetric mesh, offering a robustness and reliability comparable to, e.g., image processing algorithms.
Navigating intrinsic triangulations
TLDR
A data structure that makes it easy to run a large class of algorithms from computational geometry and scientific computing on extremely poor-quality surface meshes by considering intrinsic triangulations which connect vertices by straight paths along the exact geometry of the input mesh.
Consistent Volumetric Discretizations Inside Self‐Intersecting Surfaces
TLDR
This work proposes an algorithm that produces a tetrahedral mesh that overlaps itself consistently with the self‐intersections in the input surface, which enables volumetric processing onSelf‐intersecting models and demonstrates the effectiveness of the method with applications to automatic skinning weight computation, physically based simulation and geodesic distance computation.
Continuous Property Gradation for Multi-material 3D-printed Objects
TLDR
A novel approach for representing material gradients in volumetric models using subdivision schemes, supporting continuity and providing elegant ways for interactive modeling of locally varying properties is presented.
Tetrahedral Meshing in the Wild YIXIN HU
TLDR
The approach enables łblack-boxž analysis, i.e. it allows to automatically solve partial diferential equations on geometrical models available in the wild, ofering a robustness and reliability comparable to, e.g., image processing algorithms, opening the door to automatic, large scale processing of real-world geometric data.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 78 REFERENCES
Automatic restoration of polygon models
We present a fully automatic technique which converts an inconsistent input mesh into an output mesh that is guaranteed to be a clean and consistent mesh representing the closed manifold surface of a
Adaptive physics based tetrahedral mesh generation using level sets
TLDR
This work presents a tetrahedral mesh generation algorithm designed for the Lagrangian simulation of deformable bodies and uses this algorithm to generate meshes for the simulation of skeletal muscle from level set representations of the anatomy.
Atomic volumes for mesh completion
TLDR
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, guarantees that the resulting mesh is watertight.
Structure Preserving CAD Model Repair
TLDR
This paper exploits the topological simplicity of a voxel grid to reconstruct a cleaned up surface in the vicinity of intersections and cracks, but keeps the input tessellation in regions that are away from these inconsistencies, and produces a feature-sensitive, manifold output that stays within a prescribed error-tolerance to the input model.
A lightweight approach to repairing digitized polygon meshes
  • M. Attene
  • Computer Science
    The Visual Computer
  • 2010
TLDR
An algorithm is presented that strives to convert a low-quality digitized polygon mesh to a single manifold and watertight triangle mesh without degenerate or intersecting elements and is computationally efficient and produced more accurate results while using fewer triangles.
Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing
TLDR
A new computational method for fully automated triangular mesh generation, consistently applicable to wire-frame, surface, solid, and nonmanifold geometries, based on the observation that a pattern of tightly packed spheres mimics a Voronoi diagram.
Consistent solid and boundary representations from arbitrary polygonal data
TLDR
An algorithm is described that automatically constructs consistent representations of the solid objects modeled by an arbitrary set of polygons and is effective even when the input polygons intersect, overlap, are wrongly-oriented, have T-junctions, or are unconnected.
Bounded biharmonic weights for real-time deformation
TLDR
This work develops linear blending weights that produce smooth and intuitive deformations for points, bones, and cages of arbitrary topology, called bounded biharmonic weights, that minimize the Laplacian energy subject to bound constraints.
Exact and Robust (Self‐)Intersections for Polygonal Meshes
TLDR
A new technique to implement operators that modify the topology of polygonal meshes at intersections and self‐intersections by combining an adaptive octree with nested binary space partitions (BSP), which can guarantee exactness and robustness of the algorithm while still achieving higher performance and less memory consumption than previous approaches.
Large mesh deformation using the volumetric graph Laplacian
TLDR
A novel technique for large deformations on 3D meshes using the volumetric graph Laplacian is presented, allowing novice users to create pleasing deformations with little effort in a 2D curve-based deformation system.
...
1
2
3
4
5
...