International Journal of Computational Geometry and Applications, Volume 2

Volume 2, Number 1, 1992

Michael B. Dillencourt, David M. Mount, Nathan S. Netanyahu: A randomized algorithm for slope selection. 1-27 BibTeX
Kokichi Sugihara: Voronoi diagrams in a river. 29-48 BibTeX
Jeffrey S. Salowe: Enumerating interdistances in space. 49-59 BibTeX
C. D. Yang, D. T. Lee, C. K. Wong: On bends and lengths of rectilinear paths: a graph theoretic approach. 61-74 BibTeX
Tamal K. Dey, Chandrajit L. Bajaj, Kokichi Sugihara: On good triangulations in three dimensions. 75-95 BibTeX
Olivier Devillers: Randomization yields simple O(n log^* n) algorithms for difficult Omega(n) problems. 97-111 BibTeX

Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan: Randomized parallel algorithms for trapezoidal diagrams. 117-133 BibTeX
Fang-Rong Hsu, R. C. Chang, Richard C. T. Lee: Parallel algorithms for computing the closest visible vertex pair between two polygons. 135-162 BibTeX
Nancy M. Amato, Franco P. Preparata: The parallel 3D convex hull problem revisited. 163-173 BibTeX
S. Guha: Parallel computation of internal and external farthest neighbours in simple polygons. 175-190 BibTeX
Sharat Chandran, David M. Mount: A parallel algorithm for enclosed and enclosing triangles. 191-214 BibTeX
Joseph O'Rourke: Computational geometry column 15. 215-217 BibTeX

Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack: Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. 221-239 BibTeX
Marshall W. Bern, David Eppstein: Polynomial-size nonobtuse triangulation of polygons. 241-255 BibTeX
Christian Icking, Rolf Klein: The Two Guards Problem. 257-285 BibTeX
Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars: Shortest path queries in rectilinear worlds. 287-309 BibTeX
Yi-Jen Chiang, Roberto Tamassia: Dynamization of the trapezoid method for planar point location in monotone subdivisions. 311-333 BibTeX
Joseph O'Rourke: Computational geometry column 16. 335-339 BibTeX
Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan: Erratum: Randomized parallel algorithms for trapezoidal diagrams. 341-343 BibTeX

Collette R. Coullard, Anna Lubiw: Distance visibility graphs. 349-362 BibTeX
Franz Aurenhammer, Otfried Schwarzkopf: A simple on-line randomized incremental algorithm for computing higher order Voronoi diagrams. 363-381 BibTeX
Gordon T. Wilfong: Nearest neighbor problems. 383-416 BibTeX
Binay K. Bhattacharya, Jirel Czyzowicz, Peter Egyed, Godfried T. Toussaint, Ivan Stojmenovic, Jorge Urrutia: Computing shortest transversals of sets. 417-442 BibTeX
Joseph O'Rourke: Computational geometry column 17. 443-447 BibTeX
Marshall W. Bern, David Eppstein: Erratum: Polynomial-size nonobtuse triangulation of polygons. 449-450 BibTeX