Content deleted Content added
m decapitalized |
m Dating maintenance tags: {{Fact}} |
||
(28 intermediate revisions by 22 users not shown) | |||
Line 1:
{{Short description|Partition of a surface into contiguous cells}}
In the context of a [[spatial index]], a '''grid''' (a.k.a. "mesh", also "global grid" if it covers the entire surface of the [[globe]]) is a regular [[tessellation]] of a [[manifold]] or 2-D surface that divides it into a series of contiguous cells, which can then be assigned unique identifiers and used for spatial indexing purposes. A wide variety of such grids have been proposed or are currently in use, including grids based on "square" or "rectangular" cells, triangular grids or meshes, hexagonal grids, grids based on diamond-shaped cells, and possibly more. The range is broad and the possibilities are expanding.▼
{{Refimprove|date=September 2018}}
▲In the context of a [[spatial index]], a '''grid'''
==Types of grids==
[[File:Geodesic Grid (ISEA3H) illustrated.png|right | 500px]]
The most influential '''triangular''' grid is that entitled "Quaternary Triangular Mesh" or QTM that was developed by Geoffrey Dutton in the early 1980s. It eventually resulted in a thesis entitled "A Hierarchical Coordinate System for Geoprocessing and Cartography" that was published in 1999 (see publications list on Dutton's [http://www.spatial-effects.com/SE-papers1.html Spatial Effects] website). This grid was also employed as the basis of the rotatable globe that forms part of the Microsoft [[Encarta]] product.▼
▲
[http://www.spatial-effects.com/SE-papers1.html "Spatial Effects: Research Papers and Data"] {{Webarchive|url=https://web.archive.org/web/20070219054353/http://www.spatial-effects.com/SE-papers1.html |date=2007-02-19 }}.</ref>
This grid was also employed as the basis of the rotatable globe that forms part of the Microsoft [[Encarta]] product.
Hexagonal grids may also be used. In general, triangular and hexagonal grids are constructed so as to better approach the goals of equal-area (or nearly so) plus more seamless coverage across the poles, which tends to be a problem area for square or rectangular grids since in these cases, the cell width diminishes to nothing at the pole and those cells adjacent to the pole then become 3- rather than 4-sided. Criteria for optimal discrete global gridding have been proposed by both Goodchild and Kimerling
==Grid-based spatial indexing==
In practice, construction of grid-based spatial
The use of such spatial
==Other uses==
The individual cells of a grid system can also be useful as units of aggregation, for example as a precursor to data analysis, presentation, mapping, etc. For some applications (e.g., statistical analysis), equal-area cells may be preferred, although for others this may not be a prime consideration.
In computer science, one often needs to find out all cells a ray is passing through in a grid (for raytracing or collision detection);
==See also==
*[[Discrete global grid]]
*[[Euclidean tilings by convex regular polygons]]
*[[Geodesic grid]]
*[[Spatial index]]
* [[Grid plan]]
*[[Grid reference]]
*[[Geocode]]
* [[hex map]]
*[[quadrilateralized spherical cube]]
*[[Quadtree]]
*[[R-tree]]
*[[Alpha-numeric grid]]
*[[Utility pole#Coordinates on pole tags]] (some based on rectangular grids)
*[[HEALPix]]
==References==
<references/>
*[http://www.star.le.ac.uk/~cgp/ag/skyindex.html Indexing the Sky - Clive Page] - Grid
== External links ==
*[https://web.archive.org/web/20090724075851/http://www.gamerendering.com/2009/07/20/grid-traversal/ Grid Traversal implementation details and applet demonstration]
*[http://www.pyxisinnovation.com/pyxwiki/index.php?title=How_PYXIS_Works PYXIS Discrete Global Grid System using the ISEA3H Grid]
|