Neighbours on a grid

DOI10.1007/3-540-61422-2_141MaRDI QIDQ5054822zbMATH OpenOpenAlexFDO

Authors Andrej Brodnik, J. Ian Munro

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

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

Recommendations

• Neighborly polytopes
• scientific article; zbMATH DE number 97635
• scientific article; zbMATH DE number 4016923
• scientific article; zbMATH DE number 492714
• scientific article; zbMATH DE number 2087923
• The grid revisited

Cites work

• Design and implementation of an efficient priority queue
• Efficient worst-case data structures for range searching
• scientific article; zbMATH DE number 3887061 (Why is no real title available?)
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3919834 (Why is no real title available?)
• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 78497 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 1263219 (Why is no real title available?)
• scientific article; zbMATH DE number 1142296 (Why is no real title available?)
• scientific article; zbMATH DE number 1142308 (Why is no real title available?)
• scientific article; zbMATH DE number 742994 (Why is no real title available?)
• 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
• Parallel Image Processing by Memory-Augmented Cellular Automata
• Refinements to nearest-neighbor searching in k-dimensional trees
• Surpassing the information theoretic bound with fusion trees
• The efficiency of using k-d trees for finding nearest neighbors in discrete space
• Voronoui Diagrams in L₁ (L_\infty ) Metrics with 2-Dimensional Storage Applications

Cited in

(3)

• Entropy-bounded representation of point grids
• scientific article; zbMATH DE number 3907781 (Why is no real title available?)
• Trans-dichotomous algorithms without multiplication — some upper and lower bounds

This page was built for publication: Neighbours on a grid

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