Fast Thick-Thin Decomposition for Sparse Spanners on Hyperbolic Surfaces
Sándor Kisfaludi-Bak, Geert van Wordragen
Abstract
We consider spanners for point sets lying in the hyperbolic plane or on a closed hyperbolic surface with the restriction that spanner edges are not allowed to cross. This is a natural generalization of non-crossing Euclidean spanners. Thus, the resulting spanner graphs are embedded in the hyperbolic plane or on the hyperbolic surface. As our main contribution, we show that there are sparse (1+)-spanners for these problems when we are allowed to use Steiner points: - on the hyperbolic plane we get a non-crossing Steiner (1+)-spanner with O(n / 2) edges, - on hyperbolic surfaces of genus g we get a Steiner (1+)-spanner with O(n / 3/2 + g/2) non-crossing edges, or with O(n / + g/) edges that are allowed to cross. In particular, our spanners on surfaces have sparsity with linear dependence on g, rather than the easier-to-attain exponential dependence, and the terms n/3/2 and n/ match the current best Euclidean results for plane and crossing Steiner spanners, respectively. As a corollary of our non-crossing spanner and techniques from the existing literature on light spanners and minor-free TSP, we get an EPTAS for TSP on hyperbolic surfaces. Our surface constructions rely on the thick-thin decomposition, a standard tool for studying hyperbolic surfaces. For convex hyperbolic polygons, we introduce an analogous neck decomposition. We give algorithms that compute the thick-thin decomposition of a genus-g surface in O(g4 g) time and the neck decomposition of an n-vertex polygon in O(n) time.
Create a lesson
Related papers
Numerical Simulation of Transdermal Insulin Delivery Using a Coated Microneedle in a 2D Skin Model
Milana Tesfamarian, Michael Heisig, Gabriel Wittum et al.
Multi-Stage NeRF for Efficient 3D Coronary Artery Reconstruction from Two Narrow-Angle Angiographic Projections
Deyu Meng, Mojtaba Lashgari, Yiying Wang et al.
Perfectly Guarding Straits: Exact Algorithms for Weak Visibility Polygons
Shouvik Mondal, Udvas Das, Sasanka Roy
Low-Dimensional Embeddings for Gaussian Kernels on Manifolds
Soumik Dutta, Kunal Dutta
Flip Graphs for Eight Points in Three Dimensions Are Connected
Marc Khoury
Computing the minimal perimeter polygon for digital objects in the triangular tiling
Petra Wiederhold