Fast swept volume approximation of complex polyhedral models

We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a path specified as a parametric curve, our algorithm enumerates a superset of the boundary surfaces of SV. It consists of ruled and developable surface primitives, and the SV corresponds to the outer boundary of their arrangement. We approximate this boundary by using a five-stage pipeline. This includes computing a bounded-error approximation of each surface primitive, computing unsigned distance fields on a uniform grid, classifying all grid points using fast marching front propagation, iso-surface reconstruction, and topological refinement. We also present a novel and fast algorithm for computing the signed distance of surface primitives as well as a number of techniques based on surface culling, fast marching level-set methods and rasterization hardware to improve the performance of the overall algorithm. We analyze different sources of error in our approximation algorithm and highlight its performance on complex models composed of thousands of polygons. In practice, it is able to compute a bounded error approximation in tens of seconds for models composed of thousands of polygons sweeping along a complex trajectory.

[1]  H. Piaggio.  Differential Geometry of Curves and Surfaces , 1952, Nature.

[2]  Tim Van Hook.  Real-time shaded NC milling display , 1986, SIGGRAPH.

[3]  K. K. Wang,et al.  Real-time verification of multiaxis NC programs with raster graphics , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[5]  Ralph R. Martin,et al.  Sweeping of three-dimensional objects , 1990, Comput. Aided Des..

[6]  Ming C. Leu,et al.  Geometric Representation of Swept Volumes with Application to Polyhedral Objects , 1990, Int. J. Robotics Res..

[7]  F. Litvin,et al.  Swept Volume Determination and Interference Detection for Moving 3-D Solids , 1991 .

[8]  Soon-Bum Lim,et al.  Approximate General Sweep Boundary of a 2D Curved Object, , 1993, CVGIP Graph. Model. Image Process..

[9]  James H. Oliver,et al.  NC milling error assessment and tool path correction , 1994, SIGGRAPH.

[10]  William E. Lorensen,et al.  Implicit modeling of swept surfaces and volumes , 1994, Proceedings Visualization '94.

[11]  Leonidas J. Guibas,et al.  Vertical decompositions for triangles in 3-space , 1994, SCG '94.

[12]  Peter K. Allen,et al.  Swept volumes and their use in viewpoint computation in robot work-cells , 1995, Proceedings. IEEE International Symposium on Assembly and Task Planning.

[13]  Dinesh Manocha,et al.  Efficient rendering of trimmed NURBS surfaces , 1995, Comput. Aided Des..

[14]  Geert-Jan Giezeman,et al.  The CGAL Kernel: A Basis for Geometric Computation , 1996, WACG.

[15]  André Crosnier,et al.  Swept volumes generated from deformable objects application to NC verification , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[16]  J A Sethian,et al.  A fast marching level set method for monotonically advancing fronts. , 1996, Proceedings of the National Academy of Sciences of the United States of America.

[17]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[18]  Karim Abdel-Malek,et al.  On the determination of starting points for parametric surface intersections , 1997, Comput. Aided Des..

[19]  Karim Abdel-Malek,et al.  Analytical Boundary of the Workspace for General3-DOF Mechanisms , 1997, Int. J. Robotics Res..

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

[21]  Patrick G. Xavier,et al.  Fast swept-volume distance for robust collision detection , 1997, Proceedings of International Conference on Robotics and Automation.

[22]  Karim Abdel-Malek,et al.  Geometric representation of the swept volume using Jacobian rank-deficiency conditions , 1997, Comput. Aided Des..

[23]  S.F.F. Gibson,et al.  Using distance maps for accurate surface representation in sampled volumes , 1998, IEEE Symposium on Volume Visualization (Cat. No.989EX300).

[24]  Daniel Cohen-Or,et al.  Three-dimensional distance field metamorphosis , 1998, TOGS.

[25]  Alfred M. Bruckstein,et al.  Multivalued distance maps for motion planning on surfaces with moving obstacles , 1998, IEEE Trans. Robotics Autom..

[26]  W. Schroeder,et al.  Application of path planning and visualization for industrial-design and maintainability-analysis , 1998, Annual Reliability and Maintainability Symposium. 1998 Proceedings. International Symposium on Product Quality and Integrity.

[27]  Kenneth I. Joy,et al.  Boundary determination for trivariate solids , 1999, Proceedings. Seventh Pacific Conference on Computer Graphics and Applications (Cat. No.PR00293).

[28]  Sigal Raab,et al.  Controlled perturbation for arrangements of polyhedral surfaces with application to swept volumes , 1999, SCG '99.

[29]  Luiz Velho,et al.  A unified approach for hierarchical adaptive tesselation of surfaces , 1999, TOGS.

[30]  Karim Abdel-Malek,et al.  Multiple sweeping using the Denavit-Hartenberg representation method , 1999, Comput. Aided Des..

[31]  Gershon Elber,et al.  Offsets, sweeps, and Minkowski sums , 1999, Comput. Aided Des..

[32]  Dinesh Manocha,et al.  Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[33]  Kenneth I. Joy,et al.  Using isosurface methods for visualizing the envelope of a swept trivariate solid , 2000, Proceedings the Eighth Pacific Conference on Computer Graphics and Applications.

[34]  Zoë J. Wood,et al.  Semi-regular mesh extraction from volumes , 2000, Proceedings Visualization 2000. VIS 2000 (Cat. No.00CH37145).

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

[36]  Peter K. Allen,et al.  Computing swept volumes , 2000, Comput. Animat. Virtual Worlds.

[37]  Sung Yong Shin,et al.  Three-Dimensional Topological Sweep for Computing Rotational Swept Volumes of Polyhedral Objects , 2000, Int. J. Comput. Geom. Appl..

[38]  Tony Field,et al.  A Simple Recursive Tessellator for Adaptive Surface Triangulation , 2000, J. Graphics, GPU, & Game Tools.

[39]  Dinesh Manocha,et al.  Fast and simple 2D geometric proximity queries using graphics hardware , 2001, I3D '01.

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

[41]  Tao Ju,et al.  Dual contouring of hermite data , 2002, ACM Trans. Graph..

[42]  Min Chen,et al.  Image‐Swept Volumes , 2002, Comput. Graph. Forum.

[43]  Mitul Saha,et al.  Exact Collision Checking of Robot Paths , 2002, WAFR.

[44]  Jingzhou Yang,et al.  Towards understanding the workspace of human limbs , 2004, Ergonomics.

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