Affiliation:
1. University of Belgrade, Faculty of Organizational Sciences, Belgrade, Serbia
Abstract
It is known that we can always 3-triangulate (i.e. divide into tetrahedra
with the original vertices) convex polyhedra but not always non-convex ones.
Polyhedra topologically equivalent to ball with p handles, shortly
p-toroids, cannot be convex. So, it is interesting to investigate
possibilities and properties of their 3-triangulations. Here we study the
minimal number of necessary tetrahedra for the triangulation of a
3-triangulable p-toroid. For that purpose, we developed the concept of
piecewise convex polyhedron and that of its connection graph.
Publisher
National Library of Serbia
Reference19 articles.
1. J. Bokowski, A. Eggert, All realizations of M¨obius torus with 7 vertices, Structural Topology 17 (1991), 59-78.
2. J. Bokowski, On tori of Császár and Szilassi and more, Visual Math. (2005). http://www.mi.sanu.ac.rs/vismath/visbook/bokowsky/
3. U. Brehm, A maximal symmetric polyhedron of genus 3 with 10 vertices, Mathematika 34 (2) (1987), 237-242.
4. A. Császár, A polyhedron without diagonals, Acta Sci. Math. Univ. Szeged. 13 (1949), 140-142.
5. H. Edelsbrunner, F. P. Preparata, D. B. West, Tetrahedrizing point sets in three dimensions, J. Symbolic Comput. 10 (1990), 335-347.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献