Javascript must be enabled

# Pankaj K. Agarwal : Union of geometric objects, epsilon-nets, and hitting sets

The combinatorial complexity of the union of a set of geometric objects is the total number of faces of all dimensions that lie on the boundary of the union. We review some recent results on the complexity of the union of geometric objects in 2d and 3D satisfying various natural conditions and on computing the union. We then discuss the critical roles they play in computing an epsilon net and a hitting set of a set system.

**Category**: Geometry and Topology**Duration**: 01:34:46**Date**: February 3, 2009 at 4:25 PM**Views**: 122-
**Tags:**seminar, Geometry/topology Seminar

## 0 Comments