Non-overlapping Volume Decomposition Using Maximum Volumes

In this paper, we propose a non-overlapping volume decomposition method that decomposes a solid model into non-overlapped volumes. The non-overlapping volume decomposition finds non-overlapped volumes from maximum volumes. After introducing the concept of the nonoverlapping volume decomposition, we discuss technical issues and solutions for them. The non-overlapping volume decomposition is verified by the experiments with a prototype system. From the experiments, it was found that the non-overlapping volume decomposition shows better result than maximum volume decomposition from the view point of design feature recognition.

[1]  S. H. Chuang,et al.  Three-dimensional shape pattern recognition using vertex classification and vertex-edge graphs , 1990, Comput. Aided Des..

[2]  Yonn-Hwan Woo Decomposition-Based Simplification of Machined Part in Solid Model , 2007 .

[3]  Jami J. Shah,et al.  A Discourse on Geometric Feature Recognition From CAD Models , 2001, J. Comput. Inf. Sci. Eng..

[4]  Sang Hun Lee,et al.  Volumetric modification of solid CAD models independent of design features , 2006, Adv. Eng. Softw..

[5]  Yoonhwan Woo Automatic simplification of solid models for engineering analysis independent of modeling sequences , 2009 .

[6]  Y. S. Kim,et al.  Recognition of machining features for cast then machined parts , 2002, Comput. Aided Des..

[7]  K. Tang,et al.  Algorithmic aspects of alternating sum of volumes. Part 1: Data structure and difference operation , 1991, Comput. Aided Des..

[8]  Hiroshi Sakurai,et al.  Recognition of maximal features by volume decomposition , 2002, Comput. Aided Des..

[9]  Yoon-Hwan Woo Modification of Solid Models Independent of Design Features , 2008 .

[10]  JungHyun Han,et al.  Manufacturing feature recognition from solid models: a status report , 2000, IEEE Trans. Robotics Autom..

[11]  Jami J. Shah,et al.  Automatic recognition of interacting machining features based on minimal condition subgraph , 1998, Comput. Aided Des..

[12]  Aristides A. G. Requicha,et al.  Spatial Reasoning for the Automatic Recognition of Machinable Features in Solid Models , 1993, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Yunfeng Zhang,et al.  A volume decomposition approach to machining feature extraction of casting and forging components , 2001, Comput. Aided Des..

[14]  Soonhung Han,et al.  Stepwise Volume Decomposition Considering Design Feature Recognition , 2013 .

[15]  T. C. Chang,et al.  Graph-based heuristics for recognition of machined features from a 3D solid model , 1988 .

[16]  Hiroshi Sakurai,et al.  Volume decomposition and feature recognition, Part II: curved objects , 1996, Comput. Aided Des..

[17]  D. Wilde,et al.  A Convergent Convex Decomposition of Polyhedral Objects , 1992 .

[18]  Hiroshi Sakurai,et al.  Volume decomposition and feature recognition: part 1 - polyhedral objects , 1995, Comput. Aided Des..

[19]  Satyandra K. Gupta,et al.  Extracting alternative machining features: An algorithmic approach , 1995 .

[20]  Prasad S. Gavankar,et al.  Graph-based extraction of protrusions and depressions from boundary representations , 1990, Comput. Aided Des..

[21]  Yong Se Kim,et al.  Recognition of form features using convex decomposition , 1992, Comput. Aided Des..

[22]  Yoonhwan Woo Fast cell-based decomposition and applications to solid modeling , 2003, Comput. Aided Des..

[23]  Timothy J. Tautges,et al.  Feature based hex meshing methodology: feature recognition and volume decomposition , 2001, Comput. Aided Des..