Algorithms for projecting points to give the most uniform distribution with applications to hashing
From MaRDI portal
Publication:2366237
DOI10.1007/BF01190156zbMath0797.68156MaRDI 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
projection; computational geometry; hashing; plane sweep; duality transform; linear-space algorithm; intersection- reporting algorithm; simplex range search; topological walk
68Q25: Analysis of algorithms and problem complexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
PARAMETRIC POLYMATROID OPTIMIZATION AND ITS GEOMETRIC APPLICATIONS, Translating a regular grid over a point set
Cites Work