Login / Signup

Solving the Euclidean Bottleneck Matching Problem by k-Relative Neighborhood Graphs.

Maw-Shang ChangChuan Yi TangRichard C. T. Lee
Published in: Algorithmica (1992)
Keyphrases
  • neighborhood graph
  • euclidean distance
  • matching algorithm
  • manifold learning
  • image processing
  • similarity measure
  • multi dimensional
  • euclidean space
  • training set
  • data points
  • dimensionality reduction
  • shape matching