Spectrally Similar Incommensurable 3-Manifolds

Reid has asked whether hyperbolic manifolds with the same geodesic length spectrum must be commensurable. Building toward a negative answer to this question, we construct examples of hyperbolic 3–manifolds that share an arbitrarily large portion of the length spectrum but are not commensurable. More precisely, for every n ≫ 0, we construct a pair of incommensurable hyperbolic 3–manifolds Nn and Nµn whose volume is approximately n and whose length spectra agree up to length n. Both Nn and Nµn are built by gluing two standard submanifolds along a complicated pseudo-Anosov map, ensuring that these manifolds have a very thick collar about an essential surface. The two gluing maps differ by a hyper-elliptic involution along this surface. Our proof also involves a new commensurability criterion based on pairs of pants

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings

We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n vertices and k crossings, where k is smaller than n by an iterated logarithmic factor. Specific problems we study include Voronoi diagrams and single-source shortest paths. Our algorithms all run in linear time in the standard comparison-based computational model; hence, we make no assumptions about the distribution or bit complexities of edge weights, nor do we utilize unusual bit-level operations on memory words. Instead, our algorithms are based on a planarization method that "zeroes in" on edge crossings, together with methods for extending planar separator decompositions to geometric graphs with sublinearly many crossings. Incidentally, our planarization algorithm also solves an open computational geometry problem of Chazelle for triangulating a self-intersecting polygonal chain having n segments and k crossings in linear time, for the case when k is sublinear in n by an iterated logarithmic factor.Comment: Expanded version of a paper appearing at the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA09

On the complexity of optimal homotopies

In this article, we provide new structural results and algorithms for the Homotopy Height problem. In broad terms, this problem quantifies how much a curve on a surface needs to be stretched to sweep continuously between two positions. More precisely, given two homotopic curves $\gamma_1$ and $\gamma_2$ on a combinatorial (say, triangulated) surface, we investigate the problem of computing a homotopy between $\gamma_1$ and $\gamma_2$ where the length of the longest intermediate curve is minimized. Such optimal homotopies are relevant for a wide range of purposes, from very theoretical questions in quantitative homotopy theory to more practical applications such as similarity measures on meshes and graph searching problems. We prove that Homotopy Height is in the complexity class NP, and the corresponding exponential algorithm is the best one known for this problem. This result builds on a structural theorem on monotonicity of optimal homotopies, which is proved in a companion paper. Then we show that this problem encompasses the Homotopic Fr\'echet distance problem which we therefore also establish to be in NP, answering a question which has previously been considered in several different settings. We also provide an O(log n)-approximation algorithm for Homotopy Height on surfaces by adapting an earlier algorithm of Har-Peled, Nayyeri, Salvatipour and Sidiropoulos in the planar setting

Crossing Patterns in Nonplanar Road Networks

We define the crossing graph of a given embedded graph (such as a road network) to be a graph with a vertex for each edge of the embedding, with two crossing graph vertices adjacent when the corresponding two edges of the embedding cross each other. In this paper, we study the sparsity properties of crossing graphs of real-world road networks. We show that, in large road networks (the Urban Road Network Dataset), the crossing graphs have connected components that are primarily trees, and that the remaining non-tree components are typically sparse (technically, that they have bounded degeneracy). We prove theoretically that when an embedded graph has a sparse crossing graph, it has other desirable properties that lead to fast algorithms for shortest paths and other algorithms important in geographic information systems. Notably, these graphs have polynomial expansion, meaning that they and all their subgraphs have small separators.Comment: 9 pages, 4 figures. To appear at the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems(ACM SIGSPATIAL 2017

Spectrally Similar Incommensurable 3-Manifolds

Reid has asked whether hyperbolic manifolds with the same geodesic length spectrum must be commensurable. Building toward a negative answer to this question, we construct examples of hyperbolic 3–manifolds that share an arbitrarily large portion of the length spectrum but are not commensurable. More precisely, for every n ≫ 0, we construct a pair of incommensurable hyperbolic 3–manifolds Nn and Nµn whose volume is approximately n and whose length spectra agree up to length n. Both Nn and Nµn are built by gluing two standard submanifolds along a complicated pseudo-Anosov map, ensuring that these manifolds have a very thick collar about an essential surface. The two gluing maps differ by a hyper-elliptic involution along this surface. Our proof also involves a new commensurability criterion based on pairs of pants