Publikation: Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent
Lade...
Dateien
Datum
2012
Autor:innen
Herausgeber:innen
ISSN der Zeitschrift
Electronic ISSN
ISBN
Bibliografische Daten
Verlag
Schriftenreihe
Auflagebezeichnung
URI (zitierfähiger Link)
DOI (zitierfähiger Link)
Internationale Patentnummer
Link zur Lizenz
Angaben zur Forschungsförderung
Projekt
Open Access-Veröffentlichung
Open Access Green
Core Facility der Universität Konstanz
Titel in einer weiteren Sprache
Publikationstyp
Zeitschriftenartikel
Publikationsstatus
Published
Erschienen in
Computer Graphics Forum. 2012, 31(3pt1), pp. 855-864. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/j.1467-8659.2012.03078.x
Zusammenfassung
Voronoi treemaps represent hierarchies as nested polygons. We here show that, contrary to the apparent popular belief, utilization of an algorithm for weighted Voronoi diagrams is not only feasible, but also more efficient than previous low-resolution approximations, even when the latter are implemented on graphics hardware. More precisely, we propose an instantiation of Lloyd's method for centroidal Voronoi diagrams with Aurenhammer's algorithm for power diagrams that yields an algorithm running in O(n log n) rather than Ω(n²) time per iteration, with n the number of sites. We describe its implementation and present evidence that it is faster also in practice.
Zusammenfassung in einer weiteren Sprache
Fachgebiet (DDC)
004 Informatik
Schlagwörter
Konferenz
Rezension
undefined / . - undefined, undefined
Zitieren
ISO 690
NOCAJ, Arlind, Ulrik BRANDES, 2012. Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent. In: Computer Graphics Forum. 2012, 31(3pt1), pp. 855-864. ISSN 0167-7055. eISSN 1467-8659. Available under: doi: 10.1111/j.1467-8659.2012.03078.xBibTex
@article{Nocaj2012Compu-19893,
year={2012},
doi={10.1111/j.1467-8659.2012.03078.x},
title={Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent},
number={3pt1},
volume={31},
issn={0167-7055},
journal={Computer Graphics Forum},
pages={855--864},
author={Nocaj, Arlind and Brandes, Ulrik}
}RDF
<rdf:RDF
xmlns:dcterms="http://purl.org/dc/terms/"
xmlns:dc="http://purl.org/dc/elements/1.1/"
xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
xmlns:bibo="http://purl.org/ontology/bibo/"
xmlns:dspace="http://digital-repositories.org/ontologies/dspace/0.1.0#"
xmlns:foaf="http://xmlns.com/foaf/0.1/"
xmlns:void="http://rdfs.org/ns/void#"
xmlns:xsd="http://www.w3.org/2001/XMLSchema#" >
<rdf:Description rdf:about="https://kops.uni-konstanz.de/server/rdf/resource/123456789/19893">
<bibo:uri rdf:resource="http://kops.uni-konstanz.de/handle/123456789/19893"/>
<dc:date rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2012-08-02T06:48:28Z</dc:date>
<dspace:hasBitstream rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/19893/2/nb-cvt-12.pdf"/>
<dcterms:abstract xml:lang="deu">Voronoi treemaps represent hierarchies as nested polygons. We here show that, contrary to the apparent popular belief, utilization of an algorithm for weighted Voronoi diagrams is not only feasible, but also more efficient than previous low-resolution approximations, even when the latter are implemented on graphics hardware. More precisely, we propose an instantiation of Lloyd's method for centroidal Voronoi diagrams with Aurenhammer's algorithm for power diagrams that yields an algorithm running in O(n log n) rather than Ω(n²) time per iteration, with n the number of sites. We describe its implementation and present evidence that it is faster also in practice.</dcterms:abstract>
<dcterms:rights rdf:resource="https://rightsstatements.org/page/InC/1.0/"/>
<dc:language>deu</dc:language>
<dcterms:available rdf:datatype="http://www.w3.org/2001/XMLSchema#dateTime">2013-07-31T22:25:04Z</dcterms:available>
<dc:rights>terms-of-use</dc:rights>
<dc:contributor>Brandes, Ulrik</dc:contributor>
<dc:creator>Brandes, Ulrik</dc:creator>
<dcterms:bibliographicCitation>Publ. in: Computer Graphics Forum ; 31 (2012), 3pt1. - pp. 855-864</dcterms:bibliographicCitation>
<dc:contributor>Nocaj, Arlind</dc:contributor>
<dspace:isPartOfCollection rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<dcterms:issued>2012</dcterms:issued>
<dc:creator>Nocaj, Arlind</dc:creator>
<dcterms:title>Computing Voronoi Treemaps : Faster, Simpler, and Resolution-independent</dcterms:title>
<dcterms:isPartOf rdf:resource="https://kops.uni-konstanz.de/server/rdf/resource/123456789/36"/>
<foaf:homepage rdf:resource="http://localhost:8080/"/>
<void:sparqlEndpoint rdf:resource="http://localhost/fuseki/dspace/sparql"/>
<dcterms:hasPart rdf:resource="https://kops.uni-konstanz.de/bitstream/123456789/19893/2/nb-cvt-12.pdf"/>
</rdf:Description>
</rdf:RDF>Interner Vermerk
xmlui.Submission.submit.DescribeStep.inputForms.label.kops_note_fromSubmitter
Prüfungsdatum der Dissertation
Finanzierungsart
Kommentar zur Publikation
Allianzlizenz
Corresponding Authors der Uni Konstanz vorhanden
Internationale Co-Autor:innen
Universitätsbibliographie
Ja
