On the complexity of range searching among curves
From MaRDI portal
Publication:4607940
Recommendations
Cited in
(11)- The VC dimension of metric balls under Fréchet and Hausdorff distances
- A New Lower Bound for Semigroup Orthogonal Range Searching
- ANN for time series under the Fréchet distance
- An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3
- The effect of corners on the complexity of approximate range searching
- Rectangle stabbing and orthogonal range reporting lower bounds in moderate dimensions
- Straight-path queries in trajectory data
- Fast Fréchet queries
- Approximate nearest neighbor for curves: simple, efficient, and deterministic
- scientific article; zbMATH DE number 7559228 (Why is no real title available?)
- Fast Fréchet queries
This page was built for publication: On the complexity of range searching among curves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4607940)