Chained segment offsetting for ray-based solid representations

We present a novel approach to offset solids in the context of fabrication. Our input solids can be given under any representation: boundary meshes, voxels, indicator functions or CSG expressions. The result is a ray-based representation of the offset solid directly used for visualization and fabrication: we never need to recover a boundary mesh in our context.We define the offset solid as a sequence of morphological operations along line segments. This is equivalent to offsetting the surface by a solid defined as a Minkowski sum of segments, also known as a zonotope. A zonotope may be used to approximate the Euclidean ball with precise error bounds.We propose two complementary implementations. The first is dedicated to solids represented by boundary meshes. It performs offsetting by modifying the mesh in sequence. The result is a mesh improper for direct display, but that can be resolved into the correct offset solid through a ray representation. The major advantage of this first approach is that no loss of information - re-sampling - occurs during the offsetting sequence. However, it applies only to boundary meshes and cannot mix sequences of dilations and erosions. Our second implementation is more general as it applies directly to a ray-based representation of any solid and supports any sequence of erosion and dilation along segments. We discuss its fast implementation on modern graphics hardware. Together, the two approaches result in a versatile tool box for the efficient offsetting of solids in the context of fabrication. Graphical abstractDisplay Omitted HighlightsOur method performs morphology operations on solids in the context of fabrication.We rely on sequences of erosions and dilations along line segments.Performance depends on the resulted surface area, rather than the offsetting size.

[1]  Chang-Hun Kim,et al.  Primitive Trees for Precomputed Distance Queries , 2013, Comput. Graph. Forum.

[2]  Roger Clinton Evans,et al.  Shaping geometric objects by cumulative translational sweeps , 1987 .

[3]  Aristides A. G. Requicha,et al.  Offsetting operations in solid modelling , 1986, Comput. Aided Geom. Des..

[4]  Mark Segal,et al.  The OpenGL Graphics System: A Specification , 2004 .

[5]  Sara McMains,et al.  A sweep and translate algorithm for computing voxelized 3D Minkowski sums on the GPU , 2014, Comput. Aided Des..

[6]  Ronald N. Perry,et al.  Adaptively sampled distance fields: a general representation of shape for computer graphics , 2000, SIGGRAPH.

[7]  João Luiz Dihl Comba,et al.  A survey of raster-based transparency techniques , 2011, Comput. Graph..

[8]  Tamy Boubekeur,et al.  Point morphology , 2014, ACM Trans. Graph..

[9]  Loren C. Carpenter,et al.  The A -buffer, an antialiased hidden surface method , 1984, SIGGRAPH.

[10]  Kin Chuen Hui.  Solid sweeping in image space—application in NC simulation , 2005, The Visual Computer.

[11]  Charlie C. L. Wang,et al.  Solid modeling of polyhedral objects by Layered Depth-Normal Images on the GPU , 2010, Comput. Aided Des..

[12]  Jean Serra,et al.  Image Analysis and Mathematical Morphology , 1983 .

[13]  Charlie C. L. Wang,et al.  Intersection-Free and Topologically Faithful Slicing of Implicit Solid , 2013, J. Comput. Inf. Sci. Eng..

[14]  Vadim Shapiro,et al.  Configuration products in geometric modeling , 2009, Symposium on Solid and Physical Modeling.

[15]  Takashi Maekawa,et al.  An overview of offset curves and surfaces , 1999, Comput. Aided Des..

[16]  Jarek Rossignac,et al.  Solid-interpolating deformations: Construction and animation of PIPs , 1991, Comput. Graph..

[17]  Leonidas J. Guibas,et al.  Zonotopes as bounding volumes , 2003, SODA '03.

[18]  Marcel Campen,et al.  Polygonal Boundary Evaluation of Minkowski Sums and Swept Volumes , 2010, Comput. Graph. Forum.

[19]  Tibor Steiner,et al.  Minkowski sum boundary surfaces of 3D-objects , 2007, Graph. Model..

[20]  Jean Bourgain,et al.  Approximating the ball by a minkowski sum of segments with equal length , 1993, Discret. Comput. Geom..

[21]  Matthew Ming-Fai Yuen,et al.  Efficient slicing procedure based on adaptive layer depth normal image , 2011, Comput. Aided Des..

[22]  David W. Rosen,et al.  A Point-Based Offsetting Method of Polygonal Meshes , 2006 .

[23]  Dinesh Manocha,et al.  Accurate Minkowski sum approximation of polyhedral models , 2004, 12th Pacific Conference on Computer Graphics and Applications, 2004. PG 2004. Proceedings..

[24]  Dinesh Manocha,et al.  GPU-based offset surface computation using point samples , 2013, Comput. Aided Des..

[25]  Masatomo Inui,et al.  Fast inverse offset computation using polygon rendering hardware , 2003, Comput. Aided Des..

[26]  Krishnan Suresh,et al.  A computing strategy for applications involving offsets, sweeps, and Minkowski operations , 1999, Comput. Aided Des..

[27]  Jyh-Ming Lien,et al.  Covering Minkowski sum boundary using points with applications , 2008, Comput. Aided Geom. Des..

[28]  Takafumi Saito,et al.  NC machining with G-buffer method , 1991, SIGGRAPH.

[29]  Dominique Michelucci,et al.  Bridging the gap between CSG and Brep via a triple ray representation , 1997, SMA '97.

[30]  Richard Szeliski,et al.  Layered depth images , 1998, SIGGRAPH.

[31]  Leif Kobbelt,et al.  High‐Resolution Volumetric Computation of Offset Surfaces with Feature Preservation , 2008, Comput. Graph. Forum.

[32]  Mark E. Forsyth,et al.  Shelling and offsetting bodies , 1995, SMA '95.

[33]  Yuen-Shan Leung,et al.  GPU-Based Super-union for Minkowski Sum , 2013 .

[34]  Charlie C. L. Wang,et al.  Uniform offsetting of polygonal model based on Layered Depth-Normal Images , 2011, Comput. Aided Des..

[35]  Gershon Kedem,et al.  The Ray casting engine and Ray representatives , 1991, SMA '91.

[36]  Sara McMains,et al.  A GPU-based voxelization approach to 3D Minkowski sum computation , 2010, SPM '10.

[37]  Peter Hachenberger,et al.  Exact Minkowksi Sums of Polyhedra and Exact and Efficient Decomposition of Polyhedra into Convex Pieces , 2007, Algorithmica.