Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Frontiers in Algorithmics

FAW 2009: Frontiers in Algorithmics pp 141–152Cite as

Processing an Offline Insertion-Query Sequence with Applications

  • Conference paper

  • 958 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5598))

Abstract

In this paper, we present techniques and algorithms for processing an offline sequence of insertion and query operations and for related problems. Most problems we consider are solved optimally in linear time by our algorithms, which are based on a new geometric modeling and interesting techniques. We also discuss some applications to which our algorithms and techniques can be applied to yield efficient solutions.

This research was supported in part by NSF under Grant CCF-0515203.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K.: Ray shooting and other applications of spanning trees with low stabbing number. In: Proc. of the 5th Annual Symposium on Computational Geometry, pp. 315–325 (1989)

    Google Scholar 

  2. Agarwal, P.K., Matoušek, J.: Ray shooting and parametric search. SIAM Journal on Computing 22(4), 794–806 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  3. Agarwal, P.K., Sharir, M.: Applications of a new partitioning scheme. In: Proc. of the 2nd Workshop on Algorithms and Data Structures, pp. 379–392 (1991)

    Google Scholar 

  4. Aho, A.V., Hopcroft, J.E., Ullman, J.D.: The Design and Analysis of Computer Algorithms, ch. 4, pp. 139–141. Addison-Wesley, Massachusetts (1974)

    MATH  Google Scholar 

  5. Arkin, E.M., Hurtado, F., Mitchell, J.S.B., Seara, C., Skiena, S.S.: Some lower bounds on geometric separability problems. International Journal of Computational Geometry and Applications 16(1), 1–26 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Chazelle, B., Guibas, L.: Visibility and intersection problems in plane geometry. Discrete Comput. Geom. 4, 551–589 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  7. Chen, M., Li, J., Li, J., Li, W., Wang, L.: Some approximation algorithms for the clique partition problem in weighted interval graphs. Theoretical Computer Science 381, 124–133 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

  9. de Berg, M., Halperin, D., Overmars, M., Snoeyink, J., van Kreveld, M.: Efficient ray shooting and hidden surface removal. In: Proc. of the 7th Annual Symposium on Computational Geometry, pp. 21–30 (1991)

    Google Scholar 

  10. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry – Algorithms and Applications, 1st edn. Springer, Berlin (1997)

    MATH  Google Scholar 

  11. Gabow, H.N., Tarjan, R.E.: A linear-time algorithm for a special case of disjoint set union. Journal of Computer and System Sciences 30, 209–221 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  12. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, New York (1980)

    MATH  Google Scholar 

  13. Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear time algorithms for visibility and shortest path problems inside simple polygons. In: Proc. of the 2nd Annual Symposium on Computational Geometry, pp. 1–13 (1986)

    Google Scholar 

  14. Lee, D.T., Wu, Y.F.: Geometric complexity of some location problems. Algorithmica 1, 193–211 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  15. Ramanan, P.: Obtaining lower bounds using artificial components. Information Processing Letters 24(4), 243–246 (1987)

    Article  MathSciNet  MATH  Google Scholar 

  16. Tarjan, R.E.: Efficiency of a good but not linear set union algorithm. Journal of the ACM 22(2), 215–225 (1975)

    Article  MathSciNet  MATH  Google Scholar 

  17. van Emde Boas, P.: Preserving order in a forest in less than logarithmic time and linear space. Information Processing Letters 6(3), 80–82 (1977)

    Article  MATH  Google Scholar 

  18. van Emde Boas, P., Kaas, R., Zijlstra, E.: Design and implementation of an efficient priority queue. Math. Systems Theory 10, 99–127 (1977)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA

    Danny Z. Chen & Haitao Wang

Authors
  1. Danny Z. Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Haitao Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science,, City University of Hong Kong, No. 83 Tat Chee Avenue, Kowloon Tong, Hong Kong, China

    Xiaotie Deng

  2. Computer Science Department, Cornell University, 5144 Upson Hall, NY 14853, Ithaca, USA

    John E. Hopcroft

  3. Provincial Key Laboratory of High-Performance Computing, Jiangxi Normal University, 330027, Nanchang, China

    Jinyun Xue

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, D.Z., Wang, H. (2009). Processing an Offline Insertion-Query Sequence with Applications . In: Deng, X., Hopcroft, J.E., Xue, J. (eds) Frontiers in Algorithmics. FAW 2009. Lecture Notes in Computer Science, vol 5598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02270-8_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02270-8_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02269-2

  • Online ISBN: 978-3-642-02270-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation