- sets. A
pseudotriangulation (pseudo-triangulations) is a
partition of a
region of the
plane into pseudotriangles, and a
pointed pseudotriangulation is a...
-
subdivisions into
shapes related to triangles. In particular, a
pseudotriangulation of a
point set is a
partition of the
convex hull of the
points into...
-
pointed pseudotriangulations are
exactly the
planar Laman graphs. However,
Laman graphs have
planar embeddings that are not
pseudotriangulations, and there...
- Streinu's
version of the
proof adds
edges to the
input to form a
pointed pseudotriangulation,
removes one
added convex hull edge from this graph, and
shows that...
- the plane. As a
planar Laman graph, it is the
graph of a
pointed pseudotriangulation,
meaning that it can be
embedded in the
plane in such a way that...
-
system of
multiple disjoint convex curves,
using a
technique based on
pseudotriangulation.
Bitangents may be used to
speed up the
visibility graph approach...
- self-crossings. Streinu's
solution augments the
input to form a
pointed pseudotriangulation,
removes one
convex hull edge from this graph, and
shows that this...
- have also been
studied include the
construction of minimum-weight
pseudotriangulations and the
characterization of the
graphs of minimum-weight triangulations...
- can be
embedded without crossings in the plane, as the
graphs of
pseudotriangulations,
partitions of a
plane region into
subregions with
three convex corners...
- that
remain planar throughout such a
motion can be
derived from
pseudotriangulations. In
structural rigidity, the
existence of (infinitesimal) parallel...
