TITLE:
Similarity Under Translation
SPEAKER:
Omrit Filtser, Applied Math & Statistics, Stony Brook University
TIME & LOCATION:
11am, Friday (Jan 31), NCS 120
ABSTRACT:
Determining the similarity between two geometric objects in a metric space, and, in general, determining the value of some measure defined for two geometric objects, is a well investigated problem in computational geometry. Sometimes, however, the answer that is obtained is meaningless, unless one of the objects undergoes some transformation before performing the computation. In this talk, I will discuss several problems in which the goal is to compute a translation which minimizes some bipartite measure between two sets of points or two curves (sequences of points). For example, for two sets of points we consider the bipartite diameter, which is the distance between the farthest bichromatic pair, that is the maximum distance between a point from one set and a point from the other set. Such a distance measure may not be meaningful if the sets are far apart, and by translating one of them we can obtain a value that will better reflect their similarity.
This talk is based on two papers:
- Bipartite diameter and other measures under translation. Boris Aronov, F., Matthew J. Katz, and Khadijeh Sheikhan.
- Algorithms for the discrete Fréchet distance under translation. F. and Matthew J. Katz.
SPEAKER BIO:
Omrit Filtser is a postdoc at Stony Brook University, hosted by Prof. Joseph S.B. Mitchell. Before coming to Stony Brook, she did her PhD at Ben-Gurion University of the Negev, under the supervision of Prof. Matthew (Matya) Katz. Her research interest is in theoretical computational geometry, focusing on trajectory analysis, similarity of curves, chain simplification, optimization problems, geometric data structures and algorithms.