3778 search results - page 3 / 756 » Erdos-Ko-Rado for three sets |
COMPGEOM
2011
ACM
13 years 2 months ago
2011
ACM
We present three results related to dynamic convex hulls: • A fully dynamic data structure for maintaining a set of n points in the plane so that we can find the edges of the c...
INFOCOM
2009
IEEE
14 years 5 months ago
2009
IEEE
—In this paper, we study the problem of constructing full-coverage three dimensional networks with multiple connectivity. We design a set of patterns for full coverage and two re...
COMPGEOM
2004
ACM
14 years 4 months ago
2004
ACM
Let B be a set of n unit balls in R3 . We show that the combinatorial complexity of the space of lines in R3 that avoid all the balls of B is O(n3+ε ), for any ε > 0. This re...
CEC
2008
IEEE
14 years 5 months ago
2008
IEEE
— In the early days a policy was a set of simple rules with a clear intuitive motivation that could be formalised to good effect. However the world is now much more complex. Subt...
GD
2004
Springer
14 years 4 months ago
2004
Springer
We consider the following graph embedding question: given a graph G, is it possible to map its vertices to points in 3D such that G is isomorphic to the mutual nearest neighbor gra...