pseudotriangulation
Look at other dictionaries:
Pseudotriangle — In Euclidean plane geometry, a pseudotriangle is the simply connected subset of the plane that lies between any three mutually tangent convex sets. A pseudotriangulation is a partition of a region of the plane into pseudotriangles, and a pointed… … Wikipedia
Laman graph — In graph theory, the Laman graphs are a family of sparse graphs describing the minimally rigid systems of rods and joints in the plane. Formally, a Laman graph is a graph on n vertices such that, for all k , every k vertex subgraph has at most 2… … Wikipedia
Antimatroid — In mathematics, an antimatroid is a formal system that describes processes in which a set is built up by including elements one at a time, and in which an element, once available for inclusion, remains available until it is included. Antimatroids … Wikipedia
Triangulation (advanced geometry) — In advanced geometry, in the most general meaning, triangulation is a subdivision of a geometric object into simplices. In particular, in the plane it is a subdivision into triangles, hence the name.Different branches of geometry use slightly… … Wikipedia
Bitangent — (black) has 28 real bitangents (red).This image shows 7 of them; the others are symmetric with respect to 90° rotations through the origin.] In mathematics, a bitangent to a curve C is a line L that touches C in two distinct points P and Q and… … Wikipedia
Carpenter's ruler problem — The carpenter s ruler problem is a discrete geometry problem, which can be stated in the following manner: Can a simple planar polygon be moved continuously to a position where all its vertices are in convex position, so that the edge lengths and … Wikipedia
