Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
From MaRDI portal
Publication:5458565
DOI10.1007/978-3-540-78773-0_54zbMath1136.68550OpenAlexW1967677853MaRDI QIDQ5458565
Sergey Bereg, Wencheng Wang, Binhai Zhu, Boting Yang, Ming-Hui Jiang
Publication date: 15 April 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-78773-0_54
Related Items
On the Chain Pair Simplification Problem, Consistent simplification of polyline tree bundles, Universal approximate simplification under the discrete Fréchet distance, Approximate nearest neighbor for curves: simple, efficient, and deterministic, Global Curve Simplification, A Retrospective on Genomic Preprocessing for Comparative Genomics
Cites Work
- Near-linear time approximation algorithms for curve simplification
- Efficiently approximating polygonal paths in three and higher dimensions
- Optimal output-sensitive convex hull algorithms in two and three dimensions
- Linear Programming in Linear Time When the Dimension Is Fixed
- APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
- The Approximability of the Exemplar Breakpoint Distance Problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
