In Euclidean plane geometry, a **pseudotriangle** (*pseudo-triangle*) is the simply connected subset of the plane that lies between any three mutually tangent convex sets. A **pseudotriangulation** (*pseudo-triangulations*) is a partition of a region of the plane into pseudotriangles, and a **pointed pseudotriangulation** is a pseudotriangulation in which at each vertex the incident edges span an angle of less than π.

Although the words "pseudotriangle" and "pseudotriangulation" have been used with various meanings in mathematics for much longer,^{[1]} the terms as used here were introduced in 1993 by Michel Pocchiola and Gert Vegter in connection with the computation of visibility relations and bitangents among convex obstacles in the plane. Pointed pseudotriangulations were first considered by Ileana Streinu (2000, 2005) as part of her solution to the carpenter's ruler problem, a proof that any simple polygonal path in the plane can be straightened out by a sequence of continuous motions. Pseudotriangulations have also been used for collision detection among moving objects^{[2]} and for dynamic graph drawing and shape morphing.^{[3]} Pointed pseudotriangulations arise in rigidity theory as examples of minimally rigid planar graphs,^{[4]} and in methods for placing guards in connection with the art gallery theorem.^{[5]} The shelling antimatroid of a planar point set gives rise to pointed pseudotriangulations,^{[6]} although not all pointed pseudotriangulations can arise in this way.

For a detailed survey of much of the material discussed here, see Rote, Santos, and Streinu (2008).

Pocchiola and Vegter (1996a,b,c) originally defined a pseudotriangle to be a simply-connected region of the plane bounded by three smooth convex curves that are tangent at their endpoints. However, subsequent work has settled on a broader definition that applies more generally to polygons as well as to regions bounded by smooth curves, and that allows nonzero angles at the three vertices. In this broader definition, a pseudotriangle is a simply-connected region of the plane, having three convex vertices. The three boundary curves connecting these three vertices must be convex, in the sense that any line segment connecting two points on the same boundary curve must lie entirely outside or on the boundary of the pseudotriangle. Thus, the pseudotriangle is the region between the convex hulls of these three curves, and more generally any three mutually tangent convex sets form a pseudotriangle that lies between them.

For algorithmic applications it is of particular interest to characterize pseudotriangles that are polygons. In a polygon, a vertex is *convex* if it spans an interior angle of less than π, and *concave* otherwise (in particular, we consider an angle of exactly π to be concave). Any polygon must have at least three convex angles, because the total exterior angle of a polygon is 2π, the convex angles contribute less than π each to this total, and the concave angles contribute zero or negative amounts. A polygonal pseudotriangle is a polygon that has exactly three convex vertices. In particular, any triangle, and any nonconvex quadrilateral, is a pseudotriangle.

The convex hull of any pseudotriangle is a triangle. The curves along the pseudotriangle boundary between each pair of convex vertices either lie within the triangle or coincide with one of its edges.

A **pseudotriangulation** is a partition of a region of the plane into pseudotriangles. Any triangulation of a region of the plane is a pseudotriangulation. While any two triangulations of the same region must have the same numbers of edges and triangles, the same is not true of pseudotriangulations; for instance, if the region is itself an *n*-vertex polygonal pseudotriangle, then a pseudotriangulation of it may have as few as one pseudotriangle and *n* edges, or as many as *n* − 2 pseudotriangles and 2*n* − 3 edges.

A *minimal pseudotriangulation* is a pseudotriangulation *T* such that no subgraph of *T* is a pseudotriangulation covering the same convex region of the plane. A minimal pseudotriangulation with *n* vertices must have at least 2*n* − 3 edges; if it has exactly 2*n* − 3 edges, it must be a pointed pseudotriangulation, but there exist minimal pseudotriangulations with 3*n* − O(1) edges.^{[7]}

Agarwal et al. (2002) describe data structures for maintaining pseudotriangulations of moving points or moving polygons. They show that using pseudotriangulations in place of triangulations allows their algorithms to maintain these structures with relatively few combinatorial changes as the inputs move, and they use these dynamic pseudotriangulations to perform collision detection among the moving objects.

Gudmundsson et al. (2004) consider the problem of finding a pseudotriangulation of a point set or polygon with minimum total edge length, and provide approximation algorithms for this problem.

A **pointed pseudotriangulation** can be defined as a finite non-crossing collection of line segments, such that at each vertex the incident line segments span an angle of at most π, and such that no line segments can be added between any two existing vertices while preserving this property. It is not hard to see that a pointed pseudotriangulation is a pseudotriangulation of its convex hull: all convex hull edges may be added while preserving the angle-spanning property, and all interior faces must be pseudotriangles else a bitangent line segment could be added between two vertices of the face.

A pointed pseudotriangulation with *v* vertices must have exactly 2*v* − 3 edges.^{[8]} This follows by a simple double counting argument involving the Euler characteristic: as each face but the outer one is a pseudotriangle, with three convex angles, the pseudotriangulation must have 3*f* − 3 convex angles between adjacent edges. Each edge is the clockwise edge for two angles, so there are a total of 2*e* angles, of which all but *v* are convex. Thus, 3*f* − 3 = 2*e* − *v*. Combining this with the Euler equation *f* − *e* + *v* = 2 and solving the resulting simultaneous linear equations gives *e* = 2*v* − 3. The same argument also shows that *f* = *v* − 1 (including the convex hull as one of the faces), so the pseudotriangulation must have exactly *v* − 2 pseudotriangles.

Similarly, since any *k*-vertex subgraph of a pointed pseudotriangulation can be completed to form a pointed pseudotriangulation of its vertices, the subgraph must have at most 2*k* − 3 edges. Thus, pointed pseudotriangulations satisfy the conditions defining Laman graphs: they have exactly 2*v* − 3 edges, and their *k*-vertex subgraphs have at most 2*k* − 3 edges. Laman graphs, and therefore also pointed pseudotriangulations, are minimally rigid graphs in two dimensions. Every planar Laman graph can be drawn as a pointed pseudotriangulation, although not every planar drawing of a planar Laman graph is a pseudotriangulation.^{[9]}

Another way of finding a pointed pseudotriangulation is to *shell* a point set; that is, to remove convex hull vertices one by one until all points have been removed. The family of sequences of removals that can be formed in this way is the shelling antimatroid of the point set, and the set of edges of convex hulls of the sequence of point sets formed by this removal process forms a pseudotriangulation.^{[6]} However, not all pointed pseudotriangulations can be formed in this way.

Aichholzer et al. (2004) show that a set of *n* points, *h* of which belong to the convex hull of the set, must have at least *C*_{h−2}×3^{n−h} different pointed pseudotriangulations, where *C _{i}* denotes the