dc.contributor.author | Ahmed, Abdalla G. M. | en_US |
dc.contributor.editor | {Tam, Gary K. L. and Vidal, Franck | en_US |
dc.date.accessioned | 2018-09-19T15:15:18Z | |
dc.date.available | 2018-09-19T15:15:18Z | |
dc.date.issued | 2018 | |
dc.identifier.isbn | 978-3-03868-071-0 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.2312/cgvc20181214 | |
dc.identifier.uri | https://doi.org/10.2312/cgvc.20181214 | |
dc.description.abstract | Voronoi tree maps are an important milestone in information visualization, representing a substantial advancement of the original tree maps concept. We address a less-studied variant of Voronoi tree maps that uses multiplicative-weighted Voronoi diagrams. We highlight the merits of this variant, and discuss the difficulties that might have discouraged further exploration, proposing insights for overcoming these difficulties. | en_US |
dc.publisher | The Eurographics Association | en_US |
dc.title | Voronoi Tree Maps with Circular Boundaries | en_US |
dc.description.seriesinformation | Computer Graphics and Visual Computing (CGVC) | |
dc.description.sectionheaders | Short Papers | |
dc.identifier.doi | 10.2312/cgvc.20181214 | |
dc.identifier.pages | 115-116 | |