Abstract
In a previous paper (Lipovetsky and Dyn in Comput Aided Geom Des 48:36–48, 2016), we introduced a weighted binary average of two 2D point-normal pairs, termed circle average, and investigated subdivision schemes based on it. These schemes refine point-normal pairs in 2D and converge to limit curves and limit normals. Such a scheme has the disadvantage that the limit normals are not the normals of the limit curve. In this paper, we address this problem by proposing a new averaging method and obtaining a new family of algorithms based on it. We demonstrate their new editing capabilities and apply this subdivision technique to smooth a precomputed feasible polygonal point robot path.
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 callDisclaimer: 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.
