Geometric Computing over Uncertain Data

Abstract

Geometric structures such as the convex hull, Delaunay triangulation, or minimum spanning tree (MST) are fundamental tools for reasoning about multidimensional data. What happens to these structures when the underlying data points are known with only partial certainty? For instance, what is the expected cost of the MST of a set of points, each known to be alive with some probability? Or, in a set of uncertain points, how likely is it that the closest pair is within distance L? This talk explores the effects of data uncertainty on the complexity of basic geometric problems.