Minimal simplicial dissections and triangulations of convex 3-polytopes

Discrete and Computational Geometry

Volumn 24, Issue 1, 2000, Pages 35-48

  Below, A ^a   Brehm, U ^b   De Loera, J A ^c   Richter Gebert, J ^a  

^a ETH ZURICH   (Switzerland)

^b DRESDEN UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034415121     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010058     Document Type: Article

References (21)

1. Avis, D., and ElGindy, H. Triangulating point sets in space, Discrete Comput. Geom. 2 (1987), 99-111.
2. Bern, M., and Eppstein, D. Mesh generation and optimal triangulations, in Computing in Euclidean Geometry (D. Z. Du and F. K. Hwang, eds.), World Scientific, Singapore, 1992.
3. Bern, M., Eppstein, D., and Gilbert, J. Provably good mesh generation. J. Comput. System Sci. 48(3) (1994), 384-409.
4. Billera, L., Filliman, P., and Sturmfels, B. Constructions and complexity of secondary polytopes, Adv. in Math. 83 (1990), 155-179.
5. Böhm, J. Private communication.
6. Brehm, U. Minimale simpliziale Zerlegungen von 3-Polytopen, Sektion Geometrie, DMV Jahrestagung, Berlin, 1992.
7. Chazelle, B., Edelsbrunner, H., Guibas, L. J., Hershberger, J. E., Seidel, R., and Sharir, M. Selecting heavily covered points, SIAM J. Comput. 23(6) (1994), 1138-1151.
8. Croft, H. T., Falconer, K. J., and Guy, R. K. Unsolved Problems in Geometry, Springer-Verlag, New York, 1991.
9. De Loera, J. A., Hoşten, S., Santos, F., and Sturmfels, B. The polytope of all triangulations of a point configuration, Doc. Math. J. DMV 1 (1996), 103-119.
10. Edelsbrunner, H., Preparata, F. P., and West, D. B. Tetrahedrizing point sets in three dimensions, J. Symbolic Comput. 10 (1990), 335-347.
11. Gritzmann, P., and Klee, V. On the complexity of some basic problems in computational convexity, in Polytopes: Abstract, Convex and Computational (T. Bisztriczky et al., eds.), Kluwer Academic, Dordrecht, 1994, pp. 374-466.
12. Gruber, P. Aspects of approximation of convex bodies, in Handbook of Convex Geometry (P. Gruber and J. Wills, eds.), volume A, North-Holland, Amsterdam, 1993, pp. 319-346.
13. Hughes, R. B., and Anderson, M. R. Simplexity of the cube, Discrete Math. 158(1-3) (1996), 99-150.
14. Lee, C. W. Regular triangulations of convex polytopes, in Applied Geometry and Discrete Mathematics -The Victor Klee Festschrift (P. Gritzmann and B. Sturmfels, eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 4, American Mathematical Society, Providence, RI, 1991, pp. 443-456.
15. Lee, C. W. Subdivisions and triangulations of polytopes, in Handbook of Discrete and Computational Geometry (J. E. Goodman and J. O'Rourke, eds.), CRC Press, New York, 1997, pp. 271-290.
16. O'Rourke, J. Art Gallery Theorems and Algorithms, Oxford University Press, New York, 1987.
17. Richter-Gebert, J. Finding small triangulations of polytope boundaries is hard, manuscript available at http:/www.inf.ethz.ch/personal/richter.
18. Ruppert, J., and Seidel, R. On the difficulty of triangulating three-dimensional non-convex polyhedra, Discrete Comput. Geom. 7 (1992), 227-253.
19. Schönhardt, E. Über die Zerlegung von Dreieckspolyedern in Tetraeder, Math. Ann. 98 (1928), 309-312.
20. Sleator, D. D., Tarjan, R. E., and Thurston, W. P. Rotation distance, triangulations, and hyperbolic geometry, J. Amer. Math. Soc. 1(3) (1988), 647-681.
21. Ziegler, G. M. Lectures on Polytopes, Springer-Verlag, New York, 1995.