5,503 research outputs found
Real elements in the mapping class group of
We present a complete classification of elements in the mapping class group
of the torus which have a representative that can be written as a product of
two orientation reversing involutions. Our interest in such decompositions is
motivated by features of the monodromy maps of real fibrations. We employ the
property that the mapping class group of the torus is identifiable with
as well as that the quotient group is the symmetry group
of the {\em Farey tessellation} of the Poincar\'e disk.Comment: 15 pages, 11 figure
Shortest path embeddings of graphs on surfaces
The classical theorem of F\'{a}ry states that every planar graph can be
represented by an embedding in which every edge is represented by a straight
line segment. We consider generalizations of F\'{a}ry's theorem to surfaces
equipped with Riemannian metrics. In this setting, we require that every edge
is drawn as a shortest path between its two endpoints and we call an embedding
with this property a shortest path embedding. The main question addressed in
this paper is whether given a closed surface S, there exists a Riemannian
metric for which every topologically embeddable graph admits a shortest path
embedding. This question is also motivated by various problems regarding
crossing numbers on surfaces.
We observe that the round metrics on the sphere and the projective plane have
this property. We provide flat metrics on the torus and the Klein bottle which
also have this property.
Then we show that for the unit square flat metric on the Klein bottle there
exists a graph without shortest path embeddings. We show, moreover, that for
large g, there exist graphs G embeddable into the orientable surface of genus
g, such that with large probability a random hyperbolic metric does not admit a
shortest path embedding of G, where the probability measure is proportional to
the Weil-Petersson volume on moduli space.
Finally, we construct a hyperbolic metric on every orientable surface S of
genus g, such that every graph embeddable into S can be embedded so that every
edge is a concatenation of at most O(g) shortest paths.Comment: 22 pages, 11 figures: Version 3 is updated after comments of
reviewer
Distance-Sensitive Planar Point Location
Let be a connected planar polygonal subdivision with edges
that we want to preprocess for point-location queries, and where we are given
the probability that the query point lies in a polygon of
. We show how to preprocess such that the query time
for a point~ depends on~ and, in addition, on the distance
from to the boundary of~---the further away from the boundary, the
faster the query. More precisely, we show that a point-location query can be
answered in time , where
is the shortest Euclidean distance of the query point~ to the
boundary of . Our structure uses space and
preprocessing time. It is based on a decomposition of the regions of
into convex quadrilaterals and triangles with the following
property: for any point , the quadrilateral or triangle
containing~ has area . For the special case where
is a subdivision of the unit square and
, we present a simpler solution that achieves a
query time of . The latter solution can be extended to
convex subdivisions in three dimensions
Higher signature Delaunay decompositions
A Delaunay decomposition is a cell decomposition in R^d for which each cell
is inscribed in a Euclidean ball which is empty of all other vertices. This
article introduces a generalization of the Delaunay decomposition in which the
Euclidean balls in the empty ball condition are replaced by other families of
regions bounded by certain quadratic hypersurfaces. This generalized notion is
adaptable to geometric contexts in which the natural space from which the point
set is sampled is not Euclidean, but rather some other flat semi-Riemannian
geometry, possibly with degenerate directions. We prove the existence and
uniqueness of the decomposition and discuss some of its basic properties. In
the case of dimension d = 2, we study the extent to which some of the
well-known optimality properties of the Euclidean Delaunay triangulation
generalize to the higher signature setting. In particular, we describe a higher
signature generalization of a well-known description of Delaunay decompositions
in terms of the intersection angles between the circumscribed circles.Comment: 25 pages, 6 figure
- …