Abstract
Our work is based on the pioneering work in sphere separators of Miller, Teng, Vavasis et al, [8, 12], who gave efficient static algorithms for finding sphere separators of size s(n)=O(nd−1/d) for a set of points in Rd.
We present randomized, dynamic algorithms to maintain separators and answer queries about a dynamically changing point set. Our algorithms maintain a separator in expected time O(log n) and maintain a separator tree in expected time O(log3 n). This is the first known polylog dynamic algorithm for finding separators of a large class of graphs known as overlap graphs [12], which include planar graphs and k-neighborhood graphs.
We also give a general technique for transforming a class of expected time randomized incremental algorithms that use random sampling into incremental algorithms with high likelihood time bounds. In particular, we show how we can maintain separators in time O(log3 n) with high likelihood.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Supported by NSP Grant NSF-IRI-91-00681
Supported by DARPA/ISTO Contracts N00014-88-K-0458, DARPA N00014-91-J-1985, N00014-91-C-0114, NASA subcontract 550-63 of prime contract NAS5-30428, US-Israel Binational NSF Grant 88-00282/2, and NSF Grant NSF-IRI-91-00681.
Preview
Unable to display preview. Download preview PDF.
References
Cole R, Goodrich MT. Optimal parallel algorithms for polygon and pointset problems. Department of computer science, 88–14, Johns Hopkins University, 1988.
Chiang Y, Tamassia R. Dynamic algorithms in computational geometry. Tech Report CS-91-24, Department of Computer Science, Brown University, 1991.
Frederickson G.. Planar graph decomposition and all pairs shortest paths. JACM 38:162–204, January 1991
Frieze A, Miller GM, Teng S-H. Separator based Parallel divide and conquer in computational geometry. Proceedings, Symposium on Parallel Algorithms and Architectures, 1992.
Gazit H, Miller GL A parallel algorithm for finding a separator in planar graphs. Proceedings, Twenty-Eighth Annual Symposium on Foundations of Computer Science 238–248, 1987.
Lipton RJ, Tarjan RE. A separator theorem for planar graphs. SIAM J of Appl Math, 36:177–189, April 1979.
Miller GL, Teng S-H, Thurston W, Vavasis SA. Automatic mesh partitioning. To appear, 1992.
Miller GL, Teng S-H, Vavasis SA. A unified geometric approach to graph separators. Proceedings, Thirty Second Annual Symposium on Foundations of Computer Science, 538–547, 1991.
Overmars M. The design of dynamic data structures. Lecture Notes in Computer Science, 156, 1983.
Pan V, Reif JH. Extension of the parallel nested dissection algorithm to path algebra problems. Proc Sixth Conference on Foundation of Software Technology and Theoretical Computer Science, New Delhi, India, Lecture Notes in Computer Science, vol. 241, Springer-Verlag, 1986; also full version as Fast and Efficient Solution of Path Algebra Problems. Journal of Computer and Systems Sciences 38:494–510, June 1989.
Pan V, Reif JH. Acceleration of minimum cost path calculations in graphs having small separator families. TR 1989.
Teng S-H. Points, spheres and separators: a unified geometric approach to graph partitioning. PhD thesis, Carnegie-Mellon University, School of Computer Science, 1991. CMU-CS-91-184
Vaidya PM. An O(n log n) algorithm for the all-nearest-neighbor problem. Discrete and Computational Geometry 4:101–105, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Armon, D., Reif, J. (1993). A dynamic separator algorithm. In: Dehne, F., Sack, JR., Santoro, N., Whitesides, S. (eds) Algorithms and Data Structures. WADS 1993. Lecture Notes in Computer Science, vol 709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57155-8_240
Download citation
DOI: https://doi.org/10.1007/3-540-57155-8_240
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57155-1
Online ISBN: 978-3-540-47918-5
eBook Packages: Springer Book Archive