A sphere is a geometrical object that is a three-dimensional analogue to a two-dimensional circle. Formally, a sphere is the set of points that are all at the same distance r from a given point in three-dimensional space. That given point is the center of the sphere, and r is the sphere's radius. The earliest known mentions of spheres appear in the work of the ancient Greek mathematicians.
A geographic coordinate system (GCS) is a spherical or geodetic coordinate system for measuring and communicating positions directly on the Earth as latitude and longitude. It is the simplest, oldest and most widely used of the various spatial reference systems that are in use, and forms the basis for most others. Although latitude and longitude form a coordinate tuple like a cartesian coordinate system, the geographic coordinate system is not cartesian because the measurements are angles and are not on a planar surface.
In cartography, a map projection is any of a broad set of transformations employed to represent the curved two-dimensional surface of a globe on a plane. In a map projection, coordinates, often expressed as latitude and longitude, of locations from the surface of the globe are transformed to coordinates on a plane. Projection is a necessary step in creating a two-dimensional map and is one of the essential elements of cartography.
In mathematics, a stereographic projection is a perspective projection of the sphere, through a specific point on the sphere, onto a plane perpendicular to the diameter through the point. It is a smooth, bijective function from the entire sphere except the center of projection to the entire plane. It maps circles on the sphere to circles or lines on the plane, and is conformal, meaning that it preserves angles at which curves meet and thus locally approximately preserves shapes. It is neither isometric nor equiareal.
A projected coordinate system – also called a projected coordinate reference system, planar coordinate system, or grid reference system – is a type of spatial reference system that represents locations on Earth using 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.
The transverse Mercator map projection is an adaptation of the standard Mercator projection. The transverse version is widely used in national and international mapping systems around the world, including the Universal Transverse Mercator. When paired with a suitable geodetic datum, the transverse Mercator delivers high accuracy in zones less than a few degrees in east-west extent.
A gnomonic projection, also known as a central projection or rectilinear projection, is a perspective projection of a sphere, with center of projection at the sphere's center, onto any plane not passing through the center, most commonly a tangent plane. Under gnomonic projection every great circle on the sphere is projected to a straight line in the plane. More generally, a gnomonic projection can be taken of any n-dimensional hypersphere onto a hyperplane.
In computer graphics, reflection mapping or environment mapping is an efficient image-based lighting technique for approximating the appearance of a reflective surface by means of a precomputed texture. The texture is used to store the image of the distant environment surrounding the rendered object.
The equirectangular projection, and which includes the special case of the plate carrée projection, is a simple map projection attributed to Marinus of Tyre, who Ptolemy claims invented the projection about AD 100.
In computer graphics, cube mapping is a method of environment mapping that uses the six faces of a cube as the map shape. The environment is projected onto the sides of a cube and stored as six square textures, or unfolded into six regions of a single texture.
Mesh generation is the practice of creating a mesh, a subdivision of a continuous geometric space into discrete geometric and topological cells. Often these cells form a simplicial complex. Usually the cells partition the geometric input domain. Mesh cells are used as discrete local approximations of the larger domain. Meshes are created by computer algorithms, often with human guidance through a GUI, depending on the complexity of the domain and the type of mesh desired. A typical goal is to create a mesh that accurately captures the input domain geometry, with high-quality (well-shaped) cells, and without so many cells as to make subsequent calculations intractable. The mesh should also be fine in areas that are important for the subsequent calculations.
A geodesic grid is a spatial grid based on a geodesic polyhedron or Goldberg polyhedron.
The Peirce quincuncial projection is the conformal map projection from the sphere to an unfolded square dihedron, developed by Charles Sanders Peirce in 1879. Each octant projects onto an isosceles right triangle, and these are arranged into a square. The name quincuncial refers to this arrangement: the north pole at the center and quarters of the south pole in the corners form a quincunx pattern like the pips on the five face of a traditional die. The projection has the distinctive property that it forms a seamless square tiling of the plane, conformal except at four singular points along the equator.
In spherical geometry, a spherical lune is an area on a sphere bounded by two half great circles which meet at antipodal points. It is an example of a digon, {2}θ, with dihedral angle θ. The word "lune" derives from luna, the Latin word for Moon.
HEALPix, an acronym for Hierarchical Equal Area isoLatitude Pixelisation of a 2-sphere, is an algorithm for pixelisation of the 2-sphere based on subdivision of a distorted rhombic dodecahedron, and the associated class of map projections. The pixelisation algorithm was devised in 1997 by Krzysztof M. Górski at the Theoretical Astrophysics Center in Copenhagen, Denmark, and first published as a preprint in 1998.
A mesh is a representation of a larger geometric domain by smaller discrete cells. Meshes are commonly used to compute solutions of partial differential equations and render computer graphics, and to analyze geographical and cartographic data. A mesh partitions space into elements over which the equations can be solved, which then approximates the solution over the larger domain. Element boundaries may be constrained to lie on internal or external boundaries within a model. Higher-quality (better-shaped) elements have better numerical properties, where what constitutes a "better" element depends on the general governing equations and the particular solution to the model instance.
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.
Snyder equal-area projection is a polyhedral map projection used in the ISEA discrete global grids. It is named for John P. Snyder, who developed the projection in the 1990s.
A polyhedral map projection is a map projection based on a spherical polyhedron. Typically, the polyhedron is overlaid on the globe, and each face of the polyhedron is transformed to a polygon or other shape in the plane. The best-known polyhedral map projection is Buckminster Fuller's Dymaxion map. When the spherical polyhedron faces are transformed to the faces of an ordinary polyhedron instead of laid flat in a plane, the result is a polyhedral globe.
Hierarchical Triangular Mesh (HTM) is a kind of quad tree based on subdivision of a distorted octahedron, used for mesh generation in 3-D computer graphics and geometric data structures.
