Planar graph blocking for external searching

Algorithmica (New York)

Volumn 34, Issue 3, 2002, Pages 298-308

  Baswana, Surender ^a   Sen, Sandeep ^a  

^a INDIAN INSTITUTE OF TECHNOLOGY DELHI   (India)

Author keywords

External; Graph; Mesh; Planar; Searching

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; GRAPH THEORY; PROBLEM SOLVING;

PLANAR GRAPH;

COMPUTATIONAL GEOMETRY;

EID: 0141957150     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-002-0969-2     Document Type: Article

References (6)

1. P.K. Agarwal, L. Arge, T.M. Murli, K.R. Varadarajan, and J.S. Vitter, I/O-efficient algorithms for contourline extraction and planar graph blocking, Proceedings of the Ninth ACM-SIAM Symposium on Discrete Algorithms, 1998, pp. 117-126.
2. G.N. Fredrickson, Fast algorithms for shortest paths in planar graphs, with applications, SIAM Journal of Computing, 16 (1987), 1004-1022.
3. M.T. Goodrich, M.H. Nodine, and J.S. Vitter, Blocking for external graph searching, Algorithmica, 16(2) (August 1996), 181-214.
4. J. Hershberger and S. Suri, A pedestrian approach to ray shooting: shoot a ray, take a walk, Journal of Algorithms, 18 (1995), 403-432.
5. R.J. Lipton and R.E. Tarjan, A separator theorem for planar graphs. SIAM Journal of Applied Mathematics, 36 (1979), 177-189.
6. G. Miller, Balanced cyclic separator for 2-connected planar graphs, Journal of Computer and System Sciences, 32 (1986), 265-279.