Abstract
We present a free space computation algorithm for two planar bodies bounded by line segments and circular arcs. The computational complexity is O(((mn)2+k)log(mn)) with m and n the number of boundary curves of the two bodies, and with k the number of configurations with three pairs of curves in contact. Although k is in O((mn)3), mild input restrictions reduce it to O(mn). We develop a robust implementation that is accurate, is fast, and handles degenerate input.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Transactions on Automation Science and Engineering
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
