Seminar • Algorithms and Complexity • Geometric Distances for Curves and Graphs: From Matching to Simplification

Please note: This seminar will take place in DC 1304 and online.

Carola Wenk, Professor
School of Science and Engineering, Tulane University

Discrete geometric shapes lie at the core of many applications and have enjoyed thorough theoretical treatment in computational geometry. This talk will focus on continuous one-dimensional shapes, in particular curves and embedded graphs, and on Fréchet-type distances for comparing them. We will discuss how to compute these distances efficiently, how to match shapes under transformations such as translations and rigid motions, and how global simplification can produce lower-complexity shapes while guaranteeing a bound on their distance to the original.

To attend this seminar in person, please go to DC 1304. You can also attend virtually on Zoom.