Data Visualization Using Weighted Voronoi Diagrams
Keyword(s):
A Voronoi diagram is a standard spatial tessellation that partitions a domain into sub-regions based on proximity to a fixed set of landmark points. In order to maintain control over the size and shape of these sub-regions, a weighting scheme is often used, in which each landmark has a scalar value associated with it. This suggests a natural “inverse” problem: given a fixed set of landmark points in a given planar region and a set of “desired” areas, is it possible to calculate a set of weights so that each sub-region has a particular area? In this chapter, the authors give a fast scheme for determining these weights based on theory from convex optimization, which is then applied to a variety of problems in data visualization.
2010 ◽
Vol 20
(07)
◽
pp. 2241-2252
◽
Keyword(s):
2013 ◽
Vol 467
◽
pp. 545-548
2006 ◽
Vol 16
(02n03)
◽
pp. 117-144
◽
Keyword(s):
Keyword(s):
2021 ◽
Vol 9
(2)
◽
pp. 922-952
2016 ◽
Vol 23
(1)
◽
pp. 71-94
1994 ◽
Vol 04
(02)
◽
pp. 179-228
◽
2014 ◽
Vol 533
◽
pp. 264-267
Keyword(s):
Keyword(s):