The last several decades have witnessed a rapid yet uneven urban expansion in developing countries. The existing studies rely heavily on official statistical yearbooks and remote sensing images. However, the former data sources have been criticized due to its non-objectivity and low quality, while the latter is labor and cost consuming in most cases. Recent efforts made by fractal analyses provide alternatives to scrutinize the corresponding "natural urban area". In our proposed framework, the dynamics of internal urban contexts is reflected in a quasi-real-time manner using emerging new data and the expansion is a fractal concept instead of an absolute one based on the conventional Euclidean method. We then evaluate the magnitude and pattern of natural cities and their expansion in size and space. It turns out that the spatial expansion rate of official cities (OCs) in our study area China has been largely underestimated when compared with the results of natural cities (NCs). The perspective of NCs also provides a novel way to understanding the quality of urban expansion. We detail our analysis for the 23 urban agglomerations in China, especially paying more attention to the three most dominating urban agglomerations of China: Beijing-Tianjin-Hebei (BTH), Yangtze River Delta (YRD) and Pearl River Delta (PRD). The findings from the OC method are not consistent with the NC method, either. The distinctions may arise from the definition of a city, and the bottom-up NC method contributes to our comprehensive understanding of uneven urban expansion in the study area.
Abstract:As research on large regions of earth progresses, many geographical subdivision grids have been established for various spatial applications by different industries and disciplines. However, there is no clear relationship between the different grids and no consistent spatial reference grid that allows for information exchange and comprehensive application. Sharing and exchange of data across departments and applications are still at a bottleneck. It would represent a significant step forward to build a new grid model that is inclusive of or compatible with most of the existing geodesic grids and that could support consolidation and exchange within existing data services. This study designs a new geographical coordinate global subdividing grid with one dimension integer coding on a 2 n tree (GeoSOT) that has 2 n coordinate subdivision characteristics (global longitude and latitude subdivision) and can form integer hierarchies at degree, minute, and second levels. This grid has the multi-dimensional quadtree hierarchical characteristics of a digital earth grid, but also provides good consistency with applied grids, such as those used in mapping, meteorology, oceanography and national geographical, and three-dimensional digital earth grids. No other existing grid codes possess these characteristics.
Flight conflict detection is fundamental to flight dispatch, trajectory planning, and flight safety control. An ever-increasing aircraft population and higher speeds, particularly the emergence of hypersonic/supersonic aircrafts, are challenging the timeliness and accuracy of flight conflict detection. Traditional trajectory conflict detection algorithms rely on traversing multivariate equations of every two trajectories, in order to yield the conflict result and involve extensive computation and high algorithmic complexity; these algorithms are often unable to provide the flight conflict solutions required quickly enough. In this paper, we present a novel, low-altitude flight conflict detection algorithm, based on the multi-level grid spatiotemporal index, that transforms the traditional trajectory-traversing multivariate conflict computation into a grid conflict state query of distributed grid databases. Essentially, this is a method of exchanging "storage space" for "computational time". First, we build the spatiotemporal subdivision and encoding model based on the airspace. The model describes the geometries of the trajectories, low-altitude obstacles, or dangerous fields and identifies the grid with grid codes. Next, we design a database table structure of the grid and create a grid database. Finally, we establish a multilevel grid spatiotemporal index, design a query optimization scheme, and examine the flight conflict detection results from the grid database. Experimental verification confirms that the computation efficiency of our algorithm is one order of magnitude higher than those of traditional methods. Our algorithm can perform real-time (dynamic/static) conflict detection on both individual aircraft and aircraft flying in formation with more efficient trajectory planning and airspace utilization.
The increasing number of unmanned aerial vehicles (UAVs) has led to challenges related to solving the collision problem to ensure air traffic safety. The traditional approaches employed for collision detection suffer from two main drawbacks: first, the computational burden of a pairwise calculation increases exponentially with an increasing number of spatial entities; second, existing grid-based approaches are unsuitable for complicated scenarios with a large number of objects moving at high speeds. In the proposed model, we first identified UAVs and other spatial objects with GeoSOT-3D grids. Second, the nonrelational spatial database was initialized with a multitable strategy, and spatiotemporal data were inserted with the GeoSOT-3D grid codes as the primary key. Third, the collision detection procedure was transformed from a pairwise calculation to a multilevel query. Four simulation experiments were conducted to verify the feasibility and efficiency of the proposed collision detection model for UAVs in different environments. The results also indicated that 64 m GeoSOT-3D grids are the most suitable basic grid size, and the reduction in the time consumption compared with traditional methods reached approximately 50–80% in different scenarios.
Spatial object matching is one of the fundamental technologies used for updating and merging spatial data. This study focused mainly on the matching optimization of multiscale spatial polygonal objects. We proposed a granularity factor evaluation index that was developed to promote the recognition ability of complex matches in multiscale spatial polygonal object matching. Moreover, we designed the granularity factor matching model based on a backpropagation neural network (BPNN) and designed a multistage matching workflow. Our approach was validated experimentally using two topographical datasets at two different scales: 1:2000 and 1:10,000. Our results indicate that the granularity factor is effective both in improving the matching score of complex matching and reducing the occurrence of missing matching, and our matching model is suitable for multiscale spatial polygonal object matching, with a high precision and recall reach of 97.2% and 90.6%.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.