Algorithms for projecting points to give the most uniform distribution with applications to hashing

DOI10.1007/BF01190156zbMath0797.68156OpenAlexW2020587459MaRDI QIDQ2366237

Takeshi Tokuyama, Tetsuo Asano

Publication date: 29 June 1993

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01190156

zbMATH Keywords

projectioncomputational geometryhashingplane sweepduality transformlinear-space algorithmintersection- reporting algorithmsimplex range searchtopological walk

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Translating a regular grid over a point set, PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Halfplanar range search in linear space and \(O(n^{0.695})\) query time
• Algorithms for Reporting and Counting Geometric Intersections
• Geometric Problems with Application to Hashing
• WALKING IN AN ARRANGEMENT TOPOLOGICALLY