ausblenden:
Schlagwörter:
-
Zusammenfassung:
Writing a program for computing the Voronoi diagram of line segments
is a complex task. Not only there is an abundance of geometric cases
that have to be considered, but the problem is also numerically
difficult. Therefore it is very easy to make subtle programming errors.
In this paper we present a procedure that for a given set of sites $S$
and a candidate graph $G$ rigorously checks that $G$ is the correct
Voronoi diagram of line segments for $S$. Our procedure is particularly
efficient and simple to implement.
