35 search results - page 6 / 7 » cccg 2009 |
CCCG
2009
13 years 6 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...
CCCG
2009
13 years 6 months ago
2009
All known examples of generic 3D bar-and-joint frameworks where the distance between a non-edge pair is implied by the edges in the graph contain a rigid vertexinduced subgraph. I...
CCCG
2009
13 years 6 months ago
2009
In this paper we study the problem of computing an upward straight-line embedding of a directed graph G into a point set S, i.e. a planar drawing of G such that each vertex is map...
CCCG
2009
13 years 3 months ago
2009
We study the 1-center problem with outliers in highdimensional data streams. The problem definition is as follows: given a sequence of n points in d dimensions (with d arbitrarily...
CCCG
2009
13 years 6 months ago
2009
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...