A new method of polyline approximation

DOI10.1007/978-3-540-27868-9_54MaRDI QIDQ5466365zbMATH OpenOpenAlexFDO

Authors Alexander Gribov, Eugene Bodansky

Publication date 24 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b98738

zbMATH Keywords

polyline approximationpolylinecompressionshape analysisvectorization

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Recommendations

• On the approximation of curves with polylines
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Approximating Polygonal Curves in Two and Three Dimensions
• scientific article; zbMATH DE number 4074316
• An optimal algorithm for polygonal approximation of digitized curves
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• The approximation order of polysplines

Cited in

(4)

• Vectorization of bitmaps based of the LSQ method.
• Closing gaps of discontinuous lines: A new criterion for choosing the best prolongation
• Smoothing and compression of lines obtained by raster-to-vector conversion
• Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling

This page was built for publication: A new method of polyline approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466365)