The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Comput. Geometry Appl.
1996, volume: 6, number: 1

  1. Jean-Daniel Boissonnat, André Cérézo, Olivier Devillers, Monique Teillaud
    Output-sensitive construction of the {Delaunay} triangulation of points lying in two planes. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:1-14 [Journal]
  2. Paul J. Heffernan
    An optimal algorithm for the two-guard problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:15-44 [Journal]
  3. A. Corbalan, M. L. Mazón, Tomás Recio
    Geometry of bisectors for strictly convex distances. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:45-58 [Journal]
  4. W. S. Chan, F. Chin
    Approximation of Polygonal Curves with Minimum Number of Line Segments or Minimum error. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:59-77 [Journal]
  5. Reuven Bar-Yehuda, E. Ben-Hanoch
    A linear time algorithm for covering simple polygons with similar rectangles. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:79-102 [Journal]
  6. C. Gitlin, Joseph O'Rourke, V. Subramanian
    On reconstructing polyhedra from parallel slices. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:103-122 [Journal]
  7. Joseph O'Rourke
    Computational geometry column 27. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:1, pp:123-125 [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