Voronoi Diagrams & Geometry
Discussions focus on Voronoi diagrams, KD-trees, quadtrees, Delaunay triangulation, and other computational geometry techniques for spatial partitioning, point distribution, nearest neighbors, and efficient distance calculations on maps or spheres.
Activity Over Time
Top Contributors
Keywords
Sample Comments
Why not just use a kd tree or voroni?
Stupid question... Did you try a voronoi diagram?
Feels like a spin on Delaunay triangulation, but it's not--- cool!
This is giving me some strong Voronoi vibes
nvm - this doesnt look like it cares about distance from center points at all (what I cared about) and instead care's whether the surface area spills from the contained square 4a square at any dimension, opps.
Does this use Computational Geometry?
Is the Voronoi partition the best/most commonly used solution in practice? Or are there better tricks for this problem?
Neighbor points give fantastic results.
Wait, there are a lot of ways in computer science to choose points randomly, and points randomly with constraints (here belong to unit sphere) and that could change the result, no ?
As a workaround, can you maintain double the set of points, the real point and a shadow point, using the shadow points for distance?