Optimal parallel algorithms for point-set and polygon problems Richard ColeMichael T. Goodrich OriginalPaper Pages: 3 - 23
Parallel computational geometry of rectangles Sharat ChandranSung Kwon KimDavid M. Mount OriginalPaper Pages: 25 - 49
Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers Ed CohenRuss MillerQuentin F. Stout OriginalPaper Pages: 51 - 75
Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers Jorge L. C. SanzRobert Cypher OriginalPaper Pages: 77 - 89
Optimal randomized parallel algorithms for computational geometry John H. ReifSandeep Sen OriginalPaper Pages: 91 - 117
A proof of the Gilbert-Pollak conjecture on the Steiner ratio D. -Z. DuF. K. Hwang OriginalPaper Pages: 121 - 135
Graham's problem on shortest networks for points on a circle J. H. RubinsteinD. A. Thomas OriginalPaper Pages: 193 - 218
Improved computation of plane Steiner Minimal Trees E. J. CockayneD. E. Hewgill OriginalPaper Pages: 219 - 229
Steiner minimal trees for a class of zigzag lines R. S. BoothJ. F. Weng OriginalPaper Pages: 231 - 246
A linear-time algorithm to construct a rectilinear Steiner minimal tree fork-extremal point sets D. S. RichardsJ. S. Salowe OriginalPaper Pages: 247 - 276
The rectilinear steiner arborescence problem Sailesh K. RaoP. SadayappanPeter W. Shor OriginalPaper Pages: 277 - 288
Two new criteria for finding Steiner hulls in Steiner tree problems J. Scott Provan OriginalPaper Pages: 289 - 302
Path-distance heuristics for the Steiner problem in undirected networks Pawel WinterJ. MacGregor Smith OriginalPaper Pages: 309 - 327
A paradigm for robust geometric algorithms John E. HopcroftPeter J. Kahn OriginalPaper Pages: 339 - 380
Randomized incremental construction of Delaunay and Voronoi diagrams Leonidas J. GuibasDonald E. KnuthMicha Sharir OriginalPaper Pages: 381 - 413
Three priority queue applications revisited Andrew M. Liao Application Experience Section Pages: 415 - 427
Maintaining bridge-connected and biconnected components on-line Jeffery WestbrookRobert E. Tarjan OriginalPaper Pages: 433 - 464
Forests, frames, and games: Algorithms for matroid sums and applications Harold N. GabowHerbert H. Westermann OriginalPaper Pages: 465 - 497
A fast algorithm for the generalized parametric minimum cut problem and applications Dan GusfieldCharles Martel OriginalPaper Pages: 499 - 519
Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families Richard B. BorieR. Gary ParkerCraig A. Tovey OriginalPaper Pages: 555 - 581
A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graph Hiroshi NagamochiToshihide Ibaraki OriginalPaper Pages: 583 - 596
Expected parallel time and sequential space complexity of graph and digraph problems John ReifPaul Spirakis OriginalPaper Pages: 597 - 630
Efficient parallel algorithms for path problems in directed graphs Joan M. LucasMarian Gunsher Sackrowitz OriginalPaper Pages: 631 - 648
