Geometric retrieval problems

DOI10.1016/S0019-9958(84)80040-6zbMath0591.68091OpenAlexW2101894996MaRDI QIDQ3719869

Chee-Keng Yap, Richard John Cole

Publication date: 1984

Published in: Information and Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0019-9958(84)80040-6

zbMATH Keywords

data structurespace-time complexitypolygon retrieval problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Information storage and retrieval of data (68P20)

Related Items (12)

Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment ⋮ Half-plane point retrieval queries with independent and dependent geometric uncertainties ⋮ Simplex Range Searching and Its Variants: A Review ⋮ On counting pairs of intersecting segments and off-line triangle range searching ⋮ New upper bounds for generalized intersection searching problems ⋮ How hard is half-space range searching? ⋮ Quasi-optimal upper bounds for simplex range searching and new zone theorems ⋮ Computing closest and farthest points for a query segment ⋮ Farthest-point queries with geometric and combinatorial constraints ⋮ Lower Bounds on the Complexity of Polytope Range Searching ⋮ New applications of random sampling in computational geometry ⋮ Nearly Optimal Planar $k$ Nearest Neighbors Queries under General Distance Functions

This page was built for publication: Geometric retrieval problems