Talk:Discrete global grid
![]() | This article is ratedStart-classon Wikipedia'scontent assessmentscale. It is of interest to the followingWikiProjects: | ||||||||||||||||||||
|
Check
[edit]- Other examples of DGG-variants for geocoding:http://geocode-encyclopedia.info
- Terminology, names forprojection types:List_of_map_projections
- comparisons:
- ....
Other DGGs:
- http://near-goos.jodc.go.jp/data_format/position-code.html
- Japan grid square code (JIS X 0410): [pyjpmesh](https://github /ymoch/pyjpmesh),...check other (link working?), [ref1](https://ieeexplore.ieee.org/document/8258450/), [ref2](http:// j-shis.bosai.go.jp/en/faq-250mmesh#more-42)
- A 250m-mesh is a square area of 7.5 arc-seconds latitude x 11.25 arc-seconds longitude (about 250m x 250m). This geographical coordinate system adopts the standard grid square (mesh code N) based on Tokyo Datum. 250m-mesh code is a part of the divided grid square code defined by JIS X 0410/AMENDMENT1:2002.
Review all article using OGC standard
[edit]The new OGC DGGS standard entitled “Topic 21: Discrete Global Grid Systems Abstract Specification” is online! It includes important information on definitions, conventions, functional algorithms, the core data model and more... see:
- HTMLhttps://docs.opengeospatial.org/as/15-104r5/15-104r5.html
- PDFhttps://portal.opengeospatial.org/files/15-104r5
- Problem Statement athttp:// opengeospatial.org/projects/groups/dggsdwg
Krauss(talk)23:51, 19 April 2019 (UTC)
You can use also didactic texts and discussions:
- PDF of "Discrete global grid systems", Perry R. Peterson
- explanations of John Merola in a pitneybowes discussion
grabularity
[edit]What does grabularity mean? Should this be granularity?— Precedingunsignedcomment added by67.188.178.167(talk)03:19, 15 December 2018 (UTC)
- corrected
Notes about key-words and references
[edit]- About S2 geometry, the cube as used before "S2 Geometry", by "SAND" in the end of 1990s, seehttp:// cs.umd.edu/~hjs/pubs/alborzidgg00.pdf
- "Fine grid" and "Coarse grid" (or grid cells). Example of use of the terms inthis CFD article(CFD =Computational Fluid Dynamics)
- ...
About flat and hierarchical grids
[edit]The term "flat" is perhaps preferable to the term "non-hierarchical". See "flat vs hierarchical" organizations, design architectures, clusters, structures, etc. About properties, see this didactic article comparing both forspatial-partition in games,as decisions:
- flat grid, advantages:
- Simpler: the flat data structure is simpler, and it is simpler to implement.
- Memory usage is constant. (spatial partition can often be fixed ahead of time).
- Faster: it can be faster to calculate or update, when objects change their positions.
- hierarchical grid, advantages:
- It handles empty space more efficiently.
- Neighboring objects can be moved quickly.
- The partitions can be imbalanced. When objects clump together, you get better performance, avoiding to waste memory in the empty areas.
Grid classification
[edit]It is possible to adaptGrid classificationarticle, and generalize relationships of the DGG areas...