Point retrieval for polygons

DOI10.1016/0196-6774(86)90033-7zbMath0637.68068OpenAlexW1965079671MaRDI QIDQ3777466

F. Frances Yao, Michael S. Paterson

Publication date: 1986

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(86)90033-7

zbMATH Keywords

data structurequery polygonpoint retrievalpolygon retrieval

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Data structures (68P05) Information storage and retrieval of data (68P20)

Related Items (7)

Extremal polygon containment problems ⋮ IMPROVED ALGORITHMS FOR THE POINT-SET EMBEDDABILITY PROBLEM FOR PLANE 3-TREES ⋮ Simplex range reporting on a pointer machine ⋮ New upper bounds for generalized intersection searching problems ⋮ Quasi-optimal upper bounds for simplex range searching and new zone theorems ⋮ Lower bounds on the complexity of simplex range reporting on a pointer machine ⋮ The intersection searching problem for c-oriented polygons

This page was built for publication: Point retrieval for polygons