On the hardness of minkowski addition and related operations

DOI10.1145/1247069.1247124MaRDI QIDQ3602888zbMATH OpenOpenAlexFDO

Authors Hans Raj Tiwary

Publication date 12 February 2009

Published in Proceedings of the twenty-third annual symposium on Computational geometry - SCG '07 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1247069.1247124

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• On the hardness of computing intersection, union and Minkowski sum of polytopes
• On the exact maximum complexity of Minkowski sums of polytopes
• Convexity recognition of the union of polyhedra
• Publication:4863381
• Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Bases

Cited in

(2)

• Some results about Minkowski addition and difference
• On the hardness of computing intersection, union and Minkowski sum of polytopes

This page was built for publication: On the hardness of minkowski addition and related operations

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