Abstract:

A basic problem in classifying, or searching for similar objects in, a large set of geometric  objects is computing similarity between two objects. This has led to extensive work on computing geometric similarity between two objects. This talk discusses some old and some new geometric algorithms for computing similarity between two point sets, with an emphasis on transportation and Frechet distance. The talk will also touch upon a few open problems in this area.