|
Mesh Parameterization
Given two surfaces with the same topology, a bijective mapping between them exists. On triangular mesh surfaces, the problem of computing this mapping is called mesh parameterization. The parameter domain is the surface that the mesh is mapped onto. Parameterization was mainly used for mapping textures to surfaces. Recently, it has become a powerful tool for many applications in mesh processing. Various techniques are developed for different types of parameter domains with different parameterization properties. Applications * Texture mapping * Normal mapping * Detail transfer * Morphing * Mesh completion * Mesh Editing * Mesh Databases * Remeshing * Surface fitting Techniques * Barycentric Mappings * Differential Geometry Primer * Non-Linear Methods Implementations A fast and simple stretch-minimizing mesh parameterization ABF++, LSCM, Spectral LSCM Linear discrete conformal parameterizationBoundary First FlatteningScalable Locally Injective Mappings See also * Param ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surface (topology)
In the part of mathematics referred to as topology, a surface is a two-dimensional manifold. Some surfaces arise as the boundaries of three-dimensional solids; for example, the sphere is the boundary of the solid ball. Other surfaces arise as graphs of functions of two variables; see the figure at right. However, surfaces can also be defined abstractly, without reference to any ambient space. For example, the Klein bottle is a surface that cannot be embedded in three-dimensional Euclidean space. Topological surfaces are sometimes equipped with additional information, such as a Riemannian metric or a complex structure, that connects them to other disciplines within mathematics, such as differential geometry and complex analysis. The various mathematical notions of surface can be used to model surfaces in the physical world. In general In mathematics, a surface is a geometrical shape that resembles a deformed plane. The most familiar examples arise as boundaries of solid ob ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Topology
In mathematics, topology (from the Greek language, Greek words , and ) is concerned with the properties of a mathematical object, geometric object that are preserved under Continuous function, continuous Deformation theory, deformations, such as Stretch factor, stretching, Twist (mathematics), twisting, crumpling, and bending; that is, without closing holes, opening holes, tearing, gluing, or passing through itself. A topological space is a set (mathematics), set endowed with a structure, called a ''Topology (structure), topology'', which allows defining continuous deformation of subspaces, and, more generally, all kinds of continuity (mathematics), continuity. Euclidean spaces, and, more generally, metric spaces are examples of a topological space, as any distance or metric defines a topology. The deformations that are considered in topology are homeomorphisms and homotopy, homotopies. A property that is invariant under such deformations is a topological property. Basic exampl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Bijective Mapping
In mathematics, a bijection, also known as a bijective function, one-to-one correspondence, or invertible function, is a function between the elements of two sets, where each element of one set is paired with exactly one element of the other set, and each element of the other set is paired with exactly one element of the first set. There are no unpaired elements. In mathematical terms, a bijective function is a one-to-one (injective) and onto (surjective) mapping of a set ''X'' to a set ''Y''. The term ''one-to-one correspondence'' must not be confused with ''one-to-one function'' (an injective function; see figures). A bijection from the set ''X'' to the set ''Y'' has an inverse function from ''Y'' to ''X''. If ''X'' and ''Y'' are finite sets, then the existence of a bijection means they have the same number of elements. For infinite sets, the picture is more complicated, leading to the concept of cardinal number—a way to distinguish the various sizes of infinite sets. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Polygon Mesh
In 3D computer graphics and solid modeling, a polygon mesh is a collection of , s and s that defines the shape of a polyhedral object. The faces usually consist of triangles (triangle mesh), quadrilaterals (quads), or other simple convex polygons ( n-gons), since this simplifies rendering, but may also be more generally composed of concave polygons, or even polygons with holes. The study of polygon meshes is a large sub-field of computer graphics (specifically 3D computer graphics) and geometric modeling. Different representations of polygon meshes are used for different applications and goals. The variety of operations performed on meshes may include: Boolean logic ( Constructive solid geometry), smoothing, simplification, and many others. Algorithms also exist for ray tracing, collision detection, and rigid-body dynamics with polygon meshes. If the mesh's edges are rendered instead of the faces, then the model becomes a wireframe model. Volumetric meshes are distinct f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parameterization
In mathematics, and more specifically in geometry, parametrization (or parameterization; also parameterisation, parametrisation) is the process of finding parametric equations of a curve, a surface, or, more generally, a manifold or a variety, defined by an implicit equation. The inverse process is called implicitization. "To parameterize" by itself means "to express in terms of parameters". Parametrization is a mathematical process consisting of expressing the state of a system, process or model as a function of some independent quantities called parameters. The state of the system is generally determined by a finite set of coordinates, and the parametrization thus consists of one function of several real variables for each coordinate. The number of parameters is the number of degrees of freedom of the system. For example, the position of a point that moves on a curve in three-dimensional space is determined by the time needed to reach the point when starting from a fixed orig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Texture Mapping
Texture mapping is a method for mapping a texture on a computer-generated graphic. Texture here can be high frequency detail, surface texture, or color. History The original technique was pioneered by Edwin Catmull in 1974. Texture mapping originally referred to diffuse mapping, a method that simply mapped pixels from a texture to a 3D surface ("wrapping" the image around the object). In recent decades, the advent of multi-pass rendering, multitexturing, mipmaps, and more complex mappings such as height mapping, bump mapping, normal mapping, displacement mapping, reflection mapping, specular mapping, occlusion mapping, and many other variations on the technique (controlled by a materials system) have made it possible to simulate near-photorealism in real time by vastly reducing the number of polygons and lighting calculations needed to construct a realistic and functional 3D scene. Texture maps A is an image applied (mapped) to the surface of a shape or polygon. This ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Morphing
Morphing is a special effect in motion pictures and animations that changes (or morphs) one image or shape into another through a seamless transition. Traditionally such a depiction would be achieved through dissolving techniques on film. Since the early 1990s, this has been replaced by computer software to create more realistic transitions. A similar method is applied to audio recordings, for example, by changing voices or vocal lines. Early transformation techniques Long before digital morphing, several techniques were used for similar image transformations. Some of those techniques are closer to a matched dissolve - a gradual change between two pictures without warping the shapes in the images - while others did change the shapes in between the start and end phases of the transformation. Tabula scalata Known since at least the end of the 16th century, Tabula scalata is a type of painting with two images divided over a corrugated surface. Each image is only correctly visible ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Surface Fitting
Curve fitting is the process of constructing a curve, or mathematical function, that has the best fit to a series of data points, possibly subject to constraints. Curve fitting can involve either interpolation, where an exact fit to the data is required, or smoothing, in which a "smooth" function is constructed that approximately fits the data. A related topic is regression analysis, which focuses more on questions of statistical inference such as how much uncertainty is present in a curve that is fit to data observed with random errors. Fitted curves can be used as an aid for data visualization, to infer values of a function where no data are available, and to summarize the relationships among two or more variables. Extrapolation refers to the use of a fitted curve beyond the range of the observed data, and is subject to a degree of uncertainty since it may reflect the method used to construct the curve as much as it reflects the observed data. For linear-algebraic analysis of ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Least Squares Conformal Map
A Least squares conformal map (LSCM) is a 2-D representation of a 3-D shape created using the Least Squares Conformal Mapping Method. By using the map as a guide when creating a new 2-D image, the colors of the 2-D image can be applied to the original 3-D model. LSCM is used in computer graphics as a method of producing a UV map from a polygonal mesh to a texture map such that the shape of the polygons as mapped to the texture is relatively undistorted. See also * Conformal map * UV mapping UV mapping is the 3D modeling process of projecting a 3D model's surface to a 2D image for texture mapping. The letters "U" and "V" denote the axes of the 2D texture because "X", "Y", and "Z" are already used to denote the axes of the 3D object i ... External links Least Squares Conformal Maps for Automatic Texture Atlas Generation ACM SIGGRAPH conference proceedings, 2002 Computer graphics data structures {{Compu-graphics-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Parametrization (geometry)
In mathematics, and more specifically in geometry, parametrization (or parameterization; also parameterisation, parametrisation) is the process of finding parametric equations of a curve, a surface, or, more generally, a manifold or a variety, defined by an implicit equation. The inverse process is called implicitization. "To parameterize" by itself means "to express in terms of parameters". Parametrization is a mathematical process consisting of expressing the state of a system, process or model as a function of some independent quantities called parameters. The state of the system is generally determined by a finite set of coordinates, and the parametrization thus consists of one function of several real variables for each coordinate. The number of parameters is the number of degrees of freedom of the system. For example, the position of a point that moves on a curve in three-dimensional space is determined by the time needed to reach the point when starting from a fixed orig ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Texture Atlas
In computer graphics, a texture atlas (also called a spritesheet or an image sprite in 2d game development) is an image containing multiple smaller images, usually packed together to reduce overall dimensions. An atlas can consist of uniformly-sized images or images of varying dimensions. A sub-image is drawn using custom texture coordinates to pick it out of the atlas. Benefits In an application where many small textures are used frequently, it is often more efficient to store the textures in a texture atlas which is treated as a single unit by the graphics hardware. This reduces both the disk I/O overhead and the overhead of a context switch by increasing memory locality. Careful alignment may be needed to avoid bleeding between sub textures when used with mipmapping and texture compression. In web development, images are packed into a sprite sheet to reduce the number of image resources that need to be fetched in order to display a page.{{cite web , title=Implementing image s ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
