Sciweavers

14 search results - page 1 / 3
» Cardinality constrained combinatorial optimization: Complexi...
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 7 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
DCG
2008
118views more  DCG 2008»
13 years 5 months ago
General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties
Two-dimensional constrained Delaunay triangulations are geometric structures that are popular for interpolation and mesh generation because they respect the shapes of planar domai...
Jonathan Richard Shewchuk
CCCG
2008
13 years 6 months ago
Draining a Polygon - or - Rolling a Ball out of a Polygon
We introduce the problem of draining water (or balls representing water drops) out of a punctured polygon (or a polyhedron) by rotating the shape. For 2D polygons, we obtain combi...
Greg Aloupis, Jean Cardinal, Sébastien Coll...