On the difficulty of triangulating three-dimensional nonconvex polyhedra
DOI10.1007/BF02187840zbMATH Open0747.52009MaRDI QIDQ1182990FDOQ1182990
Authors: Jim Ruppert, Raimund Seidel 
Publication date: 28 June 1992
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131194
Recommendations
Analysis of algorithms and problem complexity (68Q25) Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Computational aspects related to convexity (52B55) Parallel algorithms in computer science (68W10) Polyhedra and polytopes; regular figures, division of spaces (51M20) Complexity of computation (including implicit computational complexity) (03D15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Triangulating a nonconvex polytope
- Some NP-hard polygon decomposition problems
- Covering Polygons Is Hard
- Finding simplicial subdivisions of polytopes
- Tetrahedrizing point sets in three dimensions
- Title not available (Why is that?)
- Triangulating point sets in space
Cited In (41)
- On triangulating three-dimensional polygons
- Improved boundary constrained tetrahedral mesh generation by shell transformation
- Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
- Decompositions and Boundary Coverings of Non-convex Fat Polyhedra
- Title not available (Why is that?)
- General-dimensional constrained Delaunay and constrained regular triangulations. I: Combinatorial properties
- Simplicial mesh of an arbitrary polyhedron.
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- Detecting tetrahedralizations of a set of line segments
- An iterative interface reconstruction method for PLIC in general convex grids as part of a coupled level set volume of fluid solver
- 2-toroids and their 3-triangulation
- Adaptive tetrahedral mesh generation by constrained Delaunay refinement
- Constructing convex 3-polytopes from two triangulations of a polygon
- Regular triangulations and Steiner points
- 3D boundary recovery by constrained Delaunay tetrahedralization
- Local polyhedra and geometric graphs
- Erased arrangements of linear and convex decompositions of polyhedra
- On the complexity of approximating and illuminating three-dimensional convex polyhedra
- Fast segment insertion and incremental construction of constrained Delaunay triangulations
- On a generalization of Schönhardt's polyhedron
- Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon
- Strategies for polyhedral surface decomposition: an experimental study.
- The complexity of finding small triangulations of convex 3-polytopes
- Spatial polyhedra without diagonals
- Decompositions and boundary coverings of non-convex fat polyhedra
- Secondary polytope and secondary power diagram
- Overview and recent advances in natural neighbour Galerkin methods
- On nontriangulable polyhedra
- Fourth order accurate evaluation of integrals in potential theory on exterior 3D regions
- Redesign of a conformal boundary recovery algorithm for 3D Delaunay triangulation
- 2D and 3D finite element meshing and remeshing. A bibliography (1990-2001)
- Bounds on the size of tetrahedralizations
- Minimizing visible edges in polyhedra
- Starshaped sets
- A fast solver for the Stokes equations with distributed forces in complex geometries.
- On decomposition of embedded prismatoids in \(\mathbb{R}^3\) without additional points
- TetGen, a Delaunay-based quality tetrahedral mesh generator
- Practical unstructured splines: algorithms, multi-patch spline spaces, and some applications to numerical analysis
- Finding small triangulations of polytope boundaries is hard
- Computational geometry column 40
- Title not available (Why is that?)
This page was built for publication: On the difficulty of triangulating three-dimensional nonconvex polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182990)
