Geometric partitioning made easier, even in parallel
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An expander-based approach to geometric optimization
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
A deterministic algorithm for the three-dimensional diameter problem
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Almost optimal set covers in finite VC-dimension: (preliminary version)
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Efficient algorithms for generalized intersection searching on non-iso-oriented objects
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)
Stabbing triangulations by lines in 3D
Proceedings of the eleventh annual symposium on Computational geometry
Computing faces in segment and simplex arrangements
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
On computing Voronoi diagrams by divide-prune-and-conquer
Proceedings of the twelfth annual symposium on Computational geometry
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Construction of 1-d lower envelopes and applications
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Separating an object from its cast
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Space-time tradeoffs for emptiness queries (extended abstract)
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Efficient searching with linear constraints
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Geometric applications of a randomized optimization technique
Proceedings of the fourteenth annual symposium on Computational geometry
On enumerating and selecting distances
Proceedings of the fourteenth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On range reporting, ray shooting and k-level construction
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Ray shooting amidst convex polytopes in three dimensions
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fixed-dimensional parallel linear programming via relative &egr;-approximations
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
A practical approximation algorithm for the LMS line estimator
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Indexing moving points (extended abstract)
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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
Proceedings of the sixteenth annual symposium on Computational geometry
On the complexity of halfspace area queries
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Notes on computing peaks in k-levels and parametric spanning trees
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Point-line incidences in space
Proceedings of the eighteenth annual symposium on Computational geometry
Testing Homotopy for paths in the plane
Proceedings of the eighteenth annual symposium on Computational geometry
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Semi-online maintenance of geometric optima and measures
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
An Efficient Indexing Scheme for Multi-dimensional Moving Objects
ICDT '03 Proceedings of the 9th International Conference on Database Theory
Time Responsive External Data Structures for Moving Points
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Output-Sensitive Algorithms for Uniform Partitions of Points
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Image Retrieval through Vantage Objects
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
External Memory Data Structures
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
New constructions of weak epsilon-nets
Proceedings of the nineteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
Using simplicial partitions to determine a closest point to a query line
Pattern Recognition Letters
Journal of Computer and System Sciences - Special issue on PODS 2000
Computing homotopic shortest paths in the plane
Journal of Algorithms
Algorithms for center and Tverberg points
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Range counting over multidimensional data streams
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Towards in-place geometric algorithms and data structures
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Point–Line Incidences in Space
Combinatorics, Probability and Computing
Indexing mobile objects using dual transformations
The VLDB Journal — The International Journal on Very Large Data Bases
An Indexing Method for Answering Queries on Moving Objects
Distributed and Parallel Databases
The interface between computational and combinatorial geometry
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Ray shooting amid balls, farthest point from a line, and range emptiness searching
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Tight bounds for connecting sites across barriers
Proceedings of the twenty-second annual symposium on Computational geometry
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
A practical approximation algorithm for the LMS line estimator
Computational Statistics & Data Analysis
On approximate halfspace range counting and relative epsilon-approximations
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
More algorithms for all-pairs shortest paths in weighted graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
On bounded leg shortest paths problems
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
A (slightly) faster algorithm for klee's measure problem
Proceedings of the twenty-fourth annual symposium on Computational geometry
Efficient c-oriented range searching with DOP-trees
Computational Geometry: Theory and Applications
Optimal halfspace range reporting in three dimensions
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Dynamic ham-sandwich cuts in the plane
Computational Geometry: Theory and Applications
Geometric pattern matching for point sets in the plane under similarity transformations
Information Processing Letters
Computing minimum-area rectilinear convex hull and L-shape
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
A (slightly) faster algorithm for Klee's measure problem
Computational Geometry: Theory and Applications
Farthest-point queries with geometric and combinatorial constraints
Computational Geometry: Theory and Applications
Extremal point queries with lines and line segments and related problems
Computational Geometry: Theory and Applications
Algorithms for memory hierarchies: advanced lectures
Algorithms for memory hierarchies: advanced lectures
Computing a closest point to a query hyperplane in three and higher dimensions
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartIII
Maintaining extremal points and its applications to deciding optimal orientations
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Weak visibility of two objects in planar polygonal scenes
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
Proceedings of the twenty-sixth annual symposium on Computational geometry
Planar visibility: testing and counting
Proceedings of the twenty-sixth annual symposium on Computational geometry
Algorithms and theory of computation handbook
More Algorithms for All-Pairs Shortest Paths in Weighted Graphs
SIAM Journal on Computing
Approximate Halfspace Range Counting
SIAM Journal on Computing
Small-Size $\eps$-Nets for Axis-Parallel Rectangles and Boxes
SIAM Journal on Computing
Improved points approximation algorithms based on simplicial thickness data structures
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Three problems about dynamic convex hulls
Proceedings of the twenty-seventh annual symposium on Computational geometry
Visibility testing and counting
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
On rectilinear partitions with minimum stabbing number
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Querying simplexes in quasi-triangulation
Computer-Aided Design
Dynamic Connectivity: Connecting to Networks and Geometry
SIAM Journal on Computing
Semialgebraic Range Reporting and Emptiness Searching with Applications
SIAM Journal on Computing
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
Farthest-Point queries with geometric and combinatorial constraints
JCDCG'04 Proceedings of the 2004 Japanese conference on Discrete and Computational Geometry
Efficient c-oriented range searching with DOP-trees
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Orthogonal subdivisions with low stabbing numbers
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Polyline fitting of planar points under min-sum criteria
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Improved pointer machine and I/O lower bounds for simplex range reporting and related problems
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
A faster algorithm for computing motorcycle graphs
Proceedings of the twenty-ninth annual symposium on Computational geometry
Unions of onions: preprocessing imprecise points for fast onion layer decomposition
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |