- planar triangulation
- мат. плоская триангуляция
Большой англо-русский и русско-английский словарь. 2001.
planar triangulation
Смотреть что такое "planar triangulation" в других словарях:
Triangulation (disambiguation) — Triangulation refers to measurement by using triangles. The term triangulation may also refer to:Mathematics and computer science*Subdivisions of spaces into triangles or higher dimensional simplices: **triangulation (advanced geometry), division … Wikipedia
Planar straight-line graph — (PSLG) is a term used in computational geometry for an embedding of a planar graph in the plane such that its edges are mapped into straight line segments. [cite book author = Franco P. Preparata and Michael Ian Shamos | title = Computational… … Wikipedia
Triangulation — In trigonometry and geometry, triangulation is the process of determining the location of a point by measuring angles to it from known points at either end of a fixed baseline, rather than measuring distances to the point directly. The point can… … Wikipedia
Triangulation (topology) — In mathematics, topology generalizes the notion of triangulation in a natural way as follows: A triangulation of a topological space X is a simplicial complex K , homeomorphic to X , together with a homeomorphism h : K o X . Triangulation is… … Wikipedia
Minimum-weight triangulation — In computational geometry and computer science, the minimum weight triangulation (MWT) problem is the problem of finding a triangulation of minimal weight. Of particular interest is the problem of finding a minimum weight point set triangulation … Wikipedia
Delaunay triangulation — A Delaunay triangulation in the plane with circumcircles shown In mathematics and computational geometry, a Delaunay triangulation for a set P of points in the plane is a triangulation DT(P) such that no point in P is inside the circumcircle of… … Wikipedia
Point set triangulation — A triangulation of a set of points P in the plane is a triangulation of the convex hull of P, with all points from P being among the vertices of the triangulation. Triangulations are special cases of planar straight line graphs.Sometimes it is… … Wikipedia
Polygon triangulation — In computational geometry, polygon triangulation is the decomposition of a polygon into a set of triangles.A triangulation of a polygon P is its partition into non overlapping triangles whose union is P. In the strictest sense, these triangles… … Wikipedia
Chromatic polynomial — All nonisomorphic graphs on 3 vertices and their chromatic polynomials, clockwise from the top. The independent 3 set: k3. An edge and a single vertex: k2(k − 1). The 3 path: k(k − 1)2. The 3 clique … 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
Geometric graph theory — In mathematics, a geometric graph is a graph in which the vertices or edges are associated with geometric objects or configurations. Geometric graph theory is a specialization of graph theory that studies geometric graphs. Notable geometric… … Wikipedia
