A decision procedure for optimal polyhedron partitioning

DOI10.1016/0020-0190(83)90028-5MaRDI QIDQ794166zbMATH OpenOpenAlexFDO

Authors Bernard Chazelle

Publication date 1983

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(83)90028-5

zbMATH Keywords

computational geometrydecidabilityconvex polyhedron partitioning

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx)

Recommendations

• Computing optimal diameter-bounded polygon partitions
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• A fixed parameter algorithm for optimal convex partitions
• Optimal separable partitioning in the plane
• A computational approach to an optimal partition problem on surfaces
• scientific article; zbMATH DE number 1159075
• Approximation schemes for partitioning: convex decomposition and surface approximation
• scientific article; zbMATH DE number 1538871
• scientific article; zbMATH DE number 177549
• Algorithms for fair partitioning of convex polygons

Cites work

• scientific article; zbMATH DE number 3767037 (Why is no real title available?)
• scientific article; zbMATH DE number 3261280 (Why is no real title available?)
• scientific article; zbMATH DE number 3068536 (Why is no real title available?)
• A new decision method for elementary algebra
• Decision procedures for real and p‐adic fields
• Some NP-hard polygon decomposition problems
• Triangulating a simple polygon

Cited in

(4)

• Stability of the 8-tetrahedra shortest-interior-edge partitioning method
• Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm
• Making Decisions in Multi Partitioning
• Computing optimal diameter-bounded polygon partitions

This page was built for publication: A decision procedure for optimal polyhedron partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q794166)