Finding minimal triangulations of convex 3-polytopes is NP-hard

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2000, Pages 65-66

  Below, Alexander ^a   De Loera, Jesus A ^a   Richter Gebert, Jurgen ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; SET THEORY; THEOREM PROVING; VECTORS;

CONVEX POLYTOPES; MINIMAL-SIZE TRIANGULATION;

COMPUTATIONAL GEOMETRY;

EID: 0033903566     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)