Some new bounds for Epsilon-nets
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
How to net a lot with little: small &egr;-nets for disks and halfspaces
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Quasi-optimal upper bounds for simplex range searching and new zone theorems
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Intersection queries for curved objects (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Space-efficient ray-shooting and intersection searching: algorithms, dynamization, and applications
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
How hard is halfspace range searching?
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Range searching with efficient hierarchical cuttings
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Computational geometry: a retrospective
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
ACM Computing Surveys (CSUR)
Proceedings of the eleventh annual symposium on Computational geometry
Stabbing triangulations by lines in 3D
Proceedings of the eleventh annual symposium on Computational geometry
Time-series similarity problems and well-separated geometric sets
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Fast Range Searching with Delaunay Triangulations
Geoinformatica
Efficient Image Retrieval through Vantage Objects
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
Time-series similarity problems and well-separated geometric sets
Nordic Journal of Computing
Cutting triangular cycles of lines in space
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Range counting over multidimensional data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Tight bounds for connecting sites across barriers
Proceedings of the twenty-second annual symposium on Computational geometry
Deterministic sampling and range counting in geometric data streams
ACM Transactions on Algorithms (TALG)
On approximate halfspace range counting and relative epsilon-approximations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Proceedings of the twenty-sixth annual symposium on Computational geometry
Tight lower bounds for halfspace range searching
Proceedings of the twenty-sixth annual symposium on Computational geometry
Improved points approximation algorithms based on simplicial thickness data structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Comparing distributions and shapes using the kernel distance
Proceedings of the twenty-seventh annual symposium on Computational geometry
On rectilinear partitions with minimum stabbing number
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Orthogonal subdivisions with low stabbing numbers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Optimal private halfspace counting via discrepancy
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Disjoint edges in complete topological graphs
Proceedings of the twenty-eighth annual symposium on Computational geometry
A simple framework for the generalized nearest neighbor problem
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Cuttings for disks and axis-aligned rectangles
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Absolute approximation of Tukey depth: Theory and experiments
Computational Geometry: Theory and Applications
Range counting coresets for uncertain data
Proceedings of the twenty-ninth annual symposium on Computational geometry
Topological graphs: empty triangles and disjoint matchings
Proceedings of the twenty-ninth annual symposium on Computational geometry
Computational Geometry: Theory and Applications
Hi-index | 0.00 |