A decision procedure for optimal polyhedron partitioning

DOI10.1016/0020-0190(83)90028-5zbMATH Open0539.68035OpenAlexW2002981165MaRDI QIDQ794166FDOQ794166

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

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
• Algorithms for fair partitioning of convex polygons

zbMATH Keywords

computational geometrydecidabilityconvex polyhedron partitioning

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• A new decision method for elementary algebra
• Some NP-hard polygon decomposition problems
• Triangulating a simple polygon
• Decision procedures for real and p‐adic fields
• Title not available (Why is that?)

Cited In (4)

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

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)