Journals in DBLP

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

1. Jindong Chen, Yijie Han
   Shortest paths on a polyhedron. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:127-144 [Journal]
   
2. Peter Eades, Xuemin Lin, Roberto Tamassia
   An Algorithm for Drawing a Hierarchical Graph. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:145-156 [Journal]
   
3. Robert Joan-Arinyo, Alvar Vinacua, Pere Brunet
   Classification of a point with respect to a polyhedron vertex. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:157-168 [Journal]
   
4. Rex A. Dwyer, William F. Eddy
   Maximal empty ellipsoids. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:169-186 [Journal]
   
5. A. Chubarev
   Robust set operations on polyhedral solids: a fixed precision approach. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:187-204 [Journal]
   
6. Sven Schuierer
   An optimal data structure for shortest rectilinear path queries in a simple rectilinear polygon. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:205-226 [Journal]
   
7. B. Guo
   On the difficulty of deciding the convexity of polynomials over simplexes. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:227-230 [Journal]
   
8. Omer Berkman, Baruch Schieber, Uzi Vishkin
   A fast parallel algorithm for finding the convex hull of a sorted point set. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:231-242 [Journal]
   
9. Joseph O'Rourke
   Computational geometry column 28. [Citation Graph (0, 0)][DBLP]
   Int. J. Comput. Geometry Appl., 1996, v:6, n:2, pp:243-244 [Journal]