Vizualizing Large Spatial Datasets in Interactive Maps

Abstract

This paper addresses the problem of reducing cluttering in interactive maps. It presents a new technique for visualizing large spatial datasets using hierarchical aggregation. The technique creates a hierarchical clustering tree, which is subsequently used to extract clusters that can be displayed at a given scale without cluttering the map. Voronoi polygons are used as aggregation symbols to represent the clusters. This technique retains hierarchical relationships between data items at different scales. In addition, aggregation symbols do not overlap, and their sizes and the number of points that they cover is controlled by the same parameter. The scalability analysis shows that the method can effectively be used with datasets of up to 1000 items.

Hierarchical cluster visualization in web mapping systems

“…Issues regarding the computational complexity of the technique are addressed in [9]. For this experiment, we generate random geographical coordinates using a uniform distribution.…”

Visualizing SpatioTemporal Keyword Trends in Online News Articles

“…A keyword and its location then serve as a data point that can be mapped. In our application, we plot these points on a heatmap, as heatmaps have been established as an effective mechanism for visualising large amounts of geographic information [5]. When temporal information is present in addition to geographic, we can restrict the data plotted on the map to only that which falls within a specific interval of time.…”

HeatPipe: High Throughput, Low Latency Big Data Heatmap with Spark Streaming

“…Then, the density information of each pixel is mapped to a color using a color scale. Such visualizations are popular for geographical data [3,4,5] and graphs [17,20]. However, the computational complexity of KDE makes it difficult to use on Big Data, even though it would solve overplot, which is a recurrent problem with large amounts of data.…”