arXiv subjects

Rolf Klein

Publications and source records attributed to Rolf Klein.

12 recordsLinked to original sources

arXiv2022

The limit of $L_p$ Voronoi diagrams as $p \rightarrow 0$ is the bounding-box-area Voronoi diagram

We consider the Voronoi diagram of points in the real plane when the distance between two points $a$ and $b$ is given by $L_p(a-b)$ where $L_p((x,y)) = (|x|^p+|y|^p)^{1/p}.$ We prove that the Voronoi diagram has a limit as $p$ converges to zero from above or from below: it is the diagram that corresponds to the distance function $L_*((x,y)) = |xy|$. In this diagram, the bisector of two points in general position consists of a line and two branches of a hyperbola that split the plane into three faces per point. We propose to name $L_*$ as defined above the "geometric $L_0$ distance".

math.MG↗

arXiv2021

Hyperbolae are the locus of constant angle difference

Given two points A,B in the plane, the locus of all points P for which the angles at A and B in the triangle A,B,P have a constant sum is a circular arc, by Thales' theorem. We show that the difference of these angles is kept a constant by points P on a hyperbola (albeit with foci different from A and B). Whereas hyperbolae are well-known to maintain a constant difference between the distances to their foci, the above angle property seems not to be widely known. The question was motivated by recent work by Alegría et al. and De Berg et al. on Voronoi diagrams of turning rays.

cs.CG↗

arXiv2019

A New Model in Firefighting Theory

Continuous and discrete models for firefighting problems are well-studied in Theoretical Computer Science. We introduce a new, discrete, and more general framework based on a hexagonal cell graph to study firefighting problems in varied terrains. We present three different firefighting problems in the context of this model; for two of which, we provide efficient polynomial time algorithms and for the third, we show NP-completeness. We also discuss possible extensions of the model and their implications on the computational complexity.

cs.CG↗

arXiv2019

Geometric Firefighting in the Half-plane

In 2006, Alberto Bressan suggested the following problem. Suppose a circular fire spreads in the Euclidean plane at unit speed. The task is to build, in real time, barrier curves to contain the fire. At each time $t$ the total length of all barriers built so far must not exceed $t \cdot v$, where $v$ is a speed constant. How large a speed $v$ is needed? He proved that speed $v>2$ is sufficient, and that $v>1$ is necessary. This gap of $(1,2]$ is still open. The crucial question seems to be the following. {\em When trying to contain a fire, should one build, at maximum speed, the enclosing barrier, or does it make sense to spend some time on placing extra delaying barriers in the fire's way?} We study the situation where the fire must be contained in the upper $L_1$ half-plane by an infinite horizontal barrier to which vertical line segments may be attached as delaying barriers. Surprisingly, such delaying barriers are helpful when properly placed. We prove that speed $v=1.8772$ is sufficient, while $v >1.66$ is necessary.

cs.CG↗

arXiv2016

A Fire Fighter's Problem

Suppose that a circular fire spreads in the plane at unit speed. A single fire fighter can build a barrier at speed $v>1$. How large must $v$ be to ensure that the fire can be contained, and how should the fire fighter proceed? We contribute two results. First, we analyze the natural curve $\mbox{FF}_v$ that develops when the fighter keeps building, at speed $v$, a barrier along the boundary of the expanding fire. We prove that the behavior of this spiralling curve is governed by a complex function $(e^{w Z} - s \, Z)^{-1}$, where $w$ and $s$ are real functions of $v$. For $v>v_c=2.6144 \ldots$ all zeroes are complex conjugate pairs. If $ϕ$ denotes the complex argument of the conjugate pair nearest to the origin then, by residue calculus, the fire fighter needs $Θ( 1/ϕ)$ rounds before the fire is contained. As $v$ decreases towards $v_c$ these two zeroes merge into a real one, so that argument $ϕ$ goes to~0. Thus, curve $\mbox{FF}_v$ does not contain the fire if the fighter moves at speed $v=v_c$. (That speed $v>v_c$ is sufficient for containing the fire has been proposed before by Bressan et al. [7], who constructed a sequence of logarithmic spiral segments that stay strictly away from the fire.) Second, we show that any curve that visits the four coordinate half-axes in cyclic order, and in inreasing distances from the origin, needs speed $v>1.618\ldots$, the golden ratio, in order to contain the fire. Keywords: Motion Planning, Dynamic Environments, Spiralling strategies, Lower and upper bounds

cs.CG↗

arXiv2015

A local strategy for cleaning expanding cellular domains by simple robots

We present a strategy SEP for finite state machines tasked with cleaning a cellular environment in which a contamination spreads. Initially, the contaminated area is of height $h$ and width $w$. It may be bounded by four monotonic chains, and contain rectangular holes. The robot does not know the initial contamination, sensing only the eight cells in its neighborhood. It moves from cell to cell, $d$ times faster than the contamination spreads, and is able to clean its current cell. A speed of $d<\sqrt{2}(h+w)$ is in general not sufficient to contain the contamination. Our strategy SEP succeeds if $d \geq 3(h+w)$ holds. It ensures that the contaminated cells stay connected. Greedy strategies violating this principle need speed at least $d \geq 4(h+w)$; all bounds are up to small additive constants.

cs.DS↗

arXiv2012

A New Upper Bound for the VC-Dimension of Visibility Regions

In this paper we are proving the following fact. Let P be an arbitrary simple polygon, and let S be an arbitrary set of 15 points inside P. Then there exists a subset T of S that is not "visually discernible", that is, T is not equal to the intersection of S with the visibility region vis(v) of any point v in P. In other words, the VC-dimension d of visibility regions in a simple polygon cannot exceed 14. Since Valtr proved in 1998 that d \in [6,23] holds, no progress has been made on this bound. By epsilon-net theorems our reduction immediately implies a smaller upper bound to the number of guards needed to cover P.

cs.CG↗

arXiv2012

Optimally solving a transportation problem using Voronoi diagrams

We consider the following variant of the Monge-Kantorovich transportation problem. Let S be a finite set of point sites in d dimensions. A bounded set C in d-dimensional space is to be distributed among the sites p in S such that (i) each p receives a subset C_p of prescribed volume, and (ii) the average distance of all points of C from their respective sites p is minimized. In our model, volume is quantified by some measure, and the distance between a site p and a point z is given by a function d_p(z). Under quite liberal technical assumptions on C and on the functions d_p we show that a solution of minimum total cost can be obtained by intersecting with C the Voronoi diagram of the sites in S, based on the functions d_p with suitable additive weights. Moreover, this optimum partition is unique up to sets of measure zero. Unlike the deep analytic methods of classical transportation theory, our proof is based directly on geometric arguments.

math.MG↗

arXiv2010

Exploring Grid Polygons Online

We investigate the exploration problem of a short-sighted mobile robot moving in an unknown cellular room. To explore a cell, the robot must enter it. Once inside, the robot knows which of the 4 adjacent cells exist and which are boundary edges. The robot starts from a specified cell adjacent to the room's outer wall; it visits each cell, and returns to the start. Our interest is in a short exploration tour; that is, in keeping the number of multiple cell visits small. For abitrary environments containing no obstacles we provide a strategy producing tours of length S <= C + 1/2 E - 3, and for environments containing obstacles we provide a strategy, that is bound by S <= C + 1/2 E + 3H + WCW - 2, where C denotes the number of cells-the area-, E denotes the number of boundary edges-the perimeter-, and H is the number of obstacles, and WCW is a measure for the sinuosity of the given environment.

cs.CG↗

arXiv2006

The density of iterated crossing points and a gap result for triangulations of finite point sets

Consider a plane graph G, drawn with straight lines. For every pair a,b of vertices of G, we compare the shortest-path distance between a and b in G (with Euclidean edge lengths) to their actual distance in the plane. The worst-case ratio of these two values, for all pairs of points, is called the dilation of G. All finite plane graphs of dilation 1 have been classified. They are closely related to the following iterative procedure. For a given point set P in R^2, we connect every pair of points in P by a line segment and then add to P all those points where two such line segments cross. Repeating this process infinitely often, yields a limit point set P*. The main result of this paper is the following gap theorem: For any finite point set P in the plane for which the above P* is infinite, there exists a threshold t > 1 such that P is not contained in the vertex set of any finite plane graph of dilation at most t. We construct a concrete point set Q such that any planar graph that contains this set amongst its vertices must have a dilation larger than 1.0000047.

cs.CG↗

arXiv2005

On the geometric dilation of closed curves, graphs, and point sets

The detour between two points u and v (on edges or vertices) of an embedded planar graph whose edges are curves is the ratio between the shortest path in in the graph between u and v and their Euclidean distance. The maximum detour over all pairs of points is called the geometric dilation. Ebbers-Baumann, Gruene and Klein have shown that every finite point set is contained in a planar graph whose geometric dilation is at most 1.678, and some point sets require graphs with dilation at least pi/2 = 1.57... We prove a stronger lower bound of 1.00000000001*pi/2 by relating graphs with small dilation to a problem of packing and covering the plane by circular disks. The proof relies on halving pairs, pairs of points dividing a given closed curve C in two parts of equal length, and their minimum and maximum distances h and H. Additionally, we analyze curves of constant halving distance (h=H), examine the relation of h to other geometric quantities and prove some new dilation bounds.

math.MG↗

arXiv2004

Online Searching with an Autonomous Robot

We discuss online strategies for visibility-based searching for an object hidden behind a corner, using Kurt3D, a real autonomous mobile robot. This task is closely related to a number of well-studied problems. Our robot uses a three-dimensional laser scanner in a stop, scan, plan, go fashion for building a virtual three-dimensional environment. Besides planning trajectories and avoiding obstacles, Kurt3D is capable of identifying objects like a chair. We derive a practically useful and asymptotically optimal strategy that guarantees a competitive ratio of 2, which differs remarkably from the well-studied scenario without the need of stopping for surveying the environment. Our strategy is used by Kurt3D, documented in a separate video.

cs.RO↗