Skip to main content
SpringerLink
Log in

Planar Graph Blocking for External Searching

  • Conference paper
  • First Online:
FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1974))

  • 537 Accesses

Abstract

We present a new scheme for storing a planar graph in external memory so that any online path can be traversed in an I-O efficient way. Our storage scheme significantly improves the previous results for planar graphs with bounded face size. We also prove an upper bound on I-O efficiency of any storage scheme for well-shaped triangulated meshes. For these meshes, our storage scheme achieves optimal performance.

Work was supported in part by an Infosys PhD fellowship.

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

Access this chapter

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Pankaj K. Agarwal, Lars Arge, T.M. Murli, Kasturi R. Varadarajan, J.S. Vitter. I/O-efficient algorithms for contour-line extraction and planar graph blocking. 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.

    Google Scholar 

  2. G.N. Fredrickson. Fast algorithms for shortest paths in planar graphs, with applications. SIAM Journal of Computing, 16, pp. 1004–1022, 1987.

    Article  Google Scholar 

  3. M.T. Goodrich, M.H. Nodine and J.S. Vitter. Blocking for external graph searching. Algorithmica, 16, pp. 181–214, August 1996.

    Google Scholar 

  4. John Hershberger and Subhash Suri. A pedestrian approach to ray shooting: shoot a ray, take a walk. Journal of Algorithms, 18, pp. 403–432, 1995.

    Article  MATH  MathSciNet  Google Scholar 

  5. R.J. Lipton and R.E. Tarjan. A separator theorem for planar graphs. SIAM journal of Applied Math., 36, pp. 177–189, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  6. G. Miller. Balanced cyclic separator for 2-connected planar graphs. Journal of Computer and System Sciences, 32(3), pp. 265–279, 1986.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, I.I.T. Delhi, Hauz Khas, 110016, New Delhi, India

    Surender Baswana & Sandeep Sen

Authors
  1. Surender Baswana
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sandeep Sen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology, Delhi, Hauz Khas, 110016, New Delhi, India

    Sanjiv Kapoor  & Sanjiva Prasad  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baswana, S., Sen, S. (2000). Planar Graph Blocking for External Searching. In: Kapoor, S., Prasad, S. (eds) FST TCS 2000: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2000. Lecture Notes in Computer Science, vol 1974. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44450-5_20

Download citation

  • DOI: https://doi.org/10.1007/3-540-44450-5_20

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41413-1

  • Online ISBN: 978-3-540-44450-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation