Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
From MaRDI portal
Publication:3334982
Recommendations
Cited in
(49)- Stability of the 8-tetrahedra shortest-interior-edge partitioning method
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Decomposing the complement of the union of cubes and boxes in three dimensions
- The upper envelope of piecewise linear functions: Algorithms and applications
- Optimal tetrahedralization of the 3D-region ``between a convex polyhedron and a convex polygon
- Efficiently hex-meshing things with topology
- On the complexity of approximating and illuminating three-dimensional convex polyhedra
- TetGen, a Delaunay-based quality tetrahedral mesh generator
- Decompositions and boundary coverings of non-convex fat polyhedra
- Minimum convex partitions of multidimensional polyhedrons
- On \(d\)-convex partitions of polygonal regions
- Vertical decompositions for triangles in 3-space
- Polygon nesting and robustness
- Many-face complexity in incremental convex arrangements
- A fixed parameter algorithm for optimal convex partitions
- Computational Science and Its Applications – ICCSA 2004
- 3D boundary recovery by constrained Delaunay tetrahedralization
- Decomposing the boundary of a nonconvex polyhedron
- Convex polygons made from few lines and convex decompositions of polyhedra
- Decomposing the boundary of a nonconvex polyhedron
- Bounds on the size of tetrahedralizations
- Exact Minkowksi sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces
- Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)
- Local polyhedra and geometric graphs
- Removing depth-order cycles among triangles: an algorithm generating triangular fragments
- Erased arrangements of linear and convex decompositions of polyhedra
- Computing a flattest, undercut-free parting line for a convex polyhedron, with application to mold design
- Minimizing visible edges in polyhedra
- Locking-free compressible quadrilateral finite elements: Poisson's ratio-dependent vector interpolants
- Convex invariant refinement by control node splitting: a heuristic approach
- Strategies for polyhedral surface decomposition: an experimental study.
- A two-level method for mimetic finite difference discretizations of elliptic problems
- Improved boundary constrained tetrahedral mesh generation by shell transformation
- Optimal complexity reduction of polyhedral piecewise affine systems
- On decomposition of embedded prismatoids in \(\mathbb{R}^3\) without additional points
- Delaunay partitions in \(\mathbb R^n\) applied to non-convex programs and vertex/facet enumeration problems
- A decision procedure for optimal polyhedron partitioning
- Searching polyhedra by rotating half-planes
- Geometrical discretisations for unfitted finite elements on explicit boundary representations
- Triangulation of simple arbitrarily shaped polyhedra by cutting off one vertex at a time
- Computing optimal diameter-bounded polygon partitions
- Free-Form Surface Partition in 3-D
- Parallel collision detection between moving robots for practical motion planning
- Using \(OxSim\) for path planning
- A Simple Algorithm to Triangulate a Special Class of 3d Non-convex Polyhedra Without Steiner Points
- Graph problems arising from parameter identification of discrete dynamical systems
- Simplicial mesh of an arbitrary polyhedron.
- Adaptive tetrahedral mesh generation by constrained Delaunay refinement
- Triangulating a nonconvex polytope
This page was built for publication: Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3334982)
