Freie Universität Berlin, Fachbereich Mathematik und Informatik : Ser. B, Informatik ; 00,10
004 Data processing and Computer science
The design phase of an algorithm’s implementation is confronted with the issues of efficiency,
flexibility, and ease-of-use. In this paper, we suggest a concept that greatly increases the flexibility
of an implementation without sacrificing its ease-of-use. The loss in terms of efficiency
We demonstrate the advantages of our concept at a C++ implementation of a simple rectangleintersection
algorithm, which follows the well-known sweep-line paradigm. We lead the reader
from a naive interface in a step-by-step guide to an interface offering full flexibility. The gain
in flexibility can reduce implementation effort by facilitating code reusage. Reusability in turn
helps to achieve correctness since more users mean more testing.
Though most of the ingredients of our concept have already been suggested elsewhere, to our
knowledge this is the first time that they are applied vigorously in a geometric setting.
We include a thorough experimental analysis on random and real world data that arouse in the
context of map labeling.
If your browser can't open the file, please download the file first and then open it