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.
CITATION STYLE
Baswana, S., & Sen, S. (2000). Planar graph blocking for external searching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1974, pp. 252–263). Springer Verlag. https://doi.org/10.1007/3-540-44450-5_20
Mendeley helps you to discover research relevant for your work.