Geometric pattern matching under Euclidean motion
type: Item
instance of: scholarly article
title: Geometric pattern matching under Euclidean motion
zbMATH Open document ID: 0869.68110
DOI: 10.1016/0925-7721(95)00047-X
author: L. Paul Chew
author: Michael T. Goodrich
author: Daniel P. Huttenlocher
author: Klara Kedem
author: Dina Kravets
author: Jon M. Kleinberg
published in: Computational Geometry
publication date: 1997-03-18T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 992695
zbMATH Keywords: model-based computer vision
zbMATH Keywords: minimum Hausdorff distance
MaRDI profile type: Publication
cites work: Q4763391
cites work: Congruence, similarity, and symmetries of geometric objects
cites work: Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms
cites work: Q3787492
cites work: Triangulating a simple polygon in linear time
cites work: Improvements on geometric pattern matching problems
cites work: Slowing down sorting networks to obtain faster sorting algorithms
cites work: Parallel Merge Sort
cites work: An Optimal-Time Algorithm for Slope Selection
cites work: Q3619797
cites work: Q3772828
cites work: Triangulating a simple polygon
cites work: The upper envelope of Voronoi surfaces and its applications
cites work: Applying Parallel Computation Algorithms in the Design of Serial Algorithms
cites work: Q3992847
cites work: Lower bounds for the complexity of the graph of the Hausdorff distance as a function of transformation
cites work: Q3707420
full work available at URL: 0925-7721(95)00047-x
OpenAlex ID: W2064597564
description: scientific article; zbMATH DE number 992695