Abstract
The hive graph is a rectangular graph satisfying some additional condition widely used in computational geometry for solving several kinds of fundamental queries. It has been introduced by Chazelle
In this paper we present an optimal algorithm for incrementally building a hive graph structure: while it retains the same performance in query answering, it also allows to incrementally insert new line segments with O(log n) worst case time per update. Our technique exploits a novel “eager”; approach.
Some other dynamic operations performable on our structure in optimal time, such as Purge and Backtrack, are described. Also, we discuss some applications of our results.
Work partially supported by the Italian National Projects MURST 40% “Efficienza di Algoritmi e Progetto di Strutture Informative”; and CNR “Ambienti e strumenti per la gestione di informazioni temporali.”;
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Chazelle. Filtering search: a new approach to query-answering. SIAM J. Comput., 15:703–724, 1986.
B. Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom., 2:113–126, 1987.
S. W. Cheng and R. Janardan. New results on dynamic planar point location. SIAM J. Comput., 21:972–999, 1992.
Y.-J. Chiang and R. Tamassia. Dynamization of the trapezoid method for planar point location. In Proc. 7th Annual ACM Symp. on Computational Geometry, pages 61–70, 1991.
Y.-T. Lai and S. M. Leinwand. A theory of rectangular dual graphs. Algorithmica, 5:467–483, 1990.
K. Mehlhorn and S. NÄher. Bounded ordered dictionaries in O(log log n) time and O(n) space. Inform. Process. Lett., 35:183–189, 1990.
D. Mullis. Reporting overlaps in a dynamic interval set by filtering search. In Proc. 4th Canad. Conf. Comput. Geom., pages 160–169, 1992.
F. P. Preparata and R. Tamassia. Dynamic planar point location with optimal query time. Theoret. Comput. Sci., 74:95–114, 1990.
H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.
N. Sarnak and E. Tarjan. Planar point location using persistent search trees. CACM, 29(7):669–679, July 1986.
R. Tamassia. An incremental reconstruction method for dynamic planar point location. Inform. Process. Lett., 37:79–83, 1991.
A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors. Temporal Databases: Theory, Design, and Implementation. Database Systems and Applications Series. Benjamin/Cummings, Redwood City, CA, 1993.
P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett., 6:80–82, 1977.
D. E. Willard. Log-logarithmic worst case range queries are possible in space O(n). Inform. Process. Lett., 17:81–89, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
d'Amore, F., Giaccio, R. (1995). Incremental hive graph. In: Nagl, M. (eds) Graph-Theoretic Concepts in Computer Science. WG 1995. Lecture Notes in Computer Science, vol 1017. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60618-1_65
Download citation
DOI: https://doi.org/10.1007/3-540-60618-1_65
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60618-5
Online ISBN: 978-3-540-48487-5
eBook Packages: Springer Book Archive