Christiane Schmidt

We present AutoNomos - a decentralized traffic information system - which is well suited for the evaluation of such a data dissemination protocol. Expand

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

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

We present an application of Integer Programming to the design of arrival routes for aircraft in a Terminal Maneuvering Area (TMA). Expand

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

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

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

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

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

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