104 search results - page 6 / 21 » Intersecting convex sets by rays |
111
Voted
COMPGEOM
1992
ACM
15 years 7 months ago
1992
ACM
A family of sets has the (p, q) property if among any p members of the family some q have a nonempty intersection. It is shown that for every p q d + 1 there is a c = c(p, q, d)...
145
Voted
IV
2009
IEEE
15 years 10 months ago
2009
IEEE
Many data sets are visualized effectively with area proportional Venn diagrams, where the area of the regions is in proportion to a defined specification. In particular, Venn diag...
122
Voted
COMPGEOM
1994
ACM
15 years 7 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...
140
Voted
DAGSTUHL
2003
15 years 5 months ago
2003
In this paper we discuss reliable methods in the field of finite precision geometry. We begin with a brief survey of geometric computing and approaches generally used in dealing ...
138
Voted
COMPGEOM
2010
ACM
15 years 7 months ago
2010
ACM
Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the memb...