Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
SIAM Journal on Computing
Fast computation of generalized Voronoi diagrams using graphics hardware
Proceedings of the 26th annual conference on Computer graphics and interactive techniques
Cushion Treemaps: Visualization of Hierarchical Information
INFOVIS '99 Proceedings of the 1999 IEEE Symposium on Information Visualization
An augmented Fast Marching Method for computing skeletons and centerlines
VISSYM '02 Proceedings of the symposium on Data Visualisation 2002
Proceedings of the conference on Visualization '01
Generalized distance transforms and skeletons in graphics hardware
VISSYM'04 Proceedings of the Sixth Joint Eurographics - IEEE TCVG conference on Visualization
| Hi-index | 0.00 |
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.