We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
Chandra Chekuri, Kenneth L. Clarkson, Sariel Har-P...
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
We report on a generic uni- and bivariate algebraic kernel that is publicly available with Cgal 3.7. It comprises complete, correct, though efficient state-of-the-art implementati...
A D-polyhedron is a polyhedron P such that if x, y are in P then so are their componentwise max and min. In other words, the point set of a D-polyhedron forms a distributive latti...
We introduce a framework for the construction, maintenance, and manipulation of arrangements of curves embedded on certain two-dimensional orientable parametric surfaces in three-d...
Eric Berberich, Efi Fogel, Dan Halperin, Kurt Mehl...