94 search results - page 7 / 19 » On Shadows Of Intersecting Families |
JGT
2008
13 years 9 months ago
2008
Let C be a family of n compact connected sets in the plane, whose intersection graph G(C) has no complete bipartite subgraph with k vertices in each of its classes. Then G(C) has ...
VISUALIZATION
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper describes the adaptation and evaluation of existing nestedsurface visualization techniques for the problem of displaying intersecting surfaces. For this work, we collab...
CCCG
1998
13 years 11 months ago
1998
Let S be any family of n c-oriented polygons of the two-dimensional Euclidean plane E2 , i.e., bounded intersection of halfplanes whose normal directions of edges belong to a
EJC
2008
13 years 10 months ago
2008
Let be a triangle-free distance-regular graph with diameter d 3, valency k 3 and intersection number a2 = 0. Assume has an eigenvalue with multiplicity k. We show that if for ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...