论文信息 - Visualization of Generalized Voronoi Diagrams

Visualization of Generalized Voronoi Diagrams

Voronoi 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.

Alexandru Telea | Jarke J. van Wijk | J. V. Wijk | A. Telea

[1] Atsuyuki Okabe,et al. Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[2] Dinesh Manocha,et al. Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.

[3] M. Overmars,et al. Approximating generalized Voronoi diagrams in any dimension , 1995 .

[4] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[5] Chak-Kuen Wong,et al. Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..

[6] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .

[7] Jarke J. van Wijk,et al. Cushion Treemaps: Visualization of Hierarchical Information , 1999, INFOVIS.

[8] Jirí Matousek,et al. Constructing levels in arrangements and higher order Voronoi diagrams , 1994, SCG '94.

[9] Dinesh Manocha,et al. Fast computation of generalized Voronoi diagrams using graphics hardware , 1999, SIGGRAPH.