Advertisement

Incremental hive graph

  • Fabrizio d'Amore
  • Roberto Giaccio
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1017)

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.

Keywords

Line Segment Range Query Vertical Edge Horizontal Edge Query Answering 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    B. Chazelle. Filtering search: a new approach to query-answering. SIAM J. Comput., 15:703–724, 1986.CrossRefGoogle Scholar
  2. 2.
    B. Chazelle and H. Edelsbrunner. Linear space data structures for two types of range search. Discrete Comput. Geom., 2:113–126, 1987.Google Scholar
  3. 3.
    S. W. Cheng and R. Janardan. New results on dynamic planar point location. SIAM J. Comput., 21:972–999, 1992.Google Scholar
  4. 4.
    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.Google Scholar
  5. 5.
    Y.-T. Lai and S. M. Leinwand. A theory of rectangular dual graphs. Algorithmica, 5:467–483, 1990.Google Scholar
  6. 6.
    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.MathSciNetGoogle Scholar
  7. 7.
    D. Mullis. Reporting overlaps in a dynamic interval set by filtering search. In Proc. 4th Canad. Conf. Comput. Geom., pages 160–169, 1992.Google Scholar
  8. 8.
    F. P. Preparata and R. Tamassia. Dynamic planar point location with optimal query time. Theoret. Comput. Sci., 74:95–114, 1990.Google Scholar
  9. 9.
    H. Samet. The Design and Analysis of Spatial Data Structures. Addison-Wesley, Reading, MA, 1990.Google Scholar
  10. 10.
    N. Sarnak and E. Tarjan. Planar point location using persistent search trees. CACM, 29(7):669–679, July 1986.Google Scholar
  11. 11.
    R. Tamassia. An incremental reconstruction method for dynamic planar point location. Inform. Process. Lett., 37:79–83, 1991.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    P. van Emde Boas. Preserving order in a forest in less than logarithmic time and linear space. Inform. Process. Lett., 6:80–82, 1977.Google Scholar
  14. 14.
    D. E. Willard. Log-logarithmic worst case range queries are possible in space O(n). Inform. Process. Lett., 17:81–89, 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Fabrizio d'Amore
    • 1
  • Roberto Giaccio
    • 1
  1. 1.Dipartimento di Informatica e SistemisticaUniversità di Roma “La Sapienza”;RomaItaly

Personalised recommendations