Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
On randomization in sequential and distributed algorithms
ACM Computing Surveys (CSUR)
Computing many faces in arrangements of lines and segments
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)
New lower bounds for Hopcroft's problem
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
Queries with segments in Voronoi diagrams
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Pseudo-line arrangements: duality, algorithms, and applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On Computing Connected Components of Line Segments
IEEE Transactions on Computers
Reporting intersecting pairs of convex polytopes in two and three dimensions
Computational Geometry: Theory and Applications
Reporting Intersecting Pairs of Polytopes in Two and Three Dimensions
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Approximation algorithms for projective clustering
Journal of Algorithms
Computing the visibility graph of points within a polygon
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Managing uncertainty in moving objects databases
ACM Transactions on Database Systems (TODS)
Data structures for maintaining set partitions
Random Structures & Algorithms
Reduction rules deliver efficient FPT-algorithms for covering points with lines
Journal of Experimental Algorithmics (JEA)
Planar bichromatic minimum spanning trees
Journal of Discrete Algorithms
Counting and representing intersections among triangles in three dimensions
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |