Information Space Partitioning Using Adaptive Voronoi Diagrams

Abstract

In this paper, we present and evaluate a Voronoi method for partitioning continuous information spaces. We define the formal characteristics of the problem and discuss several well-known partitioning methods and approaches. We submit that although they all partially solve the problem, they all have shortcomings. As an alternative, we offer an approach based on an adaptive version of the multiplicatively weighted Voronoi diagram. The diagram is ‘adaptive’ because it is computed backwards; that is, the generators' weights are treated as dependent rather than independent variables. We successfully test this adaptive solution using both ideal-typical (artificial) and empirical data. Since the resultant visualizations are meant to be used by human subjects, we then discuss the results of a usability experiment, positioning the adaptive solution against a commonly used rectangular solution and the classic nonweighted Voronoi solution. The results indicate that in terms of usability, both the rectangular and the adaptive Voronoi solution outperform the standard Voronoi solution. In addition, although subjects are better able to gage rectangular area relationships, only the adaptive Voronoi solution satisfies all geometric constraints of weight-proportional partitioning.

Multi-Agent Simulation of Allocating and Routing Ambulances Under Condition of Street Blockage After Natural Disaster

“…Eq (3) shows the relation of the amount of the provided services and the weight of services centers (Reitsma et al, 2004(Reitsma et al, , 2007.…”

“…Objective function is defined as Eq (9). Eq (10) shows the error metric used in this paper (Reitsma et al, 2007).…”

“…In AMWNVD, the services' centers weigths is updated in each iteration by the SA until the notion of a difference ( , ) gets minimized. Eq (11) shows the weight of each emergency center for each iteration (Reitsma et al, 2004(Reitsma et al, , 2007.…”

Interactive Land-Use Optimization Using Laguerre Voronoi Diagram With Dynamic Generating Point Allocation

“…In the case of Laguerre Voronoi diagram, remark that cells of the corresponding generators may be lost, or generating points may not be contained in the Voronoi cell as mentioned in (Reitsma et al, 2007). However, (Cheng et al, 2000) gave the necessary condition for keeping the generator positions lay inside the cell by the following theorem.…”

“…For this propose, we can use techniques based on computational geometry techniques such as Voronoi diagram (Karimi et al, 2009), multiplicatively weighted Voronoi diagram (Karimi et al, 2009, Dong, 2008, adaptive multiplicatively weighted Voronoi diagram (Reitsma et al, 2007), and LaguerreVoronoi diagram (Song et al, 2015). In this paper, we choose to develop our methods based on the Laguerre-Voronoi diagram because of two reasons.…”