- subdivision vertex
- мат. вершина подразбиения
Большой англо-русский и русско-английский словарь. 2001.
subdivision vertex
Смотреть что такое "subdivision vertex" в других словарях:
Subdivision surface — A subdivision surface, in the field of 3D computer graphics, is a method of representing a smooth surface via the specification of a coarser piecewise linear polygon mesh. The smooth surface can be calculated from the coarse mesh as the limit of… … Wikipedia
Barycentric subdivision — In geometry, the barycentric subdivision is a standard way of dividing an arbitrary convex polygon into triangles, a convex polyhedron into tetrahedra, or, in general, a convex polytope into simplices with the same dimension, by connecting the… … Wikipedia
Doo–Sabin subdivision surface — Simple Doo Sabin sudivision surface. The figure shows the limit surface, as well as the control point wireframe mesh. In computer graphics, Doo–Sabin subdivision surface is a type of subdivision surface based on a generalization of bi quadratic… … Wikipedia
Surface de subdivision — Pour les articles homonymes, voir Surface. Dans le domaine de la CAO et des mathématiques, les surfaces de subdivision sont une façon de créer des surfaces lisses développant de plus en plus un maillage linéaire par morceaux. La surface lisse… … Wikipédia en Français
Point location — The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided… … Wikipedia
Orbifold — This terminology should not be blamed on me. It was obtained by a democratic process in my course of 1976 77. An orbifold is something with many folds; unfortunately, the word “manifold” already has a different definition. I tried “foldamani”,… … Wikipedia
Edge coloring — A 3 edge coloring of the Desargues graph. In graph theory, an edge coloring of a graph is an assignment of “colors” to the edges of the graph so that no two adjacent edges have the same color. For example, the figure to the right shows an edge… … Wikipedia
Hypergraph — An example hypergraph, with X = {v1,v2,v3,v4,v5,v6,v7} and E = {e1,e2,e3,e4} = {{v1,v2,v3}, {v2,v3} … Wikipedia
Polygon mesh — A polygon mesh or unstructured grid is a collection of vertices, edges and faces that defines the shape of a polyhedral object in 3D computer graphics and solid modeling. The faces usually consist of triangles, quadrilaterals or other simple… … Wikipedia
Fractional cascading — In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of time, as is… … Wikipedia
Planar graph — Example graphs Planar Nonplanar Butterfly graph K5 The complete graph K4 … Wikipedia
