|
Grid (spatial Index)
In the context of a spatial index, a grid or mesh 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, and grids based on diamond-shaped cells. A " global grid" is a kind of grid that covers the entire surface of the globe. Types of grids Square or rectangular grids are frequently used for purposes such as translating spatial information expressed in Cartesian coordinates (latitude and longitude) into and out of the grid system. Such grids may or may not be aligned with the grid lines of latitude and longitude; for example, Marsden Squares, World Meteorological Organization squares, c-squares and others are aligned, while Universal Transverse Mercator coordinate s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spatial Index
A spatial database is a general-purpose database (usually a relational database) that has been enhanced to include spatial data that represents objects defined in a geometric space, along with tools for querying and analyzing such data. Most spatial databases allow the representation of simple geometric objects such as points, lines and polygons. Some spatial databases handle more complex structures such as 3D objects, topological coverages, linear networks, and triangulated irregular networks (TINs). While typical databases have developed to manage various numeric and character types of data, such databases require additional functionality to process spatial data types efficiently, and developers have often added ''geometry'' or ''feature'' data types. Geographic database (or geodatabase) is a georeferenced spatial database, used for storing and manipulating geographic data (or geodata, i.e., data associated with a location on Earth), especially in geographic infor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
British National Grid Reference System
The Ordnance Survey National Grid reference system (OSGB), also known as British National Grid (BNG), is a system of geographic grid references, distinct from latitude and longitude, whereby any location in Great Britain can be described in terms of its distance from the origin (0, 0), which lies to the west of the Isles of Scilly. The Ordnance Survey (OS) devised the national grid reference system, and it is heavily used in its survey data, and in maps based on those surveys, whether published by the Ordnance Survey or by commercial map producers. Grid references are also commonly quoted in other publications and data sources, such as guide books and government planning documents. A number of different systems exist that can provide grid references for locations within the British Isles: this article describes the system created solely for Great Britain and its outlying islands (including the Isle of Man). The Irish grid reference system is a similar system created by th ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geocode
A geocode is a code that represents a geographic entity (location or Geographical feature, object). It is a unique identifier of the entity, to distinguish it from others in a finite set of geographic entities. In general the ''geocode'' is a human-readable and short identifier. Typical geocodes (in bold) and entities represented by it: * ''Country code'' and subdivision code. Polygon of the administrative boundaries of a country or a subdivision. The main examples are ISO codes: ISO 3166-1 alpha-2 code (e.g. AF for Afghanistan or BR for Brazil), and its subdivision conventions, such as ISO 3166-2:AF, subdivision codes (e.g. AF-GHO for Ghor province) or ISO 3166-2:BR, subdivision codes (e.g. BR-AM for Amazonas (Brazilian state), Amazonas state). * ''DGG cell ID''. Identifier of a cell of a discrete global grid: a Geohash code (e.g. ~0.023km2 cell 6vd23gq at Brazil's Geographical centre, centroid) or a Open Location Code, Plus Code (e.g. ~0.0002km2 cell 58Q8XXXX+XX with ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grid Reference
A projected coordinate systemalso called a projected coordinate reference system, planar coordinate system, or grid reference systemis a type of spatial reference system that represents locations on Earth using Cartesian coordinate system, Cartesian coordinates (''x'', ''y'') on a planar surface created by a particular map projection. Each projected coordinate system, such as "Universal Transverse Mercator WGS 84 Zone 26N," is defined by a choice of map projection (with specific parameters), a choice of geodetic datum to bind the coordinate system to real locations on the earth, an origin point, and a choice of unit of measure. Hundreds of projected coordinate systems have been specified for various purposes in various regions. When the first standardized coordinate systems were created during the 20th century, such as the Universal Transverse Mercator, State Plane Coordinate System, and British National Grid, they were commonly called ''grid systems''; the term is still common ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Grid Plan
In urban planning, the grid plan, grid street plan, or gridiron plan is a type of city plan in which streets run at right angles to each other, forming a grid. Two inherent characteristics of the grid plan, frequent intersections and orthogonal geometry, facilitate movement. The geometry helps with orientation and wayfinding and its frequent intersections with the choice and directness of route to desired destinations. In ancient Rome, the grid plan method of land measurement was called centuriation. The grid plan dates from antiquity and originated in multiple cultures; some of the earliest planned cities were built using grid plans in the Indian subcontinent. History Ancient grid plans By 2600 BC, Mohenjo-daro and Harappa, major cities of the Indus Valley civilization, were built with blocks divided by a grid of straight streets, running north–south and east–west. Each block was subdivided by small lanes. The cities and monasteries of Sirkap, Taxila and Thimi (in ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Spatial Index
A spatial database is a general-purpose database (usually a relational database) that has been enhanced to include spatial data that represents objects defined in a geometric space, along with tools for querying and analyzing such data. Most spatial databases allow the representation of simple geometric objects such as points, lines and polygons. Some spatial databases handle more complex structures such as 3D objects, topological coverages, linear networks, and triangulated irregular networks (TINs). While typical databases have developed to manage various numeric and character types of data, such databases require additional functionality to process spatial data types efficiently, and developers have often added ''geometry'' or ''feature'' data types. Geographic database (or geodatabase) is a georeferenced spatial database, used for storing and manipulating geographic data (or geodata, i.e., data associated with a location on Earth), especially in geographic infor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geodesic Grid
A geodesic grid is a spatial grid based on a geodesic polyhedron or Goldberg polyhedron. History The earliest use of the (icosahedral) geodesic grid in geophysical modeling dates back to 1968 and the work by Sadourny, Arakawa, and Mintz and Williamson. Later work expanded on this base. Construction A geodesic grid is a global Earth spatial reference that uses polygon tiles based on the subdivision of a polyhedron (usually the icosahedron, and usually a Class I subdivision) to subdivide the surface of the Earth. Such a grid does not have a straightforward relationship to latitude and longitude, but conforms to many of the main criteria for a statistically valid discrete global grid. Primarily, the cells' area and shape are generally similar, especially near the poles where many other spatial grids have singularities or heavy distortion. The popular Quaternary Triangular Mesh (QTM) falls into this category. Geodesic grids may use the dual polyhedron of the geodesic polyhedron, w ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Tilings By Convex Regular Polygons
Euclidean Plane (mathematics), plane Tessellation, tilings by convex regular polygons have been widely used since antiquity. The first systematic mathematical treatment was that of Johannes Kepler, Kepler in his (Latin language, Latin: ''The Harmony of the World'', 1619). Notation of Euclidean tilings Euclidean tilings are usually named after Cundy & Rollett’s notation. This notation represents (i) the number of vertices, (ii) the number of polygons around each vertex (arranged clockwise) and (iii) the number of sides to each of those polygons. For example: 36; 36; 34.6, tells us there are 3 vertices with 2 different vertex types, so this tiling would be classed as a ‘3-uniform (2-vertex types)’ tiling. Broken down, 36; 36 (both of different transitivity class), or (36)2, tells us that there are 2 vertices (denoted by the superscript 2), each with 6 equilateral 3-sided polygons (triangles). With a final vertex 34.6, 4 more contiguous equilateral triangles and a single re ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Global Grid
A discrete global grid (DGG) is a mosaic that covers the entire Earth's surface. Mathematically it is a space partitioning: it consists of a set of non-empty regions that form a partition of the Earth's surface. In a usual grid-modeling strategy, to simplify position calculations, each region is represented by a point, abstracting the grid as a set of region-points. Each region or region-point in the grid is called a cell. When each cell of a grid is subject to a recursive partition, resulting in a "series of discrete global grids with progressively finer resolution", forming a hierarchical grid, it is called a hierarchical DGG (sometimes "global hierarchical tessellation" or "DGG system"). Discrete global grids are used as the geometric basis for the building of geospatial data structures. Each cell is related with data objects or values, or (in the hierarchical case) may be associated with other cells. DGGs have been proposed for use in a wide range of geospatial applicat ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
R-tree
R-trees are tree data structures used for spatial access methods, i.e., for indexing multi-dimensional information such as geographical coordinates, rectangles or polygons. The R-tree was proposed by Antonin Guttman in 1984 and has found significant use in both theoretical and applied contexts. A common real-world usage for an R-tree might be to store spatial objects such as restaurant locations or the polygons that typical maps are made of: streets, buildings, outlines of lakes, coastlines, etc. and then find answers quickly to queries such as "Find all museums within 2 km of my current location", "retrieve all road segments within 2 km of my location" (to display them in a navigation system) or "find the nearest gas station" (although not taking roads into account). The R-tree can also accelerate nearest neighbor search for various distance metrics, including great-circle distance. R-tree idea The key idea of the data structure is to group nearby objects and represen ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polar Coordinate System
In mathematics, the polar coordinate system specifies a given point in a plane by using a distance and an angle as its two coordinates. These are *the point's distance from a reference point called the ''pole'', and *the point's direction from the pole relative to the direction of the ''polar axis'', a ray drawn from the pole. The distance from the pole is called the ''radial coordinate'', ''radial distance'' or simply ''radius'', and the angle is called the ''angular coordinate'', ''polar angle'', or ''azimuth''. The pole is analogous to the origin in a Cartesian coordinate system. Polar coordinates are most appropriate in any context where the phenomenon being considered is inherently tied to direction and length from a center point in a plane, such as spirals. Planar physical systems with bodies moving around a central point, or phenomena originating from a central point, are often simpler and more intuitive to model using polar coordinates. The polar coordinate system i ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Quadtree
A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with a leaf cell varies by application, but the leaf cell represents a "unit of interesting spatial information". The subdivided regions may be square or rectangular, or may have arbitrary shapes. This data structure was named a quadtree by Raphael Finkel and J.L. Bentley in 1974. A similar partitioning is also known as a ''Q-tree''. All forms of quadtrees share some common features: * They decompose space into adaptable cells. * Each cell (or bucket) has a maximum capacity. When maximum capacity is reached, the bucket splits. * The tree directory follows the spatial decomposition of the quadtree. A tree-pyramid (T-pyramid) is a "complete" tree; every node of the T-pyramid has four child nodes e ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
