An algorithm for automatically fitting digitized curves
Graphics gems
Dynamic Shapes of Arbitrary Dimension: The Vector Distance Functions
Proceedings of the 9th IMA Conference on the Mathematics of Surfaces
Least Squares Orthogonal Distance Fitting of Curves and Surfaces in Space (Lecture Notes in Computer Science)
| Hi-index | 0.00 |
Computer-based drawing is important for applications ranging from sketching for illustration and design to signature capture for identity verification. While digital input devices typically provide a sequence of digitized points, applications often require input in the form of a parametric curve. Unfortunately, current methods for fitting curves to points can be complex, often require significant preprocessing of the digitized points, and can fail, especially when the path of the input points is complicated and self-intersecting. In addition, current methods typically require a full sequence of digitized points (e.g., all of the points recorded by a digital pen between pen-down and pen-up events) prior to determining any portion of the curve. This forces applications to draw an approximation of the curve until the full sequence is available (e.g., Adobe Illustrator draws the digitized points, while Microsoft's PowerPoint draws a polyline connecting the digitized points) and may result in a noticeable delay between the pen-up event and curve generation and/or a noticeable shape change when the generated curve replaces the approximation.