Sketching Clothoid Splines Using Shortest Paths

Simple item page
dc.contributor.authorBaran, Ilyaen_US
dc.contributor.authorLehtinen, Jaakkoen_US
dc.contributor.authorPopovic, Jovanen_US
dc.date.accessioned2015-02-23T16:42:00Z
dc.date.available2015-02-23T16:42:00Z
dc.date.issued2010en_US
dc.description.abstractClothoid splines are gaining popularity as a curve representation due to their intrinsically pleasing curvature, which varies piecewise linearly over arc length. However, constructing them from hand-drawn strokes remains difficult. Building on recent results, we describe a novel algorithm for approximating a sketched stroke with a fair (i.e., visually pleasing) clothoid spline. Fairness depends on proper segmentation of the stroke into curve primitives - lines, arcs, and clothoids. Our main idea is to cast the segmentation as a shortest path problem on a carefully constructed weighted graph. The nodes in our graph correspond to a vastly overcomplete set of curve primitives that are fit to every subsegment of the sketch, and edges correspond to transitions of a specified degree of continuity between curve primitives. The shortest path in the graph corresponds to a desirable segmentation of the input curve. Once the segmentation is found, the primitives are fit to the curve using non-linear constrained optimization. We demonstrate that the curves produced by our method have good curvature profiles, while staying close to the user sketch.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume29en_US
dc.identifier.doi10.1111/j.1467-8659.2009.01635.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages655-664en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2009.01635.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleSketching Clothoid Splines Using Shortest Pathsen_US
Files
Collections
29-Issue 2
Full Papers 2010 - CGF 29-Issue 2