Abstract

We describe a recursive algorithm that uses quadratic algebraic curve segments to vectorize digital images. The closeness of fitting and the smoothness of connection between curve segments are ensured by a recursive algebraic curve fitting and a subsequent fine-tuning procedure. The idea is to provide an alternative way to vectorize outside parametric schemes, while maintaining the precision of parametric vectorization. We can also have all the new features of algebraic representation; for instance, the implicit forms and unique insights into curve shapes and control point weights. We also present a triangular quadtree rendering scheme for displaying algebraic curves. These algorithms combine features from both parametric and algebraic schemes to meet different requirements for curve fitting.

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 call

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.