2,489 research outputs found
Quadratic Time Computable Instances of MaxMin and MinMax Area Triangulations of Convex Polygons
We consider the problems of finding two optimal triangulations
of a convex polygon: MaxMin area and MinMax area. These are the
triangulations that maximize the area of the smallest area triangle in a triangulation,
and respectively minimize the area of the largest area triangle
in a triangulation, over all possible triangulations. The problem was originally
solved by Klincsek by dynamic programming in cubic time [2]. Later,
Keil and Vassilev devised an algorithm that runs in O(n^2 log n) time [1]. In
this paper we describe new geometric findings on the structure of MaxMin
and MinMax Area triangulations of convex polygons in two dimensions and
their algorithmic implications. We improve the algorithm’s running time to
quadratic for large classes of convex polygons. We also present experimental
results on MaxMin area triangulation
Once punctured disks, non-convex polygons, and pointihedra
We explore several families of flip-graphs, all related to polygons or
punctured polygons. In particular, we consider the topological flip-graphs of
once-punctured polygons which, in turn, contain all possible geometric
flip-graphs of polygons with a marked point as embedded sub-graphs. Our main
focus is on the geometric properties of these graphs and how they relate to one
another. In particular, we show that the embeddings between them are strongly
convex (or, said otherwise, totally geodesic). We also find bounds on the
diameters of these graphs, sometimes using the strongly convex embeddings.
Finally, we show how these graphs relate to different polytopes, namely type D
associahedra and a family of secondary polytopes which we call pointihedra.Comment: 24 pages, 6 figure
Counting Carambolas
We give upper and lower bounds on the maximum and minimum number of geometric
configurations of various kinds present (as subgraphs) in a triangulation of
points in the plane. Configurations of interest include \emph{convex
polygons}, \emph{star-shaped polygons} and \emph{monotone paths}. We also
consider related problems for \emph{directed} planar straight-line graphs.Comment: update reflects journal version, to appear in Graphs and
Combinatorics; 18 pages, 13 figure
Non-crossing frameworks with non-crossing reciprocals
We study non-crossing frameworks in the plane for which the classical
reciprocal on the dual graph is also non-crossing. We give a complete
description of the self-stresses on non-crossing frameworks whose reciprocals
are non-crossing, in terms of: the types of faces (only pseudo-triangles and
pseudo-quadrangles are allowed); the sign patterns in the self-stress; and a
geometric condition on the stress vectors at some of the vertices.
As in other recent papers where the interplay of non-crossingness and
rigidity of straight-line plane graphs is studied, pseudo-triangulations show
up as objects of special interest. For example, it is known that all planar
Laman circuits can be embedded as a pseudo-triangulation with one non-pointed
vertex. We show that if such an embedding is sufficiently generic, then the
reciprocal is non-crossing and again a pseudo-triangulation embedding of a
planar Laman circuit. For a singular (i.e., non-generic) pseudo-triangulation
embedding of a planar Laman circuit, the reciprocal is still non-crossing and a
pseudo-triangulation, but its underlying graph may not be a Laman circuit.
Moreover, all the pseudo-triangulations which admit a non-crossing reciprocal
arise as the reciprocals of such, possibly singular, stresses on
pseudo-triangulation embeddings of Laman circuits.
All self-stresses on a planar graph correspond to liftings to piece-wise
linear surfaces in 3-space. We prove characteristic geometric properties of the
lifts of such non-crossing reciprocal pairs.Comment: 32 pages, 23 figure
- …