Abstract

The visualization of spatial data becomes increasingly important in science, business and many other domains. In geography, data often corresponds to a large number of point observations that should be displayed on a constrained screen with limited resolution. This causes, however, a loss of information due to an overloaded and occluded visualization. In this paper we present a new visualization algorithm that avoids this problem by aggregating point data into a set of non-overlapping circles that capture all important information. Our algorithm based on a quadtree computes the circles in linear time with respect to the number of points.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.