1,402 research outputs found
Metric inequalities for polygons
Let be the vertices of a polygon with unit perimeter, that
is . We derive various tight estimates on the
minimum and maximum values of the sum of pairwise distances, and respectively
sum of pairwise squared distances among its vertices. In most cases such
estimates on these sums in the literature were known only for convex polygons.
In the second part, we turn to a problem of Bra\ss\ regarding the maximum
perimeter of a simple -gon ( odd) contained in a disk of unit radius. The
problem was solved by Audet et al. \cite{AHM09b}, who gave an exact formula.
Here we present an alternative simpler proof of this formula. We then examine
what happens if the simplicity condition is dropped, and obtain an exact
formula for the maximum perimeter in this case as well.Comment: 13 pages, 2 figures. This version replaces the previous version from
8 Feb 2011. A new section has been added and the material has been
reorganized; a correction has been done in the proof of Lemma 4 (analysis of
Case 3
Examples, Counterexamples, and Enumeration Results for Foldings and Unfoldings between Polygons and Polytopes
We investigate how to make the surface of a convex polyhedron (a polytope) by
folding up a polygon and gluing its perimeter shut, and the reverse process of
cutting open a polytope and unfolding it to a polygon. We explore basic
enumeration questions in both directions: Given a polygon, how many foldings
are there? Given a polytope, how many unfoldings are there to simple polygons?
Throughout we give special attention to convex polygons, and to regular
polygons. We show that every convex polygon folds to an infinite number of
distinct polytopes, but that their number of combinatorially distinct gluings
is polynomial. There are, however, simple polygons with an exponential number
of distinct gluings.
In the reverse direction, we show that there are polytopes with an
exponential number of distinct cuttings that lead to simple unfoldings. We
establish necessary conditions for a polytope to have convex unfoldings,
implying, for example, that among the Platonic solids, only the tetrahedron has
a convex unfolding. We provide an inventory of the polytopes that may unfold to
regular polygons, showing that, for n>6, there is essentially only one class of
such polytopes.Comment: 54 pages, 33 figure
Statistical hyperbolicity in groups
In this paper, we introduce a geometric statistic called the "sprawl" of a
group with respect to a generating set, based on the average distance in the
word metric between pairs of words of equal length. The sprawl quantifies a
certain obstruction to hyperbolicity. Group presentations with maximum sprawl
(i.e., without this obstruction) are called statistically hyperbolic. We first
relate sprawl to curvature and show that nonelementary hyperbolic groups are
statistically hyperbolic, then give some results for products, for
Diestel-Leader graphs and lamplighter groups. In free abelian groups, the word
metrics asymptotically approach norms induced by convex polytopes, causing the
study of sprawl to reduce to a problem in convex geometry. We present an
algorithm that computes sprawl exactly for any generating set, thus quantifying
the failure of various presentations of Z^d to be hyperbolic. This leads to a
conjecture about the extreme values, with a connection to the classic Mahler
conjecture.Comment: 14 pages, 5 figures. This is split off from the paper "The geometry
of spheres in free abelian groups.
A Pseudopolynomial Algorithm for Alexandrov's Theorem
Alexandrov's Theorem states that every metric with the global topology and
local geometry required of a convex polyhedron is in fact the intrinsic metric
of a unique convex polyhedron. Recent work by Bobenko and Izmestiev describes a
differential equation whose solution leads to the polyhedron corresponding to a
given metric. We describe an algorithm based on this differential equation to
compute the polyhedron to arbitrary precision given the metric, and prove a
pseudopolynomial bound on its running time. Along the way, we develop
pseudopolynomial algorithms for computing shortest paths and weighted Delaunay
triangulations on a polyhedral surface, even when the surface edges are not
shortest paths.Comment: 25 pages; new Delaunay triangulation algorithm, minor other changes;
an abbreviated v2 was at WADS 200
On the Lengths of Curves Passing through Boundary Points of a Planar Convex Shape
We study the lengths of curves passing through a fixed number of points on
the boundary of a convex shape in the plane. We show that for any convex shape
, there exist four points on the boundary of such that the length of any
curve passing through these points is at least half of the perimeter of . It
is also shown that the same statement does not remain valid with the additional
constraint that the points are extreme points of . Moreover, the factor
cannot be achieved with any fixed number of extreme points. We
conclude the paper with few other inequalities related to the perimeter of a
convex shape.Comment: 7 pages, 8 figure
- …