![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Chapter
Gelsenkirchen: auf dem Weg zu einer nachhaltigen Bildungslandschaft
Gelsenkirchen ist eine Großstadt mit rund 260.000 Einwohnern. Im Zentrum des Ruhrgebiets gelegen, hat sie im Laufe der letzten 40 Jahre einen radikalen Strukturwandel durchlebt. Bis weit in die 1960er Jahre hi...
-
Chapter
Computing the Hausdorff Distance of Geometric Patterns and Shapes
A very natural distance measure for comparing shapes and patterns is the Hausdorff distance. In this article we develop algorithms for computing the Hausdorff distance in a very general case in which geometric...
-
Chapter and Conference Paper
Universal 3-Dimensional visibility representations for graphs
This paper studies 3-dimensional visibility representations of graphs in which objects in 3-d correspond to vertices and vertical visibilities between these objects correspond to edges. We ask which classes of...
-
Chapter and Conference Paper
On the difficulty of embedding planar graphs with inaccuracies
In this paper it will be shown that the following problem is NP-hard. We are given a labeled planar graph, each vertex of which is assigned to a disc in the plane. Decide whether it is possible to embed the gr...
-
Chapter and Conference Paper
A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms
The often explored problem to approximate a given polygonal chain has been considered from a computational geometric point of view only for a short time. To model it reasonably we give a natural definition of ...