On levels in arrangements and voronoi diagrams
- 106 Downloads
This paper gives efficient, randomized algorithms for the following problems: (1) construction of levels of order 1 tok in an arrangement of hyperplanes in any dimension and (2) construction of higher-order Voronoi diagrams of order 1 tok in any dimension. A new combinatorial tool in the form of a mathematical series, called a θ series, is associated with an arrangement of hyperplanes inR d . It is used to study the combinatorial as well as algorithmic complexity of the geometric problems under consideration.
Unable to display preview. Download preview PDF.
- 1.A. Agarwal, L. Guibas, S. Saxe, P. Shor, A linear time algorithm for computing the Voronoi diagram of a convex polygon,Proceedings of the Annual ACM Symposium on Theory of Computing, 1987, pp. 39–45.Google Scholar
- 4.B. Chazelle, H. Edelsbrunner, An improved algorithm for constructingk-th order Voronoi diagram,Proceedings of the Annual Symposium on Computational Geometry, 1985, pp. 228–234.Google Scholar
- 7.K. Clarkson, Applications of random sampling in computational geometry, II,Proceedings of the Annual Symposium on Computational Geometry, 1988, pp. 1–11.Google Scholar
- 8.K. Clarkson, P. Shor, Algorithms for diametral pairs and convex hulls that are optimal randomized, and incremental,Proceedings of the Annual Symposium on Computational Geometry, 1988, pp. 12–17.Google Scholar
- 9.R. Cole, M. Sharir, C. Yap, Onk-hulls and related problems,Proceedings of the 16th Annual SIGACT Symposium, 1984, pp. 154–166.Google Scholar
- 11.H. Edelsbrunner, Private communication.Google Scholar
- 14.P. Erdös, L. Lovász, A. Simmons, E. Strauss, Dissection graphs of planar point sets, inA Survey of Combinatorial Theory, J. N. Srivastava,et al., eds., North-Holland, Amsterdam, 1973, pp. 139–149.Google Scholar
- 18.K. Mulmuley, A fast planar partition algorithm, I,Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988, pp. 580–589. Full version to appear inJ. Symbolic Logic, a special issue on Computational Geometry.Google Scholar
- 19.K. Mulmuley, A fast planar partition algorithm, II,Proceedings of the Fifth ACM Annual Symposium on Computational Geometry, 1989, pp. 33–43. To appear inJ. Assoc. Comput. Mach.Google Scholar
- 21.K. Mulmuley, An efficient algorithm for hidden surface removal, II, Technical Report, University of Chicago, August 1989, Invited for publication inJ. Algorithms. (Also see On obstructions in relation to a fixed viewpoint,Proceedings of the 30th Annual Symposium on Foundations of Computer Science, 1989, pp. 592–597.)Google Scholar