Michiel Hagedoorn

According to our database, Michiel Hagedoorn authored at least 9 papers between 1997 and 2003.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2003

Nearest Neighbors Can Be Found Efficiently If the Dimension Is Small Relative to the Input Size.

Michiel Hagedoorn

Proceedings of the Database Theory, 2003

2001

State of the Art in Shape Matching.

Remco C. Veltkamp, Michiel Hagedoorn

Proceedings of the Principles of Visual Information Retrieval, 2001

2000

Shape Similarity Measures, Properties and Constructions.

Remco C. Veltkamp, Michiel Hagedoorn

Proceedings of the Advances in Visual Information Systems, 4th International Conference, 2000

A Robust Affine Invariant Similarity Measure Based on Visibility.

Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp

EuroCG, 2000

A New Visibility Partition for Affine Pattern Matching.

Michiel Hagedoorn, Mark H. Overmars, Remco C. Veltkamp

Proceedings of the Discrete Geometry for Computer Imagery, 9th International Conference, 2000

1999

A Robust Affine Invariant Metric on Boundary Patterns.

Michiel Hagedoorn, Remco C. Veltkamp

Int. J. Pattern Recognit. Artif. Intell., 1999

Reliable and Efficient Pattern Matching Using an Affine Invariant Metric.

Michiel Hagedoorn, Remco C. Veltkamp

Int. J. Comput. Vis., 1999

Measuring Resemblance of Complex Patterns.

Michiel Hagedoorn, Remco C. Veltkamp

Proceedings of the Discrete Geometry for Computer Imagery, 1999

1997

A General Method for Partial Point Set Matching.

Michiel Hagedoorn, Remco C. Veltkamp

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997