Geometry/topology Seminar
Tuesday, February 3, 2009, 4:30pm, 119 Physics
Pankaj K. Agarwal (Duke)
Union of geometric objects, epsilon-nets, and hitting sets
Abstract:- 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. [video]
Generated at 8:46am Thursday, April 25, 2024 by Mcal. Top
* Reload
* Login