1. V. Akman: Unobstructed shortest paths in polyhedral environments. Lecture Notes in Computer Science, vol. 251, 1987
2. H. Böhm: Berechnung von Polynomnullstellen und Auswertung arithmetischer Ausdrücke mit garantierter maximaler Genauigkeit. PhD Thesis, Karlsruhe, December 1983.
3. G.B. Beretta: An implementation of a plane sweep—algorithm on a personal computer. Dr.—Dissertation, Eidgenössische Technische Hochschule Zürich, 1984.
4. J.L. Bentley, Th. Ottmann: Algorithms for reporting and counting geometric intersecitons. IEEE Transactions on Computers, 28, p. 643–647, 1979.
5. G. Bohlender, L.B. Rall, Ch. Ullrich, J. Wolff von Gudenberg: PASCAL—SC: A Computer Language for Scientific Computation, Academic Press (Perspectives in Computing, vol. 17), Orlando, 1987.