|
How Difficult is it to Walk the Dog?
Kevin Buchin, Maike Buchin, Christian Knauer, Günter Rote, Carola Wenk
Small Manhattan Networks and Algorithmic Applications for the Earth Mover's Distance
Joachim Gudmundsson, Oliver Klein, Christian Knauer, Michiel Smid
Applying graphics hardware to achieve extremely fast geometric
pattern matching in low dimensional transformation space
Dror Aiger, Klara Kedem
Computing Geodesic Disks in a Simple Polygon
Magdalene G. Borgelt, Marc van Krevelt, Jun Luo
Generalized Source Shortest Paths on Polyhedral Surfaces
Marta Fort, J. Antoni Sellarès
Improved algorithms for length-minimal one-sided boundary labeling
Marc Benkert, Martin Nöllenburg
|