104 search results - page 4 / 21 » Intersecting convex sets by rays |
CCCG
2007
13 years 11 months ago
2007
Let S be a set system of convex sets in Rd . Helly’s theorem states that if all sets in S have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has e...
JAIR
2006
13 years 9 months ago
2006
In this paper, we show that there is a close relation between consistency in a constraint network and set intersection. A proof schema is provided as a generic way to obtain consi...
GD
2009
Springer
14 years 26 days ago
2009
Springer
We show that recognizing intersection graphs of convex sets has the same complexity as deciding truth in the existential theory of the reals. Comparing this to similar results on t...
COMPGEOM
2001
ACM
14 years 1 months ago
2001
ACM
We consider segment intersection searching amidst (possibly intersecting) algebraic arcs in the plane. We show how to preprocess n arcs in time O(n2+ ) into a data structure of si...
ADCM
2007
13 years 9 months ago
2007
Motivated by the method for the reconstruction of 3D objects from a set of parallel cross sections, based on the binary operation between 2D sets termed “metric average”, we de...