Finding small triangulations of polytope boundaries is hard

Discrete and Computational Geometry

Volumn 24, Issue 2-3, 2000, Pages 503-517

  Richter Gebert, J ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034413328     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010052     Document Type: Article

References (6)

1. J. De Loera: Computing minimal and maximal triangulations of convex polytopes, Manuscript, 1999, 14pp.
2. M.J. Garey and D.S. Johnson: Computers and Intractability, Freeman, San Francisco, CA, 1979.
3. N.E. Mnëv, The universality theorems on the classification problem of configuration varieties and convex polytopes varieties, in: Topology and Geometry - Rohlin Seminar (O. Ya Viro, ed.), Lecture Notes in Mathematics, vol. 1346, Springer-Verlag, Berlin, 1988, pp. 527-544.
4. J. Richter-Gebert, Realization Spaces of Polytopes, Lecture Notes in Mathematics, vol. 1643, Springer-Verlag, Berlin, 1996.
5. J. Richter-Gebert, Testing orientability for matroids is NP-complete, Advances in Applied Mathematics, 23 (1999), 78-90.
6. P. Shor, Stretchability of pseudolines is N P-hard, in: Applied Geometry and Discrete Mathematics - The Victor Klee Festschrift (P. Gritzmann, B. Sturmfels, eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 4, American Mathematical Society, Providence, RI, 1991, pp. 531-554.