Abstract
Given a set of point P ∈ ℝ2, we consider the well-known maxima problem, consisting of reporting the maxima (not dominated) points of P, in the dynamic setting of boundary updates. In this setting we allow insertions and deletions of points at the extremities of P: this permits to move a resizable vertical window on the point set.
We present a data structure capable of answering maxima queries in optimal O(k) worst case time, where k is the size of the answer. Moreover we show how to maintain the data structure under boundary updates operation in O(log n) time per update.
This is the first technique in a dynamic setting capable of both performing update operations and answering maxima queries in optimal worst case time.
Work partially supported by EU ESPRIT LTR Project ALCOM-IT under contract no. 20244, and by the Italian MURST National Project “Efficienza di Algoritmi e Progetto di Strutture Informative.”
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
F. d'Amore and R. Giaccio. Simplified hive-graphs with boundary updates. Technical report, Univ. “La Sapienza,” Roma, 1996. Submitted.
G. Frederickson and S. Rodger. A new approach to the dynamic maintenance of maximal points in a plane. Discrete Comput. Geom., 5:365–374, 1990.
R. H. Güting, O. Nurmi, and T. Ottmann. Fast algorithms for direct enclosures and direct dominances. J. Algorithms, 10:170–186, 1989.
L. J. Guibas and R. Sedgewick. A dichromatic framework for balanced trees. In Proc. 19th Annu. IEEE Sympos. Found. Comput. Sci., Lecture Notes in Computer Science, pages 8–21, 1978.
R. Janardan. On the dynamic maintenance of maximal points in the plane. Inform. Process. Lett., 40:59–64, 1991.
S. Kapoor. Dynamic maintenance of maximas of 2-d point sets. In Proc. 10th Annu. ACM Sympos. Comput. Geom., pages 140–149, 1994.
M. H. Overmars and J. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166–204, 1981.
M. H. Overmars and D. Wood. On rectangular visibility. J. Algorithms, 9:372–390, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
d'Amore, F., Franciosa, P.G., Giaccio, R., Talamo, M. (1997). Maintaining maxima under boundary updates. In: Bongiovanni, G., Bovet, D.P., Di Battista, G. (eds) Algorithms and Complexity. CIAC 1997. Lecture Notes in Computer Science, vol 1203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62592-5_64
Download citation
DOI: https://doi.org/10.1007/3-540-62592-5_64
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62592-6
Online ISBN: 978-3-540-68323-0
eBook Packages: Springer Book Archive