Computational geometry: an introduction
Computational geometry: an introduction
Randomized incremental construction of Delaunay and Voronoi diagrams
Proceedings of the seventeenth international colloquium on Automata, languages and programming
Spatial tessellations: concepts and applications of Voronoi diagrams
Spatial tessellations: concepts and applications of Voronoi diagrams
Proceedings of the twelfth annual symposium on Computational geometry
Space-efficient approximate Voronoi diagrams
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Exploratory Analysis of Spatial and Temporal Data: A Systematic Approach
Exploratory Analysis of Spatial and Temporal Data: A Systematic Approach
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
Modelling three-dimensional geoscientific fields with the Voronoi diagram and its dual
International Journal of Geographical Information Science
| Hi-index | 0.00 |
Filtering and clustering of the data are very important aspects in data visualization. We will concentrate on these two topics and study how can we combine them to simulate a multiresolution scheme. We will focus on the properties of Voronoi Diagrams in order to avoid the need to compute any other time- or space-consuming data structure. Voronoi Diagrams capture deeply the notion of proximity between elements in an environment and allow queries to be efficiently performed. In this paper we present an application of Voronoi Diagrams and their use in visualization of georreferenced data. The input is a 2.5 data-set, and the output is a colored map where proximity to the given locations is used in order to compute the region contours. We have implemented the proposed techniques in C++. Examples of the results obtained with our application GeoVySare given in this paper.