Minimal Tetrahedralizations of a Class of Polyhedra |
| |
| Authors: | Boting Yang Cao An Wang |
| |
| Institution: | (1) Department of Computer Science, University of Regina, Regina, Saskatchewan, S4S 0A2, Canada.;(2) Department of Computer Science, Memorial University of Newfoundland, Elizabeth Avenue, St. John's, NFLD, A1B 3X5, Canada. |
| |
| Abstract: | Given a simple polyhedron P in the three dimensional Euclidean space, different tetrahedralizations of P may contain different numbers of tetrahedra. The minimal tetrahedralization is a tetrahedralization with the minimum number of tetrahedra. In this paper, we present some properties of the graph of polyhedra. Then we identify a class of polyhedra and show that this kind of polyhedra can be minimally tetrahedralized in O(n
2) time. |
| |
| Keywords: | computational geometry polyhedron tetrahedralization |
| 本文献已被 SpringerLink 等数据库收录！ |
|
