Research Article
An Approach to Generate Spatial Voronoi Treemaps for Points, Lines, and Polygons
Figure 3
The core process of the subdivision for a raster layer of a weighted SVT: (a) three generators , , and within a 10 × 10 binary image, where is a square with , is a line with , and is a point with ; (b) pixels assignment for , , and . A pixel () will be marked with a sign “” if it intersects with a generator, in which is the current transformation speed of the pixel and is the status. Blank pixels are marked with “” in default. (c) The Manhattan distance transformation for , , and for the first time. If , it continues to execute accumulation, else will propagate and will change to 1. (d) Pixels update for , , and for the first time. The state of the pixel will change to 0 if has been assigned values yet has not executed distance transformation (). (e) The Manhattan distance transformation and pixels update for , , and for the second time. (f) The Manhattan distance transformation and pixels update for , , and for the third time.
(a) |
(b) |
(c) |
(d) |
(e) |
(f) |