|
Space Partitioning
In geometry, space partitioning is the process of dividing a space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning divides a space into non-overlapping regions. Any point in the space can then be identified to lie in exactly one of the regions. Overview Space-partitioning systems are often hierarchical, meaning that a space (or a region of space) is divided into several regions, and then the same space-partitioning system is recursively applied to each of the regions thus created. The regions can be organized into a tree, called a space-partitioning tree. Most space-partitioning systems use planes (or, in higher dimensions, hyperplanes) to divide space: points on one side of the plane form one region, and points on the other side form another. Points exactly on the plane are usually arbitrarily assigned to one or the other side. Recursively partitioning space using planes in this way produces a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is, with arithmetic, one of the oldest branches of mathematics. It is concerned with properties of space such as the distance, shape, size, and relative position of figures. A mathematician who works in the field of geometry is called a ''geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point, line, plane, distance, angle, surface, and curve, as fundamental concepts. During the 19th century several discoveries enlarged dramatically the scope of geometry. One of the oldest such discoveries is Carl Friedrich Gauss' ("remarkable theorem") that asserts roughly that the Gaussian curvature of a surface is independent from any specific embedding in a Euclidean space. This implies that surfaces can be studied ''intrinsically'', that is, as stand-alone spaces, and has been expanded into the theory of manifolds and Riemannian geometry. Later in the 19th century, it appeared that geometries ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Time Complexity
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by the algorithm, supposing that each elementary operation takes a fixed amount of time to perform. Thus, the amount of time taken and the number of elementary operations performed by the algorithm are taken to be related by a constant factor. Since an algorithm's running time may vary among different inputs of the same size, one commonly considers the worst-case time complexity, which is the maximum amount of time required for inputs of a given size. Less common, and usually specified explicitly, is the average-case complexity, which is the average of the time taken on inputs of a given size (this makes sense because there are only a finite number of possible inputs of a given size). In both cases, the time complexity is generally expresse ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
ISO 3166-2
ISO 3166-2 is part of the ISO 3166 standard published by the International Organization for Standardization (ISO), and defines codes for identifying the principal subdivisions (e.g., provinces or states) of all countries coded in ISO 3166-1. The official name of the standard is ''Codes for the representation of names of countries and their subdivisions – Part 2: Country subdivision code''. It was first published in 1998. The purpose of ISO 3166-2 is to establish an international standard of short and unique alphanumeric codes to represent the relevant administrative divisions and dependent territories of all countries in a more convenient and less ambiguous form than their full names. Each complete ISO 3166-2 code consists of two parts, separated by a hyphen: * The first part is the ISO 3166-1 alpha-2 code of the country; * The second part is a string of up to three alphanumeric characters, which is usually obtained from national sources and stems from coding systems alrea ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hydrological Code
A hydrological code or hydrologic unit code is a sequence of numbers or letters (a ''geocode'') that identify a hydrological unit or feature, such as a river, river reach, lake, or area like a drainage basin (also called watershed in North America) or catchment. One system, developed by Strahler, known as the Strahler stream order, ranks streams based on a hierarchy of tributaries. Each segment of a stream or river within a river network is treated as a node in a tree, with the next segment downstream as its parent. When two first-order streams come together, they form a second-order stream. When two second-order streams come together, they form a third-order stream, and so on. Another example is the system of assigning IDs to watersheds devised by Otto Pfafstetter, known as the Pfafstetter Coding System or the Pfafstetter System. Drainage areas are delineated in a hierarchical fashion, with "level 1" watersheds at continental scales, subdivided into smaller level 2 watersheds, ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geocode
A geocode is a code that represents a geographic entity (location or 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 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 subdivision codes (e.g. AF-GHO for Ghor province) or subdivision codes (e.g. BR-AM for Amazonas state). * ''DGG cell ID''. Identifier of a cell of a discrete global grid: a Geohash code (e.g. ~0.023 km2 cell 6vjyngd at the Brazilian's center) or an OLC code (e.g. ~0.004 km2 cell 58PJ642P+4 at the same point). * ''Postal code''. Polygon of a postal area: a CEP code (e.g. 70040 represents a Brazilian ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geographic Information System
A geographic information system (GIS) is a type of database containing Geographic data and information, geographic data (that is, descriptions of phenomena for which location is relevant), combined with Geographic information system software, software tools for managing, Spatial analysis, analyzing, and Cartographic design, visualizing those data. In a broader sense, one may consider such a system to also include human users and support staff, procedures and workflows, body of knowledge of relevant concepts and methods, and institutional organizations. The uncounted plural, ''geographic information systems'', also abbreviated GIS, is the most common term for the industry and profession concerned with these systems. It is roughly synonymous with geoinformatics and part of the broader geospatial field, which also includes GPS, remote sensing, etc. Geographic information science, the academic discipline that studies these systems and their underlying geographic principles, may also ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Cartography
Cartography (; from grc, χάρτης , "papyrus, sheet of paper, map"; and , "write") is the study and practice of making and using maps. Combining science, aesthetics and technique, cartography builds on the premise that reality (or an imagined reality) can be modeled in ways that communicate spatial information effectively. The fundamental objectives of traditional cartography are to: * Set the map's agenda and select traits of the object to be mapped. This is the concern of map editing. Traits may be physical, such as roads or land masses, or may be abstract, such as toponyms or political boundaries. * Represent the terrain of the mapped object on flat media. This is the concern of map projections. * Eliminate characteristics of the mapped object that are not relevant to the map's purpose. This is the concern of generalization. * Reduce the complexity of the characteristics that will be mapped. This is also the concern of generalization. * Orchestrate the elements of the ... [...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 applicati ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Administrative Division
Administrative division, administrative unit,Article 3(1). country subdivision, administrative region, subnational entity, constituent state, as well as many similar terms, are generic names for geographical areas into which a particular, independent sovereign state (country) is divided. Such a unit usually has an administrative authority with the power to take administrative or policy decisions for its area. Usually, the countries have several levels of administrative divisions. The common names for the principal (largest) administrative divisions are: states (i.e. "subnational states", rather than sovereign states), provinces, lands, oblasts, governorates, cantons, prefectures, counties, regions, departments, and emirates. These, in turn, are often subdivided into smaller administrative units known by names such as circuits, counties, ''comarcas'', raions, '' județe'', or districts, which are further subdivided into the municipalities, communes or communities consti ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Drainage Basin
A drainage basin is an area of land where all flowing surface water converges to a single point, such as a river mouth, or flows into another body of water, such as a lake or ocean. A basin is separated from adjacent basins by a perimeter, the '' drainage divide'', made up of a succession of elevated features, such as ridges and hills. A basin may consist of smaller basins that merge at river confluences, forming a hierarchical pattern. Other terms for a drainage basin are catchment area, catchment basin, drainage area, river basin, water basin, and impluvium. In North America, they are commonly called a watershed, though in other English-speaking places, "watershed" is used only in its original sense, that of a drainage divide. In a closed drainage basin, or endorheic basin, the water converges to a single point inside the basin, known as a sink, which may be a permanent lake, a dry lake, or a point where surface water is lost underground. Drainage basins are similar ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Growth Function
The growth function, also called the shatter coefficient or the shattering number, measures the richness of a set family. It is especially used in the context of statistical learning theory, where it measures the complexity of a hypothesis class. The term 'growth function' was coined by Vapnik and Chervonenkis in their 1968 paper, where they also proved many of its properties. It is a basic concept in machine learning., especially Section 3.2 Definitions Set-family definition Let H be a set family (a set of sets) and C a set. Their ''intersection'' is defined as the following set-family: : H\cap C := \ The ''intersection-size'' (also called the ''index'') of H with respect to C is , H\cap C, . If a set C_m has m elements then the index is at most 2^m. If the index is exactly 2''m'' then the set C is said to be shattered by H, because H\cap C contains all the subsets of C, i.e.: : , H\cap C, =2^, The growth function measures the size of H\cap C as a function of , C, . Forma ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Design Rule Check
In electronic design automation, a design rule is a geometric constraint imposed on circuit board, semiconductor device, and integrated circuit (IC) designers to ensure their designs function properly, reliably, and can be produced with acceptable yield. Design rules for production are developed by process engineers based on the capability of their processes to realize design intent. Electronic design automation is used extensively to ensure that designers do not violate design rules; a process called design rule checking (DRC). DRC is a major step during physical verification signoff on the design, which also involves LVS (layout versus schematic) checks, XOR checks, ERC ( electrical rule check), and antenna checks. The importance of design rules and DRC is greatest for ICs, which have micro- or nano-scale geometries; for advanced processes, some fabs also insist upon the use of more restricted rules to improve yield. Design rules Design rules are a series of parameters provi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
