Planar Graph Blocking for External Searching

Authors:
Surender Baswana;Sandeep Sen
Affiliations:
-;-
Venue:
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Year:
2000

Citing 4
Cited 0

Finding small simple cycle separators for 2-connected planar graphs

Journal of Computer and System Sciences
Fast algorithms for shortest paths in planar graphs, with applications

SIAM Journal on Computing
A pedestrian approach to ray shooting: shoot a ray, take a walk

SODA '93 Selected papers from the fourth annual ACM SIAM symposium on Discrete algorithms
I/O-efficient algorithms for contour-line extraction and planar graph blocking

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms

Quantified Score

Hi-index	0.00

Visualization

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.