Victor Milenkovic
ABSTRACT
We present a new approach, called controlled linear perturbation (CLP), to the robustness problem in computational geometry and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accurately and efficiently using computer arithmetic. Large errors can occur when predicates are assigned inconsistent truth values because the computation assigns incorrect signs to the associated polynomials. CLP enforces consistency by performing a small input perturbation, which it computes using differential calculus. CLP enables us to compute Minkowski sums via convex convolution, whereas prior work uses convex decomposition, which has far greater complexity. Our program is fast and accurate even on inputs with many degeneracies.
- C. Burnikel, S. Funke, and M. Seel. Exact arithmetic using cascaded computation. In Proceedings of the Symposium on Computational Geometry, pages 175--183, 1998. Google Scholar
Digital Library
- Computational geometry algorithms library. http://www.cgal.org/.Google Scholar
- Exact computational geometry. http://cs.nyu.edu/exact.Google Scholar
- H. Edelsbrunner and E. P. Mücke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Transactions on Graphics, 9(1):66--104, 1990. Google ScholarDigital Library
- A. Eigenwillig and M. Kerber. Exact and efficient 2d-arrangements of arbitrary algebraic curves. In Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA08), pages 122--131, 2008. Google ScholarDigital Library
- I. Emiris, J. Canny, and R. Seidel. Efficient perturbations for handling geometric degeneracies. Algorithmica, 19(1--2):219--242, 1997.Google Scholar
- S. Fortune. Polyhedral modelling with multiprecision integer arithmetic. Computer-Aided Design, 29(2):123--133, 1997.Google ScholarCross Ref
- S. Fortune. Vertex-rounding a three-dimensional polyhedral subdivision. Discrete and Computational Geometry, 22:593--618, 1999.Google ScholarCross Ref
- S. Funke, C. Klein, K. Mehlhorn, and S. Schmitt. Controlled perturbation for delaunay triangulations. In SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pages 1047--1056, Philadelphia, PA, USA, 2005. Society for Industrial and Applied Mathematics. Google ScholarDigital Library
- P. Hachenberger. Exact minkowski sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces. Algorithmica, 55:329--345, 2009. Google ScholarDigital Library
- D. Halperin and E. Leiserowitz. Controlled perturbation for arrangements of circles. International Journal of Computational Geometry and Applications, 14(4--5):277--310, 2004.Google ScholarCross Ref
- D. Halperin and C. Shelton. A perturbation scheme for spherical arrangements with application to molecular modeling. Computational Geometry: Theory and Applications, 10(4):273--288, 1998. Google ScholarDigital Library
- A. Kaul and M. A. O'Connor. Computing minkowski sums of regular polyhedra. Technical Report RC 18891, IBM Research Division, Yorktown Heights, 1993.Google Scholar
- J.-M. Lien. Covering minkowski sum boundary using points with applications. Computer Aided Geometric Design, 25:652--666, 2008. Google ScholarDigital Library
- V. Milenkovic and E. Sacks. An approximate arrangement algorithm for semi-algebraic curves. International Journal of Computational Geometry and Applications, 17(2), 2007.Google ScholarCross Ref
- V. Milenkovic and E. Sacks. A monotonic convolution for Minkowski sums. International Journal of Computational Geometry and Applications, 17(4):383--396, 2007.Google ScholarCross Ref
- V. Milenkovic and E. Sacks. Approximate set operations and Euclidean transformations on planar regions. Submitted to International Journal of Computational Geometry and Applications, 2008.Google Scholar
- V. Milenkovic and E. Sacks. Two approximate minkowski sum algorithms. International Journal of Computational Geometry and Applications, 2008. accepted.Google Scholar
- S. Raab. Controlled perturbation for arrangements of polyhedral surfaces. In Proceedings of the 15th Symposium on Computational Geometry, pages 163--172. ACM, 1999. Google ScholarDigital Library
- G. Varadhan and D. Manocha. Accurate minkowski sum approximation of polyhedral models. Graphical Models, 68(4):343--355, 2006. Google ScholarDigital Library
- C. Yap. Robust geometric computation. In J. E. Goodman and J. O'Rourke, editors, Handbook of discrete and computational geometry. CRC Press, Boca Raton, FL, second edition, 2004.Google ScholarDigital Library
Index Terms
- Robust Minkowski sums of polyhedra via controlled linear perturbation
Recommendations
Controlled linear perturbation
We present an algorithmic solution to the robustness problem in computational geometry, called controlled linear perturbation, and demonstrate it on Minkowski sums of polyhedra. The robustness problem is how to implement real RAM algorithms accurately ...
Exact minkowski sums of convex polyhedra
SCG '05: Proceedings of the twenty-first annual symposium on Computational geometryWe present an exact imp ementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R3. Our implementation is complete in the sense that it does not assume general position, namely, it can handle degenerate input, and ...
Exact and efficient construction of Minkowski sums of convex polyhedra with applications
We present an exact implementation of an efficient algorithm that computes Minkowski sums of convex polyhedra in R^3. Our implementation is complete in the sense that it does not assume general position. Namely, it can handle degenerate input, and it ...
Comments