Approximating the packedness of polygonal curves
From MaRDI portal
Publication:2088893
DOI10.1016/j.comgeo.2022.101920zbMath1497.68529arXiv2009.07789OpenAlexW3084889871WikidataQ114195448 ScholiaQ114195448MaRDI QIDQ2088893
Yuan Sha, Sampson Wong, Joachim Gudmundsson
Publication date: 6 October 2022
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.07789
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Approximating the Fréchet distance for realistic curves in near linear time
- Partitioning arrangements of lines. II: Applications
- Cutting hyperplanes for divide-and-conquer
- Motion planning in environments with low obstacle density
- Linear size binary space partitions for uncluttered scenes
- Probabilistic embeddings of the Fréchet distance
- Reporting and counting segment intersections
- Realistic input models for geometric algorithms
- Comparison of distance measures for planar curves
- Fast algorithms for approximate Fréchet matching queries in geometric trees
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Range Searching and Point Location among Fat Objects
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Approximate Map Matching with respect to the Fréchet Distance
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
- The frechet distance revisited and extended
- Fréchet Distance for Curves, Revisited
- Geometric optimization and sums of algebraic functions
This page was built for publication: Approximating the packedness of polygonal curves
