Reporting and counting segment intersections
Journal of Computer and System Sciences
On k-hulls and related problems
SIAM Journal on Computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
The complexity of many cells in arrangements of planes and related problems
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Implicitly representing arrangements of lines or segments
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Partitioning arrangements of lines, part II: applications
Discrete & Computational Geometry
Oriented projective geometry
Computing and verifying depth orders
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Can visibility graphs be represented compactly?
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Cutting hyperplanes for divide-and-conquer
Discrete & Computational Geometry
Lower bounds for off-line range searching
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bounds for off-line range searching
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
| Hi-index | 0.00 |