Tunnel-free supercover 3D polygons and polyhedra

被引:13
作者
Andres, E [1 ]
Nehlig, P [1 ]
Francon, J [1 ]
机构
[1] UNIV STRASBOURG 1,LAB SCI IMAGE INFORMAT & TELEDETECT,F-67084 STRASBOURG,FRANCE
关键词
discrete 3D modelling; discrete lines; discrete planes; discrete polygons; discrete polyhedra; supercover;
D O I
10.1111/1467-8659.00137
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A new discrete 3D line and 3D polygon, called Supercover 3D line and Supercover 3D polygon, are introduced. Analytical definitions are provided. The Supercover 3D polygon is a tunnel free plane segment defined by vertices and edges. An edge is a Supercover 3D line segment. Two different polygons can share a common edge and if they do, the union of both polygons is tunnel free. This definition of discrete polygons has the ''most'' properties in common with the continuous polygons. It is particularly interesting for modeling od discrete scenes, especially using tunnel-free discrete polyhedra. Algorithms for computing Supercover 3D Lines and Polygons are given and illustrated.
引用
收藏
页码:C3 / C13
页数:11
相关论文
共 10 条
[1]  
AMANATIDES J, P EUR 87, P3
[2]  
ANDRES E, 1992, THESIS U L PASTEUR S
[3]  
ANDRES E, UNPUB CVGIP GMIP
[4]  
ANDRES E, LNCS, V1176, P237
[5]   ALGORITHM FOR COMPUTER CONTROL OF A DIGITAL PLOTTER [J].
BRESENHAM, JE .
IBM SYSTEMS JOURNAL, 1965, 4 (01) :25-30
[6]  
COHEN D, 1995, CVGIP GMIP, V57
[7]   Topology of an arithmetic plane [J].
Francon, J .
THEORETICAL COMPUTER SCIENCE, 1996, 156 (1-2) :159-176
[8]  
KAUFMAN A, P EUR 87, P197
[9]  
KAUFMAN A, P WORKSH INT 3D GRAP, P45
[10]  
REVEILLES JP, 1991, THESIS U L PASTEUR S