94 search results - page 4 / 19 » On Shadows Of Intersecting Families |
COMPGEOM
2010
ACM
13 years 12 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...
SMI
1999
IEEE
14 years 24 days ago
1999
IEEE
We present efficient and robust algorithms for intersecting a freeform surface with a ringed surface or a ruled surface. A ringed surface is given as a one-parameter family of cir...
BILDMED
2008
13 years 10 months ago
2008
Abstract. We present a method to improve the quality of common sinogram restoration algorithms, which are used for metal-artifact reduction in X-ray CT. The presented approach is b...
CSR
2007
Springer
14 years 2 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
COMBINATORICS
2004
13 years 8 months ago
2004
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...