Voronoi diagrams and arrangements
Discrete & Computational Geometry
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Sharp upper and lower bounds on the length of general Davenport-Schinzel Sequences
Journal of Combinatorial Theory Series A
SIAM Journal on Computing
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Approximations and optimal geometric divide-and-conquer
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
A singly exponential stratification scheme for real semi-algebraic varieties and its applications
Theoretical Computer Science
Fast matching algorithms for points on a polygon
SIAM Journal on Computing
Computing a segment center for a planar point set
Journal of Algorithms
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Ray shooting and parametric search
SIAM Journal on Computing
Vertical decompositions for triangles in 3-space
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Constructing levels in arrangements and higher order Voronoi diagrams
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
The overlay of lower envelopes in three dimensions and its applications
Proceedings of the eleventh annual symposium on Computational geometry
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Linear and O(n log n) time minimum-cost matching algorithms for quasi-convex tours
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Two-Dimensional Voronoi Diagrams in the Lp-Metric
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
Fixed-dimensional linear programming queries made easy
Proceedings of the twelfth annual symposium on Computational geometry
Improvements on bottleneck matching and related problems using geometry
Proceedings of the twelfth annual symposium on Computational geometry
Efficient algorithms for geometric optimization
ACM Computing Surveys (CSUR)
Approximation algorithms for bipartite and non-bipartite matching in the plane
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Recent Developments in the Theory of Arrangements of Surfaces
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
A near-linear constant-factor approximation for euclidean bipartite matching?
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
A near linear time constant factor approximation for Euclidean bichromatic matching (cost)
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Boundary labeling: models and efficient algorithms for rectangular maps
GD'04 Proceedings of the 12th international conference on Graph Drawing
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
| Hi-index | 0.00 |