On the Chain Pair Simplification Problem
From MaRDI portal
Publication:3449833
DOI10.1007/978-3-319-21840-3_29zbMath1451.68300arXiv1409.2457OpenAlexW2110125031MaRDI QIDQ3449833
Binhai Zhu, Tim Wylie, Chenglin Fan, Omrit Filtser, Matthew J. Katz
Publication date: 30 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.2457
Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items
Consistent simplification of polyline tree bundles ⋮ Universal approximate simplification under the discrete Fréchet distance
Cites Work
- The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Four Soviets Walk the Dog—with an Application to Alt's Conjecture
- Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Computing the Discrete Fréchet Distance in Subquadratic Time