SCG '90 Proceedings of the sixth annual symposium on Computational geometry
The upper envelope of Voronoi surfaces and its applications
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Arrangements of segments that share endpoints: single face results
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Triangulation and CSG representation of polyhedra with arbitrary genus
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Computing a face in an arrangement of line segments
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Tail estimates for the space complexity of randomized incremental algorithms
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Incidence and nearest-neighbor problems for lines in 3-space
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
SCG '92 Proceedings of the eighth annual symposium on Computational geometry
On lines missing polyhedral sets in 3-space
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
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
Geometric lower bounds for parametric matroid optimization
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
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
Shattering a set of objects in 2D
Discrete Applied Mathematics
Efficient Regular Data Structures and Algorithms for Location and Proximity Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On a class of O(n2) problems in computational geometry
Computational Geometry: Theory and Applications
Improved bound for the union of fat triangles
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
| Hi-index | 0.00 |