Point-Based Minkowski Sum Boundary

Minkowski sum is a fundamental operation in many geometric applications, including robotics, penetration depth estimation, solid modeling, and virtual prototyping. However, due to its high computational complexity and several nontrivial implementation issues, computing the exact boundary of the Minkowski sum of two arbitrary polyhedra is generally a difficult task. In this work, we propose to represent the boundary of the Minkowski sum approximately using only points. Our results show that this point-based representation can be generated efficiently. An important feature of our method is its straightforward implementation and parallelization. We also demonstrate that the point-based representation of the Minkowski sum boundary can indeed provide similar functionality as mesh-based representations can. We show several applications in motion planning, penetration depth approximation and modeling.

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

[2]  Markus H. Gross,et al.  Shape modeling with point-sampled geometry , 2003, ACM Trans. Graph..

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

[4]  Leonidas J. Guibas,et al.  Computing convolutions by reciprocal search , 1986, SCG '86.

[5]  Marc Levoy,et al.  QSplat: a multiresolution point rendering system for large meshes , 2000, SIGGRAPH.

[6]  Marc Alexa,et al.  Computing and Rendering Point Set Surfaces , 2003, IEEE Trans. Vis. Comput. Graph..

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

[8]  Philip Dutré,et al.  Interactive boolean operations on surfel-bounded solids , 2003, ACM Trans. Graph..

[9]  Gabriel Zachmann,et al.  Point Cloud Collision Detection , 2004, Comput. Graph. Forum.

[10]  Pijush K. Ghosh,et al.  A unified computational framework for Minkowski operations , 1993, Comput. Graph..

[11]  Dan Halperin,et al.  Robust Geometric Computing in Motion , 2002, Int. J. Robotics Res..

[12]  Peter Gritzmann,et al.  Minkowski Addition of Polytopes: Computational Complexity and Applications to Gröbner Basis , 1993, SIAM J. Discret. Math..

[13]  Markus H. Gross,et al.  Multi‐scale Feature Extraction on Point‐Sampled Surfaces , 2003, Comput. Graph. Forum.

[14]  Lutz Kettner,et al.  Boolean operations on 3D selective Nef complexes: optimized implementation and experiments , 2005, SPM '05.

[15]  Dan Halperin,et al.  Exact and efficient construction of Minkowski sums of convex polyhedra with applications , 2006, Comput. Aided Des..

[16]  Daniel Vallejo,et al.  OBPRM: an obstacle-based PRM for 3D workspaces , 1998 .

[17]  Mark H. Overmars,et al.  The Gaussian sampling strategy for probabilistic roadmap planners , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[18]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[19]  Komei Fukuda,et al.  From the zonotope construction to the Minkowski addition of convex polytopes , 2004, J. Symb. Comput..

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

[21]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

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

[23]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[24]  Dinesh Manocha,et al.  Star-shaped Roadmaps - A Deterministic Sampling Approach for Complete Motion Planning , 2005, Robotics: Science and Systems.

[25]  G. Swaminathan.  Robot Motion Planning , 2006 .

[26]  Roni Yagel,et al.  Octree-based decimation of marching cubes surfaces , 1996, Proceedings of Seventh Annual IEEE Visualization '96.