Header menu link for other important links
Planar graph blocking for external searching
S. Baswana,
Published in Springer New York
Volume: 34
Issue: 3
Pages: 298 - 308
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.
About the journal
Published in Springer New York
Open Access
Impact factor