scientific article; zbMATH DE number 7826449
From MaRDI portal
Publication:6124766
DOI10.57717/cgt.v3i2.45arXiv2307.08521MaRDI QIDQ6124766
Benedikt Kolbe, Unnamed Author, Anne Driemel
Publication date: 2 April 2024
Full work available at URL: https://arxiv.org/abs/2307.08521
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Unnamed Item
- Unnamed Item
- An improved approximation algorithm for the discrete Fréchet distance
- Local polyhedra and geometric graphs
- Approximate matching of polygonal shapes
- Sigma-local graphs
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Approximate nearest neighbor for curves: simple, efficient, and deterministic
- The Volume of the Unit n-Ball
- An optimal algorithm for approximate nearest neighbor searching fixed dimensions
- Finding nearest neighbors in growth-restricted metrics
- Bypassing the embedding
- Optimal Search in Planar Subdivisions
- Efficient Search for Approximate Nearest Neighbor in High Dimensional Spaces
- Clustering time series under the Fréchet distance
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Approximating the Fréchet distance for realistic curves in near linear time
- Fréchet Distance for Curves, Revisited
- Fast Construction of Nets in Low-Dimensional Metrics and Their Applications
- Computing the Discrete Fréchet Distance in Subquadratic Time
- On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
This page was built for publication:
