Christian Knauer
Christian Knauer
Institut für Informatik, Universität Bayreuth
Verified email at - Homepage
Cited by
Cited by
Fréchet distance for curves, revisited
B Aronov, S Har-Peled, C Knauer, Y Wang, C Wenk
Algorithms–ESA 2006: 14th Annual European Symposium, Zurich, Switzerland …, 2006
Comparison of distance measures for planar curves
H Alt, C Knauer, C Wenk
Algorithmica 38, 45-58, 2004
Minimum-cost coverage of point sets by disks
H Alt, EM Arkin, H Brönnimann, J Erickson, SP Fekete, C Knauer, ...
Proceedings of the twenty-second annual symposium on Computational geometry …, 2006
Matching polygonal curves with respect to the Fréchet distance
H Alt, C Knauer, C Wenk
STACS 2001: 18th Annual Symposium on Theoretical Aspects of Computer Science …, 2001
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
Algorithms–ESA 2004: 12th Annual European Symposium, Bergen, Norway …, 2004
Computing the Hausdorff distance of geometric patterns and shapes
H Alt, P Braß, M Godau, C Knauer, C Wenk
Discrete and computational geometry: The goodman-pollack festschrift, 65-76, 2003
Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
PK Agarwal, R Klein, C Knauer, S Langerman, P Morin, M Sharir, M Soss
Discrete & Computational Geometry 39 (1), 17-37, 2008
On counting point-hyperplane incidences
P Braß, C Knauer
Computational Geometry 25 (1-2), 13-20, 2003
Matching point sets with respect to the Earth Mover's Distance
S Cabello, P Giannopoulos, C Knauer, G Rote
Computational Geometry 39 (2), 118-133, 2008
Bounds on the quality of the PCA bounding boxes
D Dimitrov, C Knauer, K Kriegel, G Rote
Computational Geometry 42 (8), 772-789, 2009
On the number of cycles in planar graphs
K Buchin, C Knauer, K Kriegel, A Schulz, R Seidel
Computing and Combinatorics: 13th Annual International Conference, COCOON …, 2007
Testing the congruence of d-dimensional point sets
P Brass, C Knauer
Proceedings of the sixteenth annual symposium on Computational geometry, 310-314, 2000
Dilation and detours in geometric networks
J Gudmundsson, C Knauer
Handbook of Approximation Algorithms and Metaheuristics, 53-69, 2018
Computing the discrete Fréchet distance with imprecise input
HK Ahn, C Knauer, M Scherfenberg, L Schlipf, A Vigneron
International Journal of Computational Geometry & Applications 22 (01), 27-44, 2012
How difficult is it to walk the dog
K Buchin, M Buchin, C Knauer, G Rote, C Wenk
Proc. 23rd Euro. Workshop on Comput. Geom, 170-173, 2007
Morphometric relationships between tooth and face shapes
HB Lindemann, C Knauer, P Pfeiffer
Journal of Oral rehabilitation 31 (10), 972-978, 2004
Side scan sonar image resolution and automatic object detection, classification and identification
F Langner, C Knauer, W Jans, A Ebert
OCEANS 2009-EUROPE, 1-8, 2009
Largest inscribed rectangles in convex polygons
C Knauer, L Schlipf, JM Schmidt, HR Tiwary
Journal of discrete algorithms 13, 78-85, 2012
Algorithms for graphs of bounded treewidth via orthogonal range searching
S Cabello, C Knauer
Computational Geometry 42 (9), 815-824, 2009
The directed Hausdorff distance between imprecise point sets
C Knauer, M Löffler, M Scherfenberg, T Wolle
Theoretical Computer Science 412 (32), 4173-4186, 2011
The system can't perform the operation now. Try again later.
Articles 1–20