Dipl.-Inform. Rainer Penninger

Office	University of Bonn Institute of Computer Science, Dept. I Room E.06 Friedrich-Ebert-Allee 144 D-53113 Bonn	Phone	+49 (228) 73 - 4342
		Fax	+49 (228) 73 - 4321
		Email	penninge@cs.uni-bonn.de
Office Hours	By appointment

Research

Computational Geometry
Fault-tolerant Algorithms
Visibility algorithms in the Plane

Publications

Journal publications

Darius Geiß, Rolf Klein, Rainer Penninger and Günter Rote. Optimally Solving a Transportation Problem Using Voronoi Diagrams. To appear in: COMPUTATIONAL GEOMETRY: Theory and Applications, special issue on EuroCG 2012.

Conference publications

Darius Geiß, Rolf Klein and Rainer Penninger. Optimally Solving a Transportation Problem Using Voronoi Diagrams. COCOON, Lecture Notes in Computer Science, Vol. 7434, pp. 264-274, Springer, 2012.

Darius Geiß, Rolf Klein and Rainer Penninger. Optimally solving a general transportation problem using Voronoi diagrams. 28th European Workshop on Computational Geometry, pp. 241-244, 2012.

Rolf Klein, Rainer Penninger, Christian Sohler and David P. Woodruff. Tolerant Algorithms. ESA, Lecture Notes in Computer Science, Vol. 6942, pp. 736-747, Springer, 2011.

Rainer Penninger, Elmar Langetepe and Jan Tulke. Computing the visibility area between two simple polygons in linear time. 26th European Workshop on Computational Geometry, pp. 237-240, 2010.