Comparing Geometrical Properties of Global Grids

Kimerling, Jon A.; Sahr, Kevin; White, Denis; Song, Lei

doi:10.1559/152304099782294186

Cited by 94 publications

(42 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…where ∈ [4,8,12,16,20,24,28,32], and and are the meridional length and zonal length of the component's minimum bounding rectangle (MBR) (see Figure 2). Taking into account what is required to apply the identification code of the city component, we adopted only the 4th, 8th, 12nd, 16th, 20th, 24th, 28th, and 32nd level grids of GeoSOT for location reference.…”

Section: Identification Code Of the City Componentmentioning

confidence: 99%

See 1 more Smart Citation

An Improved Identification Code for City Components Based on Discrete Global Grid System

Cheng

et al. 2017

IJGI

View full text Add to dashboard Cite

City components are important elements of a city, and their identification plays a key role in digital city management. Various identification codes have been proposed by different departments and systems over the years, however, their application has been partly hindered by the lack of a unified coding framework. The use of a code identifying a city component for unified management and geospatial computation across systems is still problematic. In this paper, we put forward an improved identification code for city components based on the discrete global grid system (DGGS). According to their spatial location, city components were identified with one-dimensional integer codes. The results illustrated that this identification code could express the location information of city components explicitly, as well as indicate the spatial distance relationship and the spatial direction relationship between different components. The experiment showed that this code performed better than traditional codes in data query and geospatial computation. Therefore, we concluded that this improved identification code was conducive to the more efficient management of city components, and hence might be used to improve digital city management.

show abstract

Section: Identification Code Of the City Componentmentioning

confidence: 99%

“…where n ∈ [4,8,12,16,20,24,28,32], and L MBR and W MBR are the meridional length and zonal length of the component's minimum bounding rectangle (MBR) (see Figure 2). at the optimum grid level is .…”

Section: Identification Code Of the City Componentmentioning

confidence: 99%

An Improved Identification Code for City Components Based on Discrete Global Grid System

Cheng

et al. 2017

IJGI

View full text Add to dashboard Cite

show abstract

“…The provably optimal solution to all of these formulations is to arrange the fixed points as the center points of a hexagonal lattice (Rogers, 1964;Conway & Sloane, 2010). While it is difficult to extend this reasoning analytically to the sphere, studies by mathematicians (Saff & Kuijlaars, 1997) and GIS researchers (Kimerling, et al, 1999) both conclude that a hexagonal distribution has the highest International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, Volume XL-4/W2, 2013ISPRS WebMGS 2013& DMGIS 2013 November 2013, Xuzhou, Jiangsu, China Topics: Global Spatial Grid & Cloud-based Services degree of geometric regularity. On the plane a hexagonal distribution is the best known for estimating continuous spatial functions using kriging (Olea, 1984), and such a distribution is 13.4% more efficient than a square distribution of equivalent precision at sampling circularly bandlimited signals (Petersen & Middleton, 1962).…”

Section: The Limitations Of Fixed-width Floating Point Vector Locatiomentioning

confidence: 99%

On the Optimal Representation of Vector Location using Fixed-Width Multi-Precision Quantizers

Sahr

2013

Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

ABSTRACT:Current generation geospatial applications primarily rely on location representations that were developed for the manipulation and display of planar maps of portions of the earth's surface. The next generation of digital earth applications will require fundamentally new technological approaches to location representation. Improvements in the efficiency of the representation of vector location can result in substantial performance increases. We examine the advantages and limitations of the most common current approach: as tuples of fixed-width floating point representations of real numbers, and identify a list of desirable design features for an optimal replacement system. These include the use of explicitly discrete integer indexes, the use of an optimal quantification scheme, and the ability to represent point locations at multiple precisions, including the capability to exactly represent key point locations, and the ability to encode multi-precision quantizations. We describe a class of planar systems that meet these criteria, which we call Central Place Indexing (CPI) systems. We then extend these systems to the sphere to provide a class of optimal known fixed-width geospatial vector location representation systems we call CPI43 systems.

show abstract

“…Snyder gives an equal-area projection method and relative transferring formulas (3)(4)(5)(6)(7)(8)(9)(10)(11)(12)(13)(14)(15)(16)(17), which can be used for transferring polyhedron cells onto sphere surface [Snyder 1992]. In this method, three conditions should be fulfilled.…”

Section: B Snyder Projectionmentioning

confidence: 99%

A global hierarchical and Equal-Area Sphere Grid and Its Geometry Distortion Analysis

Sun

Zhou

2013

Int. Arch. Photogramm. Remote Sens. Spatial Inf. Sci.

View full text Add to dashboard Cite

ABSTRACT:A spatial data management and analysis frame is required for global problem application. Global Discrete Grid (GDG) has seamless, excellent hierarchy characteristics. GDG has been used for spatial data management, indexing and cartographic generalization. However, most GDGs are unequal-area. To extend GDG application ranges in spatial modelling and statistical analysis, the method for constructing hierarchical and equal-area GDG is discussed in this paper. The detail steps to build GDG based on inscribe polyhedron is presented. The method of transferring polyhedron surface grids onto sphere surface is described. The ratio of max, min length of grid edges and grid angle is acquired. Length ratio converges to1.7 and angle ratio converges to 3.0. The result indicates that there exists difference in length and grid angle and the ratios of them are convergent.

show abstract

Comparing Geometrical Properties of Global Grids

Cited by 94 publications

References 0 publications

An Improved Identification Code for City Components Based on Discrete Global Grid System

An Improved Identification Code for City Components Based on Discrete Global Grid System

On the Optimal Representation of Vector Location using Fixed-Width Multi-Precision Quantizers

A global hierarchical and Equal-Area Sphere Grid and Its Geometry Distortion Analysis

Contact Info

Product

Resources

About