Skip to main content
SpringerLink
Log in

Planar Graph Blocking for External Searching

  • Published:
Algorithmica Aims and scope Submit manuscript

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.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Delhi, Hauz Khas, New Delhi-110016, India. sbaswana@cse.iitd.ernet.in, ssen@cse.iitd.ernet.in., IN

    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

Rights and permissions

Reprints and permissions

About this article

Cite this article

Surender Baswana, Sandeep Sen Planar Graph Blocking for External Searching . Algorithmica 34, 298–308 (2002). https://doi.org/10.1007/s00453-002-0969-2

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-002-0969-2

Search

Navigation