I/O-efficient algorithms for computing planar geometric spanners

Authors:
Anil Maheshwari;Michiel Smid;Norbert Zeh
Affiliations:
School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6;School of Computer Science, Carleton University, 1125 Colonel By Drive, Ottawa, ON, Canada K1S 5B6;Faculty of Computer Science, 6050 University Ave, Halifax, NS, Canada B3H 1W5
Venue:
Computational Geometry: Theory and Applications
Year:
2008

Citing 21
Cited 1

There is a planar graph almost as good as the complete graph

SCG '86 Proceedings of the second annual symposium on Computational geometry
Approximation algorithms for shortest path motion planning

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The input/output complexity of sorting and related problems

Communications of the ACM
A sparse graph almost as good as the complete graph on points in K dimensions

Discrete & Computational Geometry
A decomposition of multi-dimensional point-sets with applications to k-nearest-neighbors and n-body potential fields (preliminary version)

STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Classes of graphs which approximate the complete Euclidean graph

Discrete & Computational Geometry
A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields

Journal of the ACM (JACM)
Dealing with higher dimensions: the well-separated pair decomposition and its applications

Dealing with higher dimensions: the well-separated pair decomposition and its applications
Randomized external-memory algorithms for some geometric problems

Proceedings of the fourteenth annual symposium on Computational geometry
Algorithms for dynamic closest pair and n-body potential fields

Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
Faster algorithms for some geometric graph problems in higher dimensions

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
On showing lower bounds for external-memory computational geometry problems

External memory algorithms
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
An external memory data structure for shortest path queries

Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
External-Memory Algorithms for Processing Line Segments in Geographic Information Systems (Extended Abstract)

ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
Planar Spanners and Approximate Shortest Path Queries among Obstacles in the Plane

ESA '96 Proceedings of the Fourth Annual European Symposium on Algorithms
I/o-efficient algorithms for shortest path related problems

I/o-efficient algorithms for shortest path related problems
On external-memory MST, SSSP and multi-way planar graph separation

Journal of Algorithms
I/O-Efficient Well-Separated Pair Decomposition and Applications

Algorithmica
Geometric Spanner Networks

Geometric Spanner Networks
External data structures for shortest path queries on planar digraphs

ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation

A topological sorting algorithm for large graphs

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present I/O-efficient algorithms for computing planar Steiner spanners for point sets and sets of polygonal obstacles in the plane.