Combinatorics of Triangulated Polyhedra

被引:0
作者
Honvault, Pascal [1 ]
机构
[1] Univ Littoral Cote dOpale, LMPA Lab Math Pures & Appl Joseph Liouville, EA 2597, CNRS, F-62228 Calais, France
来源
JOURNAL FOR GEOMETRY AND GRAPHICS | 2018年 / 22卷 / 01期
关键词
polyhedron; combinatorics; triangulation;
D O I
暂无
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
We give an algorithm for computing the different combinatorics of a triangulated polyhedron with a fixed number of vertices.
引用
收藏
页码:41 / 47
页数:7
相关论文
共 6 条
[1]  
Alexandrov A. D., 2010, CONVEX POLYHEDRA
[2]  
Devadoss Satyan L., 2011, DISCRETE COMPUTATION
[3]  
FROMENTIN J., COMMUNICATION
[4]  
Negami S., 1999, YOKOHAMA MATH J, V47
[5]   The volume as a metric invariant of polyhedra [J].
Sabitov, IK .
DISCRETE & COMPUTATIONAL GEOMETRY, 1998, 20 (04) :405-425
[6]  
Wagner K., 1936, JBER DTSCH MATH VERE, V46, P26