233 search results - page 38 / 47 » cccg 2007 |
CCCG
1994
13 years 8 months ago
1994
We consider bounding the cardinality of an arbitrary triangulation with smallest angle : We show that if the local feature size (i.e. distance between disjoint vertices or edges) ...
CCCG
2009
13 years 7 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 7 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...
CCCG
2009
13 years 7 months ago
2009
Given a set of blue points and a set of red points in ddimensional space, we show how to find an axis-aligned hyperrectangle that contains no red points and as many blue points as...
CCCG
2009
13 years 7 months ago
2009
We model the problem of detecting intruders using a set of infrared beams by the perimeter defense problem: given a polygon P, find a minimum set of edges S of the polygon such th...