ROBUST NONPARAMETRIC SIMPLIFICATION OF POLYGONAL CHAINS

DOI10.1142/S021819591360011XzbMath1318.68183OpenAlexW2100302985WikidataQ57009378 ScholiaQ57009378MaRDI QIDQ2932518

Alexandre Leblanc, Jason Morrison, Matthew Skala, Stephane Durocher

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)

Cites Work

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