Hyperbolic Dehn filling in dimension four

We introduce and study some deformations of complete finite-volume hyperbolic four-manifolds that may be interpreted as four-dimensional analogues of Thurston's hyperbolic Dehn filling. We construct in particular an analytic path of complete, finite-volume cone four-manifolds $M_t$ that interpolates between two hyperbolic four-manifolds $M_0$ and $M_1$ with the same volume $\frac {8}3\pi^2$. The deformation looks like the familiar hyperbolic Dehn filling paths that occur in dimension three, where the cone angle of a core simple closed geodesic varies monotonically from $0$ to $2\pi$. Here, the singularity of $M_t$ is an immersed geodesic surface whose cone angles also vary monotonically from $0$ to $2\pi$. When a cone angle tends to $0$ a small core surface (a torus or Klein bottle) is drilled producing a new cusp. We show that various instances of hyperbolic Dehn fillings may arise, including one case where a degeneration occurs when the cone angles tend to $2\pi$, like in the famous figure-eight knot complement example. The construction makes an essential use of a family of four-dimensional deforming hyperbolic polytopes recently discovered by Kerckhoff and Storm.Comment: 60 pages, 23 figures. Final versio

Probing Convex Polygons with a Wedge

Minimizing the number of probes is one of the main challenges in reconstructing geometric objects with probing devices. In this paper, we investigate the problem of using an $\omega$-wedge probing tool to determine the exact shape and orientation of a convex polygon. An $\omega$-wedge consists of two rays emanating from a point called the apex of the wedge and the two rays forming an angle $\omega$. To probe with an $\omega$-wedge, we set the direction that the apex of the probe has to follow, the line $\overrightarrow L$, and the initial orientation of the two rays. A valid $\omega$-probe of a convex polygon $O$ contains $O$ within the $\omega$-wedge and its outcome consists of the coordinates of the apex, the orientation of both rays and the coordinates of the closest (to the apex) points of contact between $O$ and each of the rays. We present algorithms minimizing the number of probes and prove their optimality. In particular, we show how to reconstruct a convex $n$-gon (with all internal angles of size larger than $\omega$) using $2n-2$ $\omega$-probes; if $\omega = \pi/2$, the reconstruction uses $2n-3$ $\omega$-probes. We show that both results are optimal. Let $N_B$ be the number of vertices of $O$ whose internal angle is at most $\omega$, (we show that $0 \leq N_B \leq 3$). We determine the shape and orientation of a general convex $n$-gon with $N_B=1$ (respectively $N_B=2$, $N_B=3$) using $2n-1$ (respectively $2n+3$, $2n+5$) $\omega$-probes. We prove optimality for the first case. Assuming the algorithm knows the value of $N_B$ in advance, the reconstruction of $O$ with $N_B=2$ or $N_B=3$ can be achieved with $2n+2$ probes,- which is optimal.Comment: 31 pages, 27 figure

Algorithms for distance problems in planar complexes of global nonpositive curvature

CAT(0) metric spaces and hyperbolic spaces play an important role in combinatorial and geometric group theory. In this paper, we present efficient algorithms for distance problems in CAT(0) planar complexes. First of all, we present an algorithm for answering single-point distance queries in a CAT(0) planar complex. Namely, we show that for a CAT(0) planar complex K with n vertices, one can construct in O(n^2 log n) time a data structure D of size O(n^2) so that, given a point x in K, the shortest path gamma(x,y) between x and the query point y can be computed in linear time. Our second algorithm computes the convex hull of a finite set of points in a CAT(0) planar complex. This algorithm is based on Toussaint's algorithm for computing the convex hull of a finite set of points in a simple polygon and it constructs the convex hull of a set of k points in O(n^2 log n + nk log k) time, using a data structure of size O(n^2 + k)