VoR-tree is Voronoi diagram with R-tree. In this project we present a new algorithm of Voronoi diagram (Delaunay triangulation) construction. This algorithm uses R-tree as assistant in construction, so, result is VoR-tree. Algorithm is asymptotically effective, simple and can be parallelized. Also, it is realized using MapReduce.
-
Notifications
You must be signed in to change notification settings - Fork 1
amosov-f/VorTree
About
VorTree construction with MapReduce
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published