A decision procedure for optimal polyhedron partitioning

DOI10.1016/0020-0190(83)90028-5zbMath0539.68035OpenAlexW2002981165MaRDI QIDQ794166

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

decidabilitycomputational geometryconvex polyhedron partitioning

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Triangulating a simple polygon
• A new decision method for elementary algebra
• Some NP-hard polygon decomposition problems
• Decision procedures for real and p‐adic fields

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