Approximating the Packedness of Polygonal Curves
From MaRDI portal
Publication:6065398
DOI10.4230/LIPICS.ISAAC.2020.9OpenAlexW3117045721MaRDI QIDQ6065398FDOQ6065398
Authors: Joachim Gudmundsson, Yuan Sha, Sampson Wong 
Publication date: 14 November 2023
Full work available at URL: https://arxiv.org/pdf/2009.07789
Cites Work
- Computational geometry. Algorithms and applications.
- Range Searching and Point Location among Fat Objects
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Approximating the Fréchet distance for realistic curves in near linear time
- Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts
- The frechet distance revisited and extended
- Comparison of distance measures for planar curves
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- Realistic input models for geometric algorithms
- Linear size binary space partitions for uncluttered scenes
- Fréchet Distance for Curves, Revisited
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Reporting and counting segment intersections
- Geometric optimization and sums of algebraic functions
- Motion planning in environments with low obstacle density
- Partitioning arrangements of lines. II: Applications
- Fast algorithms for approximate Fréchet matching queries in geometric trees
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Probabilistic embeddings of the Fréchet distance
- Approximate Map Matching with respect to the Fréchet Distance
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
Cited In (2)
This page was built for publication: Approximating the Packedness of Polygonal Curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6065398)
