Area-preserving approximations of polygonal paths
From MaRDI portal
Publication:866543
DOI10.1016/j.jda.2005.06.008zbMath1106.68110OpenAlexW2123306533WikidataQ59782392 ScholiaQ59782392MaRDI QIDQ866543
Prosenjit Bose, Bettina Speckmann, Sergio Cabello, Joachim Gudmundsson, Marc J. van Kreveld, Otfried Schwarzkopf
Publication date: 14 February 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2005.06.008
Related Items (3)
Distance-preserving approximations of polygonal paths ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Progressive simplification of polygonal curves
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Matching convex shapes with respect to the symmetric difference
- On the complexity of halfspace area queries
- Efficiently approximating polygonal paths in three and higher dimensions
- Efficient piecewise-linear function approximation using the uniform metric
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Simplifying a polygonal subdivision while keeping it simple
This page was built for publication: Area-preserving approximations of polygonal paths