An Accelerated Slicing Algorithm for Frep Models

Complex 3D objects with microstructures can be modelled using the function representation (FRep) approach and then manufactured. The task of modelling a geometric object with a sophisticated microstructure based on unit cell repetition is often too computationally expensive for CAD systems. FRep provides efficient tools to solve this problem. However, even for FRep the slicing step required for manufacturing can take a significant amount of time. An accelerated slicing algorithm for FRep 3D objects is proposed in this paper. This algorithm allows the preparation of FRep models for 3D printing without surface generation stage. The spatial index is employed to accelerate the slicing process. A novel compound adaptive criterion and a novel acceleration criterion are proposed to speed up the evaluation of the defining function of an FRep object. The use of these criteria is significantly reducing the computational time for contour construction during the slicing process. The K-d tree and R-tree data structures are used as spatial indexes. The performance of the accelerated slicing algorithm was tested. The contouring time was reduced 100-fold due to using the novel compound adaptive criterion with the novel acceleration criterion.

[1]  Tim Foley,et al.  KD-tree acceleration structures for a GPU raytracer , 2005, HWWS '05.

[2]  John G. Michopoulos,et al.  Implicit slicing for functionally tailored additive manufacturing , 2016, Comput. Aided Des..

[3]  Ron Jamieson,et al.  Direct slicing of CAD models for rapid prototyping , 1995 .

[4]  Alexei Sourin,et al.  Function representation in geometric modeling: concepts, implementation and applications , 1995, The Visual Computer.

[5]  Alexander A. Pasko,et al.  Convolution Filtering of Continuous Signed Distance Fields for Polygonal Meshes , 2015, Comput. Graph. Forum.

[6]  Jon Louis Bentley,et al.  Quad trees a data structure for retrieval on composite keys , 1974, Acta Informatica.

[7]  Kellogg S. Booth,et al.  Heuristics for ray tracing using space subdivision , 1990, The Visual Computer.

[8]  Min Chen,et al.  Constructive Volume Geometry , 2000, Comput. Graph. Forum.

[9]  Tosiyasu L. Kunii,et al.  Bounded blending operations , 2002, Proceedings SMI. Shape Modeling International 2002.

[10]  Charles R. Dyer,et al.  Experiments on Picture Representation Using Regular Decomposition , 1976 .

[11]  Vlastimil Havran,et al.  Fast Robust BSP Tree Traversal Algorithm for Ray Tracing , 1997, J. Graphics, GPU, & Game Tools.

[12]  Mario A. López,et al.  R-trees , 2004, Handbook of Data Structures and Applications.

[13]  Chengke Wu,et al.  Kd-Tree Based OLS in Implicit Surface Reconstruction with Radial Basis Function , 2006, ICAT.

[14]  Pierre Poulin,et al.  Fitted BVH for Fast Raytracing of Metaballs , 2010, Comput. Graph. Forum.

[15]  Yuan Liu,et al.  Function representation based slicer for 3D printing , 2018, Comput. Aided Geom. Des..

[16]  L. Shapiro Connected Component Labeling and Adjacency Graph Construction , 1996 .

[17]  Alexander A. Pasko,et al.  Fast reliable interrogation of procedurally defined implicit surfaces using extended revised affine arithmetic , 2010, Comput. Graph..

[18]  Alexander A. Pasko,et al.  Efficient contouring of functionally represented objects for additive manufacturing , 2020, Comput. Aided Des..

[19]  Alexander A. Pasko,et al.  Multi-scale space-variant FRep cellular structures , 2013, Comput. Aided Des..

[20]  Alexander A. Pasko,et al.  Procedural function-based modelling of volumetric microstructures , 2011, Graph. Model..

[21]  Hans-Peter Kriegel,et al.  The R*-tree: an efficient and robust access method for points and rectangles , 1990, SIGMOD '90.

[22]  Carsten Maple,et al.  Geometric design and space planning using the marching squares and marching cube algorithms , 2003, 2003 International Conference on Geometric Modeling and Graphics, 2003. Proceedings.

[23]  H. Schwarz Gesammelte mathematische Abhandlungen , 1970 .

[24]  I. Akhatov,et al.  Design and Fabrication of Complex-Shaped Ceramic Bone Implants via 3D Printing Based on Laser Stereolithography , 2020, Applied Sciences.

[25]  Kang Li,et al.  Direct Geometry Processing for Telefabrication , 2012, J. Comput. Inf. Sci. Eng..

[26]  Kun Zhou,et al.  Multiscale vector volumes , 2011, SA '11.

[27]  Jon Louis Bentley,et al.  Multidimensional binary search trees used for associative searching , 1975, CACM.

[28]  J. Stolfi,et al.  An Introduction to Affine Arithmetic , 2003 .

[29]  T. Sunaga Theory of an interval algebra and its application to numerical analysis , 2009 .

[30]  Katja Bühler,et al.  Implicit linear interval estimations , 2002, SCCG '02.