Finding small triangulations of polytope boundaries is hard

DOI10.1007/s004540010052zbMath1161.52304OpenAlexW1983655822MaRDI QIDQ1580774

Jürgen Richter-Gebert

Publication date: 14 September 2000

Published in: Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004540010052

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

On pseudomodular matroids and adjoints

This page was built for publication: Finding small triangulations of polytope boundaries is hard