Show simple item record

dc.contributor.authorTelea, Alexandruen_US
dc.contributor.authorWijk, Jarke J. vanen_US
dc.contributor.editorDavid S. Ebert and Jean M. Favre and Ronald Peikerten_US
dc.date.accessioned2014-01-30T06:45:57Z
dc.date.available2014-01-30T06:45:57Z
dc.date.issued2001en_US
dc.identifier.isbn3-211-83674-8en_US
dc.identifier.issn1727-5296en_US
dc.identifier.urihttp://dx.doi.org/10.2312/VisSym/VisSym01/165-174en_US
dc.description.abstractVoronoi diagrams are an important data structure in computer science. However well studied mathematically, understanding such diagrams for different metrics, orders, and site shapes is a complex task. We propose a new method to visualize k-order diagrams and give an efficient adaptive implementation for this method. The algorithm is easy to customize for different metrics and site shapes. Its real-time performance makes it suitable for interactive planning and analysis of complex Voronoi configurations in 2D.We illustrate the method for different combinations of metrics and site shapes.en_US
dc.publisherThe Eurographics Associationen_US
dc.titleVisualization of Generalized Voronoi Diagramsen_US
dc.description.seriesinformationEurographics / IEEE VGTC Symposium on Visualizationen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record