An envelope generation algorithm for packing and layout applications

In this paper, an algorithm and associated procedure for computing the envelope of non-convex manifold objects is proposed. The envelope generation algorithm is developed in the context of vehicle packaging and layout and is intended for use during the conceptual phase of the vehicle design process. The envelope generation algorithm presented in this paper is designed to work with complex manifold geometry and can be interpreted as the non-convex hull of an object (or a set of objects). The algorithm presented in this paper is primarily intended for probabilistic envelope generation based on spatial occupancy, however it can also be used to generate the envelope of a set of objects, envelope with a desired offset from the outer surface of the object, and motion envelope of an object. The proposed method is based on voxelization of the manifold geometry and thus it converts surface representation into volumetric representation to generate the envelope. The proposed envelope generation algorithm is demonstrated on sufficiently complex hypothetical geometries and a real-world application of the proposed algorithm to vehicle occupant packaging is presented. This proposed envelope generation algorithm can reduce the design time and automate certain aspects of the vehicle design process.

[1]  Georges M. Fadel,et al.  A Fast and Efficient Compact Packing Algorithm for SAE and ISO Luggage Packing Problems , 2010, J. Comput. Inf. Sci. Eng..

[2]  S Subramaniam,et al.  Analytical shape computation of macromolecules: I. molecular area and volume through alpha shape , 1998, Proteins.

[3]  Hayong Shin,et al.  Self-intersection Removal in Triangular Mesh Offsetting , 2003 .

[4]  Hugues Hoppe,et al.  New quadric metric for simplifying meshes with appearance attributes , 1999, Proceedings Visualization '99 (Cat. No.99CB37067).

[5]  William E. Lorensen,et al.  Marching cubes: A high resolution 3D surface construction algorithm , 1987, SIGGRAPH.

[6]  Mario Botsch,et al.  Feature sensitive surface extraction from volume data , 2001, SIGGRAPH.

[7]  Michael Garland,et al.  Surface simplification using quadric error metrics , 1997, SIGGRAPH.

[8]  Ming C. Leu,et al.  The sweep-envelope differential equation algorithm and its application to NC machining verification , 1997, Comput. Aided Des..

[9]  Michael M. Kazhdan,et al.  Poisson surface reconstruction , 2006, SGP '06.

[10]  Arie E. Kaufman,et al.  Fundamentals of Surface Voxelization , 1995, CVGIP Graph. Model. Image Process..

[11]  Hans-Peter Seidel,et al.  An integrating approach to meshing scattered point data , 2005, SPM '05.

[12]  M. Leu,et al.  Analysis of Swept Volume via Lie Groups and Differential Equations , 1992 .

[13]  Tomas Akenine-Möller.  Fast 3D Triangle-Box Overlap Testing , 2001, J. Graphics, GPU, & Game Tools.

[14]  Brian Wyvill,et al.  Shrinkwrap: An efficient adaptive algorithm for triangulating an iso-surface , 2004, The Visual Computer.

[15]  Kenneth I. Joy,et al.  Swept Volumes: Fundation, Perspectives, and Applications , 2006, Int. J. Shape Model..

[16]  Sandeep Premkumar,et al.  Statistical Representations of Human Populations in Ergonomic Design , 2007 .

[17]  Min-Yang Yang,et al.  Offset Triangular Mesh Using the Multiple Normal Vectors of a Vertex , 2004 .

[18]  Dinesh Manocha,et al.  Fast swept volume approximation of complex polyhedral models , 2004, Comput. Aided Des..

[19]  张哉根,et al.  Leu-M , 1991 .

[20]  Georges M. Fadel,et al.  A Fast and Efficient Compact Packing Algorithm for Free-Form Objects , 2008, DAC 2008.