Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Cutting cylces of rods in space
Proceedings of the fourteenth annual symposium on Computational geometry
Constructing approximate shortest path maps in three dimensions
Proceedings of the fourteenth annual symposium on Computational geometry
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Linear programming queries revisited
Proceedings of the sixteenth annual symposium on Computational geometry
Deterministic algorithms for 3-D diameter and some 2-D lower envelopes
Proceedings of the sixteenth annual symposium on Computational geometry
Parallel Convex Hull Computation by Generalised Regular Sampling
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Deterministic sampling and range counting in geometric data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Deterministic sampling and range counting in geometric data streams
ACM Transactions on Algorithms (TALG)
Small-size ε-nets for axis-parallel rectangles and boxes
Proceedings of the forty-first annual ACM symposium on Theory of computing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
A unified framework for approximating and clustering data
Proceedings of the forty-third annual ACM symposium on Theory of computing
Data reduction for weighted and outlier-resistant clustering
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Towards faster linear-sized nets for axis-aligned boxes in the plane
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Covering many or few points with unit disks
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Range counting coresets for uncertain data
Proceedings of the twenty-ninth annual symposium on Computational geometry
A note on searching line arrangements and applications
Information Processing Letters
| Hi-index | 0.00 |