Partitioning arrangements of lines I: An efficient deterministic algorithm
- First Online:
In this paper we consider the following problem: Given a set ℒ ofn lines in the plane, partition the plane intoO(r2) triangles so that no triangle meets more thanO(n/r) lines of ℒ. We present a deterministic algorithm for this problem withO(nr logn/r) running time, whereω is a constant <3.33.
Unable to display preview. Download preview PDF.
- [AKS]M. Ajtai, J. Komlos, and E. Szemerédi, Sorting inc logn parallel steps,Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983, pp. 1–9.Google Scholar
- [B]K. E. Batcher, Sorting networks and their applications,Proceedings of the AFIPS Spring Joint Summer Computer Conference, vol. 32 (1968), pp. 307–314.Google Scholar
- [CF]B. Chazelle and J. Friedman, A deterministic view of random sampling and its use in geometry,Proceedings of the 29th Annual IEEE Symposium on Foundations of Computer Science, 1988, pp. 539–549.Google Scholar
- [Cl1]K. Clarkson, A probabilistic algorithm for the post office problem,Proceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 75–84.Google Scholar
- [Cl3]K. Clarkson, Applications of random sampling in computational geometry, II,Proceedings of the 4th Annual Symposium on Computational Geometry, 1988, pp. 1–11.Google Scholar
- [CS]K. Clarkson and P. Shor, Algorithms for diametric pairs and convex hulls that are optimal, randomized and incremental,Proceedings of the 4th Annual Symposium on Computational Geometry, 1988, pp. 12–17.Google Scholar
- [Co]R. Cole, Slowing down sorting networks to obtain faster sorting algorithms,Journal of the Association for Computing Machinery 31 (1984), 200–208.Google Scholar
- [GOS]L. Guibas, M. Overmars, and M. Sharir, Ray shooting, implicit point location, and related queries in arrangements of segments, Technical Report 433, Dept. Computer Science, New York University, March 1989.Google Scholar
- [Ma]J. Matoušek, Construction ofɛ-nets,Discrete and Computational Geometry, this issue, 427–448.Google Scholar
- [RS1]J. Reif and S. Sen, Optimal randomized parallel algorithms for computational geometry,Proceedings of the 16th International Conference on Parallel Processing, 1987, pp. 270–277.Google Scholar
- [RS2]J. Reif and S. Sen, Polling: A new randomized sampling technique for computational geometry,Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989, pp. 394–404.Google Scholar
- [Wo]G. Woeginger, Epsilon-nets for half planes, Technical Report B-88-02, Dept. of Mathematics, Free University, Berlin, March 1988.Google Scholar