Affiliation:
1. Faculty of Organizational Sciences, Belgrade
Abstract
As toroid (polyhedral torus) could not be convex, it is questionable if it is
possible to 3-triangulate them (i.e. divide into tetrahedra with the original
vertices). Here, we will discuss some examples of toroids to show that for
each vertex number n ? 7, there exists a toroid for which triangulation is
possible. Also we will study the necessary number of tetrahedra for the
minimal triangulation.
Publisher
National Library of Serbia
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献