Baswana, Surender ; Sen, Sandeep (2000) Planar graph blocking for external searching Lecture Notes in Computer Science, 1974 . pp. 252-263. ISSN 0302-9743
Full text not available from this repository.
Official URL: http://www.springerlink.com/content/aten9lkq2we1w0...
Related URL: http://dx.doi.org/10.1007/3-540-44450-5_20
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer. |
| ID Code: | 90084 |
| Deposited On: | 04 May 2012 14:30 |
| Last Modified: | 04 May 2012 14:30 |
Repository Staff Only: item control page
