Abstract
A robust algorithm for removing both local and global self intersections in a planar offset curve is presented. Our scheme is based on the minimum distance from a point to an original parametric curve. The method consists of the following two steps: 1) in the 2D plane, generation of the field of minimum distance from a point to an original planar parametric curve, 2) in the field, extraction of the iso-curve, regarding the offset distance as the minimum distance. The iso-curve is the non-self-intersection offset curve. Therefore, the advantage of our method is that the planar offset curve does not need to be approximated by a rational curve; however, both local and global self-intersections in the offset curve can be directly and automatically eliminated.
Sign-in/Register to access full text options 
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: International Journal of Computer Aided Engineering and Technology
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.
