External Links

    Journal: Int. J. Comput. Geometry Appl.

    Volume 2, Issue 4

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

    Volume 2, Issue 3

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

    Volume 2, Issue 2

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

    Volume 2, Issue 1

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