Christian Knauer
Christian Knauer
Institut für Informatik, Universität Bayreuth
Bestätigte E-Mail-Adresse bei - Startseite
TitelZitiert vonJahr
Comparison of distance measures for planar curves
H Alt, C Knauer, C Wenk
Algorithmica 38 (1), 45-58, 2004
Matching polygonal curves with respect to the Fréchet distance
H Alt, C Knauer, C Wenk
Annual Symposium on Theoretical Aspects of Computer Science, 63-74, 2001
Fréchet distance for curves, revisited
B Aronov, S Har-Peled, C Knauer, Y Wang, C Wenk
European Symposium on Algorithms, 52-63, 2006
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
Faster fixed-parameter tractable algorithms for matching and packing problems
MR Fellows, C Knauer, N Nishimura, P Ragde, F Rosamond, U Stege, ...
European Symposium on Algorithms, 311-322, 2004
Computing the Hausdorff distance of geometric patterns and shapes
H Alt, P Braß, M Godau, C Knauer, C Wenk
Discrete and computational geometry, 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-3), 17-37, 2008
On the number of cycles in planar graphs
K Buchin, C Knauer, K Kriegel, A Schulz, R Seidel
International Computing and Combinatorics Conference, 97-107, 2007
On counting point-hyperplane incidences
P Brass, C Knauer
Computational Geometry 25 (1-2), 13-20, 2003
Testing the congruence of d-dimensional point sets
P Braß, C Knauer
Proceedings of the sixteenth annual symposium on Computational geometry, 310-314, 2000
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
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
Dilation and detour in geometric networks
J Gudmundsson, C Knauer
Handbook on approximation algorithms and metaheuristics 52, 2018
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
Bounds on the quality of the PCA bounding boxes
D Dimitrov, C Knauer, K Kriegel, G Rote
Computational Geometry 42 (8), 772-789, 2009
Small Manhattan networks and algorithmic applications for the earth mover’s distance
J Gudmundsson, O Klein, C Knauer, M Smid
Proceedings of the 23rd European Workshop on Computational Geometry, 174-177, 2007
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
Parameterized complexity of geometric problems
P Giannopoulos, C Knauer, S Whitesides
The Computer Journal 51 (3), 372-384, 2008
On the complexity of the linkage reconfiguration problem
H Alt, C Knauer, G Rote, S Whitesides
Contemporary Mathematics 342, 1-14, 2004
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20