11 search results - page 1 / 3 » On the Union of Cylinders in Three Dimensions |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
COMPGEOM
2010
ACM
13 years 10 months ago
2010
ACM
Let P be a set of n points in R3 . The 2-center problem for P is to find two congruent balls of the minimum radius whose union covers P. We present two randomized algorithms for ...
COMGEO
2004
ACM
13 years 4 months ago
2004
ACM
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
ICRA
2006
IEEE
13 years 11 months ago
2006
IEEE
Abstract— This paper presents a novel methodology for detecting collisions of cylindrically shaped rigid bodies moving in three dimensions. This algorithm uses line geometry and ...