The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Comput. Geometry Appl.
1995, volume: 5, number:

  1. Jean-Daniel Boissonnat, Olivier Devillers, LeonBattista Donati, Franco P. Preparata
    Motion planning of legged robots: the spider robot problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:3-20 [Journal]
  2. Michael B. Dillencourt, Warren D. Smith
    A linear-time algorithm for testing the inscribability of trivalent polyhedra. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:21-36 [Journal]
  3. Naoki Katoh, Kazuo Iwano
    Finding k farthest pairs and k closest/farthest bichromatic pairs for points in the plane. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:37-51 [Journal]
  4. Rolf Klein, Andrzej Lingas
    Manhattonian proximity in a simple polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:53-74 [Journal]
  5. Helmut Alt, Michael Godau
    Computing the Fréchet distance between two polygonal curves. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:75-91 [Journal]
  6. Danny Z. Chen
    An optimal parallel algorithm for detecting weak visibility of a simple polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:93-124 [Journal]
  7. Barun Chandra, Gautam Das, Giri Narasimhan, José Soares
    New sparseness results on graph spanners. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:125-144 [Journal]
  8. John Hershberger
    Optimal parallel algorithms for triangulated simple polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:145-170 [Journal]
  9. Marshall W. Bern, David P. Dobkin, David Eppstein
    Triangulating polygons without large angles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:171-192 [Journal]
  10. Steven Fortune
    Numerical stability of algorithms for 2-d Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:193-213 [Journal]
  11. Joseph O'Rourke
    Computational geometry column 25. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:215-218 [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