Description
This is a preliminary study of adapting a Voronoi Diagram algorithm using a nonuniform Euclidian distance calculation in the form of weights that overlap. The aim of this study is to resolve issues that arise when sites, taking into account their given weights, are close enough together to overlap. Thus having a double-weighted area. This would imply a waste of resources due to oversaturation. This paper's objective is to research and develop a model for a Voronoi calculation to incorporate a method of reduction of these areas with double, triple, or more intersecting weighted areas. A modified Power Diagram algorithm will propagate through the map and determine these weighted distances. Then, during tessellation, it will call a method to relocate sites of overlapping weights, and re-calculate the Voronoi diagram. This system will iterate continuously until there are no overlapping weighted areas.
