Minimal tetrahedralizations of a class of polyhedra

被引:1
|
作者
Yang, BT [1 ]
Wang, CA
机构
[1] Univ Regina, Dept Comp Sci, Regina, SK S4S 0A2, Canada
[2] Mem Univ Newfoundland, Dept Comp Sci, St Johns, NF A1B 3X5, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
computational geometry; polyhedron; tetrahedralization;
D O I
10.1023/B:JOCO.0000038910.06360.0a
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
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.
引用
收藏
页码:241 / 265
页数:25
相关论文
共 50 条