The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Comput. Geometry Appl.
1992, volume: 2, number: 3

  1. Matthew Dickerson, Robert L. (Scot) Drysdale III, Jörg-Rüdiger Sack
    Simple algorithms for enumerating interpoint distances and finding $k$ nearest neighbors. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:221-239 [Journal]
  2. Marshall W. Bern, David Eppstein
    Polynomial-size nonobtuse triangulation of polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:241-255 [Journal]
  3. Christian Icking, Rolf Klein
    The Two Guards Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:257-285 [Journal]
  4. Mark de Berg, Marc J. van Kreveld, Bengt J. Nilsson, Mark H. Overmars
    Shortest path queries in rectilinear worlds. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:287-309 [Journal]
  5. Yi-Jen Chiang, Roberto Tamassia
    Dynamization of the trapezoid method for planar point location in monotone subdivisions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:311-333 [Journal]
  6. Joseph O'Rourke
    Computational geometry column 16. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:335-339 [Journal]
  7. Kenneth L. Clarkson, Richard Cole, Robert Endre Tarjan
    Erratum: Randomized parallel algorithms for trapezoidal diagrams. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:341-343 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002