Computing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums

被引:17
作者
Liu, Min [1 ]
Liu, Yu-Shen [2 ]
Ramani, Karthik [2 ]
机构
[1] Tsinghua Univ, Inst Mfg Engn, Beijing 100084, Peoples R China
[2] Purdue Univ, Sch Mech Engn, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
Global visibility map; Global occlusion map; Local visibility map; Minkowski sum; CONSTRUCTION; ALGORITHMS; SURFACE;
D O I
10.1016/j.cad.2009.03.010
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A global visibility map is a spherical image built to describe the complete set of global visible view directions for a surface. In this paper, we consider the computation of global visibility maps for regions on the boundary of a polyhedron. Both the self-occlusions introduced by a region and the global occlusions introduced by the rest of the surfaces on the boundary of the polyhedron are considered for computing a global visibility map. We show that the occluded view directions introduced between a pair of polyhedral surfaces can be computed from the spherical projection of the Minkowski sum of one surface and the reflection of the other. A suitable subset of the Minkowski sum, which shares the identical spherical projection with the complete Minkowski sum, is constructed to obtain the spherical images representing global occlusions. Our method has been successfully tested on many CAD models. It extends the previous methods for computing global visibility maps using convex decomposition, and it exhibits a better performance. (C) 2009 Elsevier Ltd. All rights reserved.
引用
收藏
页码:668 / 680
页数:13
相关论文
共 41 条
[1]   Generating 5-axis NC roughing paths directly from a tessellated representation [J].
Balasubramaniam, M ;
Laxmiprasad, P ;
Sarma, S ;
Shaikh, Z .
COMPUTER-AIDED DESIGN, 2000, 32 (04) :261-277
[2]  
BASCH J, 1996, P 2 WORKSH ALG FDN R, P171
[3]  
BERBERICH E, 2007, P 15 ANN EUR S ALG, P645
[4]   A comparison of two fast algorithms for computing the distance between convex polyhedra [J].
Cameron, S .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1997, 13 (06) :915-920
[5]  
*CGAL, CGAL REF MAN
[6]   PARTING DIRECTIONS FOR MOLD AND DIE DESIGN [J].
CHEN, LL ;
CHOU, SY ;
WOO, TC .
COMPUTER-AIDED DESIGN, 1993, 25 (12) :762-768
[7]   SEPARATING AND INTERSECTING SPHERICAL POLYGONS - COMPUTING MACHINABILITY ON 3-AXIS, 4-AXIS AND 5-AXIS NUMERICALLY CONTROLLED MACHINES [J].
CHEN, LL ;
CHOU, SY ;
WOO, TC .
ACM TRANSACTIONS ON GRAPHICS, 1993, 12 (04) :305-326
[8]  
EGGERT DW, 1992, P ISPRS 17 C INT ARC, P633
[9]  
ELBER EG, 1999, COMPUTER AIDED DESIG, V31
[10]  
Elber G, 1995, 3 ACM IEEE S SOL MOD, P271