Empirical Design of Geometric Algorithms

Karsten Weihe, Ulrik Brandes, Annegret Liebers, Matthias Müller-Hannemann, Dorothea Wagner, and Thomas Willhalm

Proceedings of the Fifteenth Annual ACM Symposium on Computational Geometry, June 13-16, 1999, Miami Beach, Florida, pp. 86-94

not available

not available

The computer-aided solution to algorithmic problems is becoming more and more important in various application domains. This is in particular true for computational geometry. For example, geometric problems naturally arise in image processing, computer graphics, and all kinds of computer-aided design, just to mention a few. Even more, the general tendency towards the application of visiual aids in virtually all fields of science, technology, and business raises many new, unexpected geometric challenges.

A sound mathematical treatment of these problems and a systematic computational study on the resulting algorithms are desirable. However, in practice, there are often obstacles to such an attempt. In this paper, we will systematically discuss our experiences with a few obstacles that occurred in four of our projects and significantly influenced our reasoning on algorithms in each of them.

The report may be requested from our secretary Gabriele Klink, email: klink@math.tu-berlin.de