Efficient algorithms for 3-D polygonal approximation based on LISE criterion

DOI10.1016/S0031-3203(01)00226-6zbMath1006.68906OpenAlexW2039228183MaRDI QIDQ1860236

Yanyan Li

Publication date: 20 February 2003

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0031-3203(01)00226-6

zbMATH Keywords

algorithmsdynamic programmingshortest pathsampling technique3-D polygonal approximationintegral square error criterion

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies and applications (68U99)

Related Items (1)

The equipartition of curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficiently approximating polygonal paths in three and higher dimensions
• A non-parametric sequential method for polygonal approximation of digital curves
• Fitting polygonal functions to a set of points in the plane
• Optimum polygonal approximation of digitized curves
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

This page was built for publication: Efficient algorithms for 3-D polygonal approximation based on LISE criterion