Michiel Hagedoorn Papers on DiSC'04 Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size Publications Note: Links lead to the DBLP on the Web. Michiel Hagedoorn Michiel Hagedoorn: Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size. ICDT 2003 : 440-454 Michiel Hagedoorn, Mark H. Overmars , Remco C. Veltkamp : A New Visibility Partition for Affine Pattern Matching. DGCI 2000 : 358-370 Michiel Hagedoorn, Mark H. Overmars , Remco C. Veltkamp : A Robust Affine Invariant Similarity Measure Based on Visibility. EWCG 2000 : 112-116 Remco C. Veltkamp , Michiel Hagedoorn: Shape Similarity Measures, Properties and Constructions. VISUAL 2000 : 467-476 Michiel Hagedoorn, Remco C. Veltkamp : Measuring Resemblance of Complex Patterns. DGCI 1999 : 286-297 Michiel Hagedoorn, Remco C. Veltkamp : A Robust Affine Invariant Metric on Boundary Patterns. IJPRAI 13 (8): 1151-1164 (1999) Michiel Hagedoorn, Remco C. Veltkamp : A General Method for Partial Point Set Matching. Symposium on Computational Geometry 1997 : 406-408 1 [ 5 ] [ 6 ] 2 [ 1 ] [ 2 ] [ 3 ] [ 4 ] [ 5 ] [ 6 ] ©2005 Association for Computing Machinery