A SIMPLE AND RELATIVELY EFFICIENT TRIANGULATION OF THE N-CUBE

被引：40
作者：
HAIMAN, M
机构：
[1] Department of Mathematics, Massachusetts Institute of Technology, Cambridge, 02139, MA
来源：
DISCRETE & COMPUTATIONAL GEOMETRY | 1991年 / 6卷 / 04期
关键词：
D O I：
10.1007/BF02574690
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
The only previously published triangulation of the n-cube using o(n!) simplices, due to Sallee, uses O(n-2n!) simplices. We point out a very simple method of achieving O(rho-n(n!) simplices, where rho < 1 is a constant.
引用
收藏
页码：287 / 289
页数：3
相关论文
共 12 条
[1]  
BILLERA LJ, 1988, P K NED AKAD A MATH, V91, P375
[2]   MINIMAL TRIANGULATION OF THE 4-CUBE [J].
COTTLE, RW .
DISCRETE MATHEMATICS, 1982, 40 (01) :25-29
[3]  
LEE C, 1985, 3 P K DISKR GEOM, P173
[4]  
MARA PS, 1972, THESIS COLORADO STAT
[5]   A TRIANGULATION OF THE N-CUBE [J].
SALLEE, JF .
DISCRETE MATHEMATICS, 1982, 40 (01) :81-86
[6]   THE MIDDLE-CUT TRIANGULATIONS OF THE N-CUBE [J].
SALLEE, JF .
SIAM JOURNAL ON ALGEBRAIC AND DISCRETE METHODS, 1984, 5 (03) :407-419
[7]  
SMITH WD, 1987, UNPUB POLYTOPE TRIAN
[8]  
Stanley R.P, 1986, ENUMERATIVE COMBINAT, V1
[9]  
STANLEY RP, 1980, ANN DISCRETE MATH, V6, P333
[10]  
TODD MJ, 1976, LECTURE NOTES EC MAT, V142
12