• Publications
  • Influence
AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems
TLDR
We present AutoNomos - a decentralized traffic information system - which is well suited for the evaluation of such a data dissemination protocol. Expand
  • 63
  • 3
  • PDF
Exact solutions and bounds for general art gallery problems
TLDR
We present a primal-dual algorithm based on linear programming that provides lower bounds on the necessary number of guards in every step and—in case of convergence and integrality—ends with an optimal solution. Expand
  • 41
  • 3
  • PDF
Point guards and point clouds: solving general art gallery problems
TLDR
In this video, we illustrate how one of the classical areas of computational geometry has gained in practical relevance, which in turn gives rise to new, fascinating geometric problems. Expand
  • 25
  • 2
  • PDF
Automatic Design of Aircraft Arrival Routes with Limited Turning Angle
TLDR
We present an application of Integer Programming to the design of arrival routes for aircraft in a Terminal Maneuvering Area (TMA). Expand
  • 8
  • 2
  • PDF
Polygon exploration with time-discrete vision
TLDR
We give the first algorithmic results for this important optimization problem that combines stationary art gallery-type aspects with watchman-type issues in an online scenario: We demonstrate that even for orthoconvex polygons, a competitive strategy can be achieved only for limited aspect ratio A. Expand
  • 15
  • 1
  • PDF
Facets for Art Gallery Problems
TLDR
The Art Gallery Problem (AGP) asks for placing a minimum number of stationary guards in a polygonal region $$P$$P, such that all points in $$P$. Expand
  • 12
  • 1
  • PDF
The continuous 1.5D terrain guarding problem: Discretization, optimal solutions, and PTAS
TLDR
In the NP-hard continuous 1.5D Terrain Guarding Problem (TGP) we are given an $x$-monotone chain of line segments in $R^2$ (the terrain $T$), and ask for the minimum number of guards (located anywhere on $T) required to guard all of $T$. Expand
  • 19
  • 1
  • PDF
A PTAS for the Continuous 1.5D Terrain Guarding Problem
TLDR
In the continuous 1.5-dimensional terrain guarding problem we are given an x-monotone chain (the terrain T ) and ask for the minimum number of point guards (located anywhere on T ), such that all points of T are covered by at least one guard. Expand
  • 13
  • 1
  • PDF
Empowered by wireless communication: Distributed methods for self-organizing traffic collectives
TLDR
Self-organizing and distributed methods for maintaining and collecting data (using Hovering Data Clouds); adaptive data dissemination for traffic information systems; self-recognition of traffic jams. Expand
  • 11
  • 1
  • PDF
Distributed vision with smart pixels
TLDR
We study a problem related to computer vision: How can a field of sensors compute higher-level properties of observed objects deterministically in sublinear time, without accessing a central authority, using distributed protocols that are modeled after sweepline methods. Expand
  • 10
  • 1
  • PDF