A CONVEX DECOMPOSITION USING CONVEX HULLS AND LOCAL CAUSE OF ITS NONCONVERGENCE

被引：17
作者：
KIM, YS
WILDE, DJ
机构：
[1] Design Division, Department of Mechanical Engineering, Stanford University, Stanford, CA
[2] Department of General Engineering, University of Illinois at Urbana-Champaign, Urbana, IL
来源：
JOURNAL OF MECHANICAL DESIGN | 1992年 / 114卷 / 03期
关键词：
D O I：
10.1115/1.2926574
中图分类号：
TH [机械、仪表工业];
学科分类号：
0802 ;
摘要：
To exploit convexity, a non-convex object can be represented by a boolean combination of convex components. A convex decomposition method of polyhedral objects uses convex hulls and set difference operations. This decomposition, however, may not converge. In this article, we formalize this decomposition method and find local cause of non-convergence.
引用
收藏
页码：459 / 467
页数：9
相关论文
共 25 条
[1]  
Appel A., Will P., Determining the Three-dimensional Convex Hull of a Polyhedron, IBM J. Res. Develop., (1976)
[2]  
Baumgart B., Geometric Modeling for Computer Vision, (1974)
[3]  
Boyse J., Interference Detection Among Solids and Surfaces, Communications of ACM, 22, 1, (1979)
[4]  
Chazelle B., Computational Geometry and Convexity, (1980)
[5]  
Feng H., Pavlidis T., Decomposition of Polygons into Simpler Components: Feature Generation for Syntactic Recognition, IEEE Trans. Comput., C-24, (1975)
[6]  
Garey M., Johnson D., Preparata F., Tarjan R., Triangulating a Simple Polygon, Information Processing Letters, 7, 4, (1978)
[7]  
Grunbaum B., Convex Poiytopes, (1967)
[8]  
Kelly P.J., Weiss M.L., Geometry and Convexity, (1979)
[9]  
Kim Y.S., Spatial Planning Using Convex Hulls, Proc. ASME Computers in Engineering Conf., (1988)
[10]  
Kim Y.S., Convex Decomposition and Solid Geometric Modeling, (1990)
123