Document Open Access Logo

Table Based Detection of Degenerate Predicates in Free Space Construction

Authors Victor Milenkovic, Elisha Sacks, Nabeel Butt



PDF
Thumbnail PDF

File

LIPIcs.SoCG.2018.61.pdf
  • Filesize: 4.18 MB
  • 14 pages

Document Identifiers

Author Details

Victor Milenkovic
Elisha Sacks
Nabeel Butt

Cite AsGet BibTex

Victor Milenkovic, Elisha Sacks, and Nabeel Butt. Table Based Detection of Degenerate Predicates in Free Space Construction. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 61:1-61:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
https://doi.org/10.4230/LIPIcs.SoCG.2018.61

Abstract

The key to a robust and efficient implementation of a computational geometry algorithm is an efficient algorithm for detecting degenerate predicates. We study degeneracy detection in constructing the free space of a polyhedron that rotates around a fixed axis and translates freely relative to another polyhedron. The structure of the free space is determined by the signs of univariate polynomials, called angle polynomials, whose coefficients are polynomials in the coordinates of the vertices of the polyhedra. Every predicate is expressible as the sign of an angle polynomial f evaluated at a zero t of an angle polynomial g. A predicate is degenerate (the sign is zero) when t is a zero of a common factor of f and g. We present an efficient degeneracy detection algorithm based on a one-time factoring of every possible angle polynomial. Our algorithm is 3500 times faster than the standard algorithm based on greatest common divisor computation. It reduces the share of degeneracy detection in our free space computations from 90% to 0.5% of the running time.
Keywords
  • free space construction
  • degenerate predicates
  • robustness

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Cgal, Computational Geometry Algorithms Library. http://www.cgal.org. Google Scholar
  2. Peter Hachenberger. Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra into convex pieces. Algorithmica, 55:329-345, 2009. Google Scholar
  3. Dan Halperin. Controlled perturbation for certified geometric computing with fixed-precision arithmetic. In ICMS, pages 92-95, 2010. Google Scholar
  4. Min-Ho Kyung, Elisha Sacks, and Victor Milenkovic. Robust polyhedral Minkowski sums with GPU implementation. Computer-Aided Design, 67–68:48-57, 2015. Google Scholar
  5. Naama Mayer, Efi Fogel, and Dan Halperin. Fast and robust retrieval of Minkowski sums of rotating convex polyhedra in 3-space. Computer-Aided Design, 43(10):1258-1269, 2011. Google Scholar
  6. Victor Milenkovic, Elisha Sacks, and Steven Trac. Robust free space computation for curved planar bodies. IEEE Transactions on Automation Science and Engineering, 10(4):875-883, 2013. Google Scholar
  7. Elisha Sacks, Nabeel Butt, and Victor Milenkovic. Robust free space construction for a polyhedron with planar motion. Computer-Aided Design, 90C:18-26, 2017. Google Scholar
  8. Elisha Sacks and Victor Milenkovic. Robust cascading of operations on polyhedra. Computer-Aided Design, 46:216-220, 2014. Google Scholar
  9. J. T. Schwartz. Fast probabilistic algorithms for verification of polynomial identities. Journal of the ACM, 27(4):701-717, 1980. URL: http://dx.doi.org/10.1145/322217.322225.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail