Topology simplification for polygonal virtual environments

被引:32
作者
El-Sana, J [1 ]
Varshney, A [1 ]
机构
[1] SUNY Stony Brook, Dept Comp Sci, Stony Brook, NY 11794 USA
基金
美国国家科学基金会;
关键词
CR categories and subject descriptors : 1.3.3 [computer graphics; picture/image generation display algorithms; 1.3.5 [computer graphics; computational geometry and object modeling curve; surface; solid; and object representations; hierarchical approximation; model simplification; levels-of-detail generation; shape approximation; geometric modeling; topology simplification; CAD model repair;
D O I
10.1109/2945.694955
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a topology simplifying approach that can be used for genus reductions, removal of protuberances, and repair of cracks in polygonal models in a unified framework. Our work is complementary to the existing work on geometry simplification of polygonal datasets and we demonstrate that using topology and geometry simplifications together yields superior multiresolution hierarchies than is possible by using either of them alone. Our approach can also address the important issue of repair of cracks in polygonal models, as well as for rapid identification and removal of protuberances based on internal accessibility in polygonal models. Our approach is based on identifying holes and cracks by extending the concept of a;shapes to polygonal meshes under the L-infinity distance metric. We then generate valid triangulations to fill them using the intuitive notion of sweeping an L-infinity cube over the identified regions.
引用
收藏
页码:133 / 144
页数:12
相关论文
共 35 条
[1]   GENERATION OF CONFIGURATION SPACE OBSTACLES - THE CASE OF A MOVING SPHERE [J].
BAJAJ, C ;
KIM, MS .
IEEE JOURNAL OF ROBOTICS AND AUTOMATION, 1988, 4 (01) :94-99
[2]  
BAREQUET C, 1997, P IEEE VISUALIZATION, P363
[3]  
BAUM DR, 1991, COMP GRAPH, V25, P51, DOI 10.1145/127719.122724
[4]  
BERNARDINI F, 1997, CSD97013 PURD U DEP
[5]  
BOHN JH, 1993, GEOMETRIC MODELING P, P297
[6]   AN OPTIMAL ALGORITHM FOR INTERSECTING 3-DIMENSIONAL CONVEX POLYHEDRA [J].
CHAZELLE, B .
SIAM JOURNAL ON COMPUTING, 1992, 21 (04) :671-696
[7]   A FAST LAS-VEGAS ALGORITHM FOR TRIANGULATING A SIMPLE POLYGON [J].
CLARKSON, KL ;
TARJAN, RE ;
VANWYK, CJ .
DISCRETE & COMPUTATIONAL GEOMETRY, 1989, 4 (05) :423-432
[8]  
COHEN J., 1996, P SIGGRAPH 96, P119, DOI DOI 10.1145/237170.237220
[9]  
DEROSE TD, 1993, 93105 U WASH DEOP CO
[10]   3-DIMENSIONAL ALPHA-SHAPES [J].
EDELSBRUNNER, H ;
MUCKE, EP .
ACM TRANSACTIONS ON GRAPHICS, 1994, 13 (01) :43-72