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