KnowledgeHub
Questions
Tags
Users
Search
Alex Rivera
|
Logout
Edit Question
Title
Body
The problem in general: I have a big 2d point space, sparsely populated with dots. Think of it as a big white canvas sprinkled with black dots. I have to iterate over and search through these dots a lot. The Canvas (point space) can be huge, bordering on the limits of int and its size is unknown before setting points in there. That brought me to the idea of hashing: Ideal: I need a hash function taking a 2D point, returning a unique uint32. So that no collisions can occur. You can assume that the number of dots on the Canvas is easily countable by uint32. IMPORTANT: It is impossible to know the size of the canvas beforehand (it may even change), so things like canvaswidth * y + x are sadly out of the question. I also tried a very naive abs(x) + abs(y) but that produces too many collisions. Compromise: A hash function that provides keys with a very low probability of collision.
Tags (comma-separated)
Save Edits
Cancel