Algorithms for projecting points to give the most uniform distribution with applications to hashing (Q2366237): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: WALKING IN AN ARRANGEMENT TOPOLOGICALLY / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithms for Reporting and Counting Geometric Intersections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Geometric Problems with Application to Hashing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3772828 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Halfplanar range search in linear space and \(O(n^{0.695})\) query time / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3219751 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3694703 / rank | |||
Normal rank |
Revision as of 18:10, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Algorithms for projecting points to give the most uniform distribution with applications to hashing |
scientific article |
Statements
Algorithms for projecting points to give the most uniform distribution with applications to hashing (English)
0 references
29 June 1993
0 references
computational geometry
0 references
duality transform
0 references
hashing
0 references
intersection- reporting algorithm
0 references
linear-space algorithm
0 references
plane sweep
0 references
projection
0 references
simplex range search
0 references
topological walk
0 references