Data Structures for Retrieval on Square Grids

DOI10.1137/0215064MaRDI QIDQ3756523zbMATH OpenOpenAlexFDO

Authors Martin David Katz, Dennis James Volper

Publication date 1986

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0215064

zbMATH Keywords

data structuresrange querygeometric retrievalpolygonal retrieval

Mathematics Subject Classification ID

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

Recommendations

• Efficient data structures for range searching on a grid
• Geometric retrieval problems
• Point retrieval for polygons
• scientific article; zbMATH DE number 4211552
• Priority Search Trees

Cited in

(6)

• Efficient data structures for range searching on a grid
• An output sensitive algorithm for discrete convex hulls
• Point retrieval for polygons
• EFFICIENT ALGORITHMS FOR OPTIMIZATION-BASED IMAGE SEGMENTATION
• Geometric retrieval problems
• Lower bounds for the addition-subtraction operations in orthogonal range queries and related problems

This page was built for publication: Data Structures for Retrieval on Square Grids

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