Neighbours on a grid

DOI10.1007/3-540-61422-2_141zbMath1502.68089OpenAlexW1521877704MaRDI QIDQ5054822

J. Ian Munro, Andrej Brodnik

Publication date: 9 December 2022

Published in: Algorithm Theory — SWAT'96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-61422-2_141

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05)

Related Items (1)

Trans-dichotomous algorithms without multiplication — some upper and lower bounds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Refinements to nearest-neighbor searching in k-dimensional trees
• The efficiency of using k-d trees for finding nearest neighbors in discrete space
• Efficient worst-case data structures for range searching
• Surpassing the information theoretic bound with fusion trees
• Lower bounds for union-split-find related problems on random access machines
• New upper bounds for neighbor searching
• Optimal Expected-Time Algorithms for Closest Point Problems
• Voronoui Diagrams in $L_1 (L_\infty )$ Metrics with 2-Dimensional Storage Applications
• Parallel Image Processing by Memory-Augmented Cellular Automata
• Design and implementation of an efficient priority queue

This page was built for publication: Neighbours on a grid