Point retrieval for polygons

DOI10.1016/0196-6774(86)90033-7MaRDI QIDQ3777466zbMATH OpenOpenAlexFDO

Authors Michael S. Paterson, F. Frances Yao

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 structurepoint retrievalpolygon retrievalquery polygon

Mathematics Subject Classification ID

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

Recommendations

• Geometric retrieval problems
• Data Structures for Retrieval on Square Grids
• Polygon queries for convex hulls of points
• Optimal solutions for a class of point retrieval problems
• scientific article; zbMATH DE number 3911763

Cited in

(13)

• Optimal solutions for a class of point retrieval problems
• Quasi-optimal upper bounds for simplex range searching and new zone theorems
• Extremal polygon containment problems
• Polygon queries for convex hulls of points
• Simplex range reporting on a pointer machine
• Improved algorithms for the point-set embeddability problem for plane 3-trees
• scientific article; zbMATH DE number 3911763 (Why is no real title available?)
• Geometric retrieval problems
• Data Structures for Retrieval on Square Grids
• New upper bounds for generalized intersection searching problems
• Lower bounds on the complexity of simplex range reporting on a pointer machine (extended abstract)
• Point enclosure problem for homothetic polygons
• The intersection searching problem for c-oriented polygons

This page was built for publication: Point retrieval for polygons

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3777466)