Geometric retrieval problems
From MaRDI portal
Recommendations
Cited in
(17)- Optimal solutions for a class of point retrieval problems
- Quasi-optimal upper bounds for simplex range searching and new zone theorems
- New applications of random sampling in computational geometry
- Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
- Computing closest and farthest points for a query segment
- Farthest-point queries with geometric and combinatorial constraints
- scientific article; zbMATH DE number 6611031 (Why is no real title available?)
- Lower Bounds on the Complexity of Polytope Range Searching
- scientific article; zbMATH DE number 3911763 (Why is no real title available?)
- Data Structures for Retrieval on Square Grids
- Point retrieval for polygons
- Simplex Range Searching and Its Variants: A Review
- New upper bounds for generalized intersection searching problems
- Nearly Optimal Planar k Nearest Neighbors Queries under General Distance Functions
- Half-plane point retrieval queries with independent and dependent geometric uncertainties
- On counting pairs of intersecting segments and off-line triangle range searching
- How hard is half-space range searching?
This page was built for publication: Geometric retrieval problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3719869)
