Planar Graph Blocking for External Searching

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. Key Words. External, Graph, Mesh, Planar, Searching.

• Type: Conference
• Year: 2000
• Where: FSTTCS
• Authors: Surender Baswana, Sandeep Sen
• Keywords: FSTTCS 2000, I-O Efficient Way, Planar Graphs, Software Engineering, Storage Scheme