- a
planar point set
gives rise to
pointed pseudotriangulations,
although not all
pointed pseudotriangulations can
arise in this way. For a
detailed survey...
- have
exactly three convex vertices. As in
point set triangulations,
pseudotriangulations are
required to have
their vertices at the
given input points. De...
- Gert (1996b), "Topologically
sweeping visibility complexes via
pseudotriangulations",
Discrete and Com****tional Geometry, 16 (4): 419–453, doi:10.1007/BF02712876...
-
pointed pseudotriangulations are
exactly the
planar Laman graphs. However,
Laman graphs have
planar embeddings that are not
pseudotriangulations, and there...
- that
remain planar throughout such a
motion can be
derived from
pseudotriangulations. In
structural rigidity, the
existence of (infinitesimal) parallel...
- 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...
- can be
embedded without crossings in the plane, as the
graphs of
pseudotriangulations,
partitions of a
plane region into
subregions with
three convex corners...
- have also been
studied include the
construction of minimum-weight
pseudotriangulations and the
characterization of the
graphs of minimum-weight triangulations...
- 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...
