Next Article in Journal
Collecting Typhoon Disaster Information from Twitter Based on Query Expansion
Next Article in Special Issue
Estimating the Performance of Random Forest versus Multiple Regression for Predicting Prices of the Apartments
Previous Article in Journal
Long-Term Changes of the Wildland–Urban Interface in the Polish Carpathians
Article Menu
Issue 4 (April) cover image

Export Article

Open AccessArticle
ISPRS Int. J. Geo-Inf. 2018, 7(4), 138; https://doi.org/10.3390/ijgi7040138

An Efficient Visualization Method for Polygonal Data with Dynamic Simplification

1
Key Laboratory of Virtual Geographic Environment of Ministry of Education, Nanjing Normal University, Nanjing 210023, China
2
College of Geographic Sciences, Nanjing Normal University, Nanjing 210023, China
3
Jiangsu Center for Collaborative Innovation in Geographical Information Resource Development and Application, Nanjing 210023, China
4
Department of Geographic Information Science, Chuzhou University, Chuzhou 239000, China
5
Anhui Engineering Laboratory of Geo-Information Smart Sensing and Services, Chuzhou 239000, China
*
Author to whom correspondence should be addressed.
Received: 12 February 2018 / Revised: 14 March 2018 / Accepted: 21 March 2018 / Published: 2 April 2018
(This article belongs to the Special Issue Cognitive Aspects of Human-Computer Interaction for GIS)
View Full-Text   |   Download PDF [17028 KB, uploaded 3 May 2018]   |  

Abstract

Polygonal data often require rendering with symbolization and simplification in geovisualization. A common issue in existing methods is that simplification, symbolization and rendering are addressed separately, causing computational and data redundancies that reduce efficiency, especially when handling large complex polygonal data. Here, we present an efficient polygonal data visualization method by organizing the simplification, tessellation and rendering operations into a single mesh generalization process. First, based on the sweep line method, we propose a topology embedded trapezoidal mesh data structure to organize the tessellated polygons. Second, we introduce horizontal and vertical generalization operations to simplify the trapezoidal meshes. Finally, we define a heuristic testing algorithm to efficiently preserve the topological consistency. The method is tested using three OpenStreetMap datasets and compared with the Douglas Peucker algorithm and the Binary Line Generalization tree-based method. The results show that the proposed method improves the rendering efficiency by a factor of six. Efficiency-sensitive mapping applications such as emergency mapping could benefit from this method, which would significantly improve their visualization performances. View Full-Text
Keywords: vector polygon; level-of-detail rendering; cartographic simplification; tessellation; trapezoid vector polygon; level-of-detail rendering; cartographic simplification; tessellation; trapezoid
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Wu, M.; Chen, T.; Zhang, K.; Jing, Z.; Han, Y.; Chen, M.; Wang, H.; Lv, G. An Efficient Visualization Method for Polygonal Data with Dynamic Simplification. ISPRS Int. J. Geo-Inf. 2018, 7, 138.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
ISPRS Int. J. Geo-Inf. EISSN 2220-9964 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top