167
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
143
Voted
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
139
click to vote
COMPGEOM
1992
ACM
15 years 10 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)...
199
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
152
click to vote
COMPGEOM
1994
ACM
15 years 10 months ago
1994
ACM
An interactive visualization of weighted three-dimensional -hulls is presented for static and dynamic spheres. The -hull is analytically computed and represented by a triangulated...
144
click to vote
COMPGEOM
1994
ACM
15 years 10 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...