Abstract
The problem of recognition of a polyline as a sequence of geometric primitives is important for the resolution of applied tasks such as post-processing of lines obtained as a result of vectorization; polygonal line compression; recognition of characteristic features; noise filtering; and text, symbol, and shape recognition. Here, a method is proposed for the approximation of polylines with straight segments, circular arcs, and free curves. © Springer-Verlag Berlin Heidelberg 2006.
Author supplied keywords
Cite
CITATION STYLE
Bodansky, E., & Gribov, A. (2006). Approximation of a polyline with a sequence of geometric primitives. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4142 LNCS, pp. 468–478). Springer Verlag. https://doi.org/10.1007/11867661_42
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
