Urban data visualization with Voronoi diagrams

7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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 GeoVyS are given in this paper. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Abellanas, M., & Palop, B. (2008). Urban data visualization with Voronoi diagrams. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5072 LNCS, pp. 126–136). Springer Verlag. https://doi.org/10.1007/978-3-540-69839-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free