论文信息 - Robust approximate assembly partitioning

Robust approximate assembly partitioning

We present a robust approximate assembly partitioning algorithm for polyhedral parts. We achieve robustness by applying our controlled linear perturbation strategy to Minkowski sums of polyhedra and to arrangements of great circle arcs. Our algorithm is far faster than a prior robust algorithm based on exact computational geometry. Its error is small even on degenerate input.

[1] Herbert Edelsbrunner,et al. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms , 1988, SCG '88.

[2] Michael Kerber,et al. ROBUST GEOMETRIC COMPUTATION , 2012 .

[3] Vincent Lefèvre,et al. MPFR: A multiple-precision binary floating-point library with correct rounding , 2007, TOMS.

[4] E. Welzl,et al. Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces , 2007 .

[5] Jean-Claude Latombe,et al. A General Framework for Assembly Planning: The Motion Space Approach , 1998, SCG '98.

[6] Raimund Seidel,et al. Efficient Perturbations for Handling Geometric Degeneracies , 1997, Algorithmica.

[7] Dan Halperin,et al. Polyhedral Assembly Partitioning With Infinite Translations or The Importance of Being Exact , 2013, IEEE Transactions on Automation Science and Engineering.

[8] Victor J. Milenkovic,et al. Robust Minkowski sums of polyhedra via controlled linear perturbation , 2010, SPM '10.

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