Abstract
We present a method for approximating a point sequence of input points by a G1-continuous (smooth) arc spline with the minimum number of segments while not exceeding a user-specified tolerance. Arc splines are curves composed of circular arcs and line segments (shortly: segments). For controlling the tolerance we follow a geometric approach: We consider a simple closed polygon P and two disjoint edges designated as the start s and the destination d. Then we compute a SMAP (smooth minimum arc path), i.e. a smooth arc spline running from s to d in P with the minimally possible number of segments. In this paper we focus on the mathematical characterization of possible solutions that enables a constructive approach leading to an efficient algorithm.In contrast to the existing approaches, we do not restrict the breakpoints of the arc spline to a predefined set of points but choose them automatically. This has a considerably positive effect on the resulting number of segments.
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.
