Derandomization in Computational Geometry (1996)

Cached

Download Links

by Jirí Matousek
Citations:17 - 1 self

Active Bibliography

94 Efficient algorithms for geometric optimization – Pankaj K. Agarwal, Micha Sharir - 1998
4 Bounded-Independence Derandomization of Geometric Partitioning with Applications to Parallel Fixed-Dimensional Linear Programming – Michael T. Goodrich , Edgar A. Ramos
4 Algorithmic techniques for geometric optimization – Pankaj K. Agarwal, Micha Sharir - 1995
2 Geometric Set Systems – Jirí Matousek - 1998
46 Geometric Range Searching – Jiri Matousek - 1994
78 Arrangements and Their Applications – Pankaj K. Agarwal, Micha Sharir - 1998
54 Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications – Pankaj K. Agarwal, Alon Efrat, Micha Sharir
2 Trends and Developments in Computational Geometry – M. de Berg, M. De Berg, Mark De Berg - 1995
60 Backwards Analysis of Randomized Geometric Algorithms – Raimund Seidel - 1992
3 Output-Sensitive Construction Of Convex Hulls – Timothy Moon-yew Chan - 1995
15 Optimal Partition Trees – Timothy M. Chan - 2010
8 Epsilon nets and union complexity – Kasturi Varadarajan - 2009
1 Near-Linear Approximation Algorithms for . . . – Pankaj K. Agarwal, Esther Ezra, Micha Sharir - 2009
Regions, Distances and Graphs – Sebastien Collette
9 Computational Geometry – D. T. Lee - 1996
3 New Lower Bounds for Halfspace Emptiness – Jeff Erickson - 1996
8 Lower Bounds for Fundamental Geometric Problems – Jeffrey Gordon Erickson - 1996
8 Linear Programming Queries Revisited – Edgar A. Ramos - 2000
103 Las Vegas algorithms for linear and integer programming when the dimension is small – Kenneth L. Clarkson - 1995