Triangulating a nonconvex polytope
From MaRDI portal
Recommendations
Cites work
- Constructing Arrangements of Lines and Hyperplanes with Applications
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- Decomposition of Polygons into Convex Sets
- Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Pattern Recognition
- Elementary structure of real algebraic varieties
- Finding the intersection of two convex polyhedra
- scientific article; zbMATH DE number 3887061 (Why is no real title available?)
- scientific article; zbMATH DE number 4205983 (Why is no real title available?)
- scientific article; zbMATH DE number 4151829 (Why is no real title available?)
- scientific article; zbMATH DE number 4065813 (Why is no real title available?)
- scientific article; zbMATH DE number 3767037 (Why is no real title available?)
- scientific article; zbMATH DE number 43279 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- Nonobtuse triangulation of polygons
- On Approximations and Incidence in Cylindrical Algebraic Decompositions
- On the Piano Movers problem. II: General techniques for computing topological properties of real algebraic manifolds
- Optimal Point Location in a Monotone Subdivision
- Optimal Search in Planar Subdivisions
- Primitives for the manipulation of general subdivisions and the computation of Voronoi
- The power of geometric duality
- Triangles in space or building (and analyzing) castles in the air
Cited in
(38)- Nonobtuse triangulation of polygons
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Algorithmic aspects of alternating sum of volumes. II: Nonconvergence and its remedy
- On the difficulty of triangulating three-dimensional nonconvex polyhedra
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- Dynamic motion planning in low obstacle density environments
- Provably good mesh generation
- Erased arrangements of linear and convex decompositions of polyhedra
- Overview and recent advances in natural neighbour Galerkin methods
- A decomposition-based approach to layered manufacturing
- Simplicial mesh of an arbitrary polyhedron.
- Bounds on the size of tetrahedralizations
- Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon
- Tetrahedral meshes from planar cross-sections
- Boundary-trimmed 3D triangular mesh segmentation based on iterative merging strategy
- Approximating the minimum triangulation of convex 3-polytopes with bounded degrees
- Strategies for polyhedral surface decomposition: an experimental study.
- TOPOLOGY-PRESERVING WATERMARKING OF VECTOR GRAPHICS
- 3D boundary recovery by constrained Delaunay tetrahedralization
- Straight skeletons and mitered offsets of nonconvex polytopes
- Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
- scientific article; zbMATH DE number 4205983 (Why is no real title available?)
- Convex Decomposition of Polyhedra and Robustness
- scientific article; zbMATH DE number 512921 (Why is no real title available?)
- Efficiently hex-meshing things with topology
- ON THE TIME BOUND FOR CONVEX DECOMPOSITION OF SIMPLE POLYGONS
- scientific article; zbMATH DE number 2105675 (Why is no real title available?)
- Decomposing the boundary of a nonconvex polyhedron
- Convex polygons made from few lines and convex decompositions of polyhedra
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- TetGen, a Delaunay-based quality tetrahedral mesh generator
- Searching polyhedra by rotating half-planes
- Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
- Decomposing the complement of the union of cubes and boxes in three dimensions
- Decomposing the boundary of a nonconvex polyhedron
- An iterative interface reconstruction method for PLIC in general convex grids as part of a coupled level set volume of fluid solver
- Generating aspect graphs for nonconvex polyhedra
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
This page was built for publication: Triangulating a nonconvex polytope
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q914375)
