Publications
In recent times digital cameras have become affordable, leading to the desire to use digital cameras for text detection too. The pictures recorded by a camera usually have a resolution too low for classical OCR-applications. Also they can be rotated, perspective distorted and lie on a curved surface.
Presented is an algorithm for planning the motion of a robot moving on a rectangular field with obstacles. The positions of every obstacle and the robot are known. Searched is the first intermediate point on a path leading to a given endpoint.
Exact Computation is necessary since the computer has only finite memory to represent a number while number by their nature can have infinite precision.
In many visual medical diagnostic systems two dimensional slices of pictures of the human nody are produced. These usually constist of a large amount of data. From the sliced two dimensional data the surface of internal organs can be reconstructed by using Delauny Triangulation. The topic had to be presented to students of biological computer science in German.
Nice drawing of graphs is no simple problem. If the graph is a tree several algorithms for a nice outcome by certain paradigms can be used. Walkers Algorithmn offers a nice, horizontal aproach for any kind of tree. Trees can also be drawed radially. Binary trees can be drawed in a left to right facion using only horizoontal and vertical edges. In this seminary talk several algorithms have been compared in German.