Polyline simplification has cubic complexity
From MaRDI portal
Publication:5854562
DOI10.20382/jocg.v11i2a5zbMath1462.68203arXiv1810.00621OpenAlexW3135197281MaRDI QIDQ5854562
Karl Bringmann, Bhaskar Chaudhury
Publication date: 17 March 2021
Full work available at URL: https://arxiv.org/abs/1810.00621
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (4)
Scheduling lower bounds via AND subset sum ⋮ Place the Vertices Anywhere on the Curve and Simplify ⋮ Global Curve Simplification ⋮ Fine-grained complexity theory: conditional lower bounds for computational geometry
This page was built for publication: Polyline simplification has cubic complexity
