Robust nonparametric simplification of polygonal chains

DOI10.1142/S021819591360011XMaRDI QIDQ2932518zbMATH OpenOpenAlexWikidataFDO

Authors Stephane Durocher, Alexandre Leblanc, Jason Morrison, Matthew Skala

Publication date 1 December 2014

Published in International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s021819591360011x

zbMATH Keywords

nonparametric methodspolygonal line approximationrobust simplification

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Robust nonparametric data approximation of point sets via data reduction
• Efficient algorithms for approximating polygonal chains
• A non-parametric sequential method for polygonal approximation of digital curves
• scientific article; zbMATH DE number 1947379
• Near-linear time approximation algorithms for curve simplification

Cites work

• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Cartographic line simplification and polygon CSG formulae in O(n^* n) time
• Deterministic sorting in O(nloglogn) time and linear space

Cited in

(1)

• Robust nonparametric data approximation of point sets via data reduction

This page was built for publication: Robust nonparametric simplification of polygonal chains

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