Delimitating the Natural City with Points of Interests Based on Service Area and Maximum Entropy Method
Autor: | Binxin Xia, Yang Yu, Jie Zhao, Hao Wu, Lingbo Liu, Zhenghong Peng |
---|---|
Rok vydání: | 2019 |
Předmět: |
head/tail breaks
Point of interest media_common.quotation_subject points of interest 0211 other engineering and technologies Urban studies General Physics and Astronomy Distribution (economics) uncertainty problems lcsh:Astrophysics 02 engineering and technology Reilly’s Law Article Boundary (real estate) Natural (archaeology) maximum entropy method lcsh:QB460-466 Regional science natural city lcsh:Science Head/tail Breaks 021101 geological & geomatics engineering media_common business.industry 021107 urban & regional planning lcsh:QC1-999 Geography Service (economics) lcsh:Q Scale (map) business lcsh:Physics |
Zdroj: | Entropy, Vol 21, Iss 5, p 458 (2019) Entropy Volume 21 Issue 5 |
ISSN: | 1099-4300 |
Popis: | The natural city, which is essential to understand urban physical scale and identify urban sprawling in urban studies, represents the urban functional boundaries of the city defined by human activities rather than the administrative boundaries. Most studies tend to utilize physical environment data such as street networks and remote sensing data to delimitate the natural city, however, such data may not match the real distribution of human activity density in the new cities or even ghost cities in China. This paper suggests aggregating the natural city boundary from the service area polygons of points of interest based on Reilly&rsquo s Law of Retail Gravitation and the maximum entropy method, since most points of interests provide services for surrounding communities, reflecting the vitality in a bottom-up way. The results indicate that the natural city defined by points of interests shows a high resolution and accuracy, providing a method to define the natural city with POIs. |
Databáze: | OpenAIRE |
Externí odkaz: | |
Nepřihlášeným uživatelům se plný text nezobrazuje | K zobrazení výsledku je třeba se přihlásit. |