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
An optimal algorithm for intersecting line segments in the plane
Journal of the ACM (JACM)
A fast planar partition algorithm. I
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
Computational Geometry: Theory and Applications
GD'12 Proceedings of the 20th international conference on Graph Drawing
| Hi-index | 0.00 |
Let r and w be a fixed positive numbers, w