35 search results - page 5 / 7 » cccg 2009 |
CCCG
2009
13 years 6 months ago
2009
There are many depth measures on point sets that yield centerpoint theorems. These theorems guarantee the existence of points of a specified depth, a kind of geometric median. How...
CCCG
2009
13 years 6 months ago
2009
Clarkson's algorithm is a two-staged randomized algorithm for solving linear programs, but it can also be applied to the more general LP-type problems which comprise a number...
CCCG
2009
13 years 6 months ago
2009
We present a method for extracting contours from digital images using techniques from computational geometry. Our approach is different from traditional pixelbased methods in imag...
CCCG
2009
13 years 6 months ago
2009
We study a maximum flow problem in a polygonal domain P: Determine the maximum number of disjoint "thick" paths (of specified width w) through P from a source edge to a ...
CCCG
2009
13 years 6 months ago
2009
A set of n points in the plane is a universal pointset for a given class of graphs, if any n-vertex graph in that class can be embedded in the plane so that vertices are mapped to...