Sciweavers

7 search results - page 1 / 2
» compgeom 1992
Sort
View
170
Voted
COMPGEOM
1992
ACM
15 years 11 months ago
An Upper Bound for Conforming Delaunay Triangulations
Herbert Edelsbrunner, Tiow Seng Tan
164
Voted
COMPGEOM
1992
ACM
15 years 11 months ago
New Sparseness Results on Graph Spanners
Barun Chandra, Gautam Das, Giri Narasimhan, Jos&ea...
162
Voted
COMPGEOM
1992
ACM
15 years 11 months ago
A Rational Rotation Method for Robust Geometric Algorithms
John F. Canny, Bruce Randall Donald, Eugene K. Res...
COMPGEOM
1992
ACM
15 years 11 months ago
Piercing Convex Sets
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)...
Noga Alon, Daniel J. Kleitman
197
Voted
COMPGEOM
1992
ACM
15 years 11 months ago
A Subexponential Bound for Linear Programming
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 ...
Jirí Matousek, Micha Sharir, Emo Welzl