Journals in DBLP

Comput. Geom.
1991, volume: 1, number:

1. David Avis, Paul Erdös, János Pach
   Distinct Distances Determined By Subsets of a Point Set in Space. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:1-11 [Journal]
   
2. Mark de Berg
   On Rectilinear Link Distance. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:13-34 [Journal]
   
3. Mark H. Overmars, Micha Sharir
   Merging Visibility Maps. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:35-49 [Journal]
   
4. Raimund Seidel
   A Simple and Fast Incremental Randomized Algorithm for Computing Trapezoidal Decompositions and for Triangulating Polygons. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:51-64 [Journal]
   
5. Pankaj K. Agarwal, Micha Sharir
   Off-line Dynamic Maintenance of the Width of a Planar Point Set. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:65-78 [Journal]
   
6. Mikhail J. Atallah, Danny Z. Chen
   Parallel Rectilinear Shortest Paths with Rectangular Obstacles. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:79-113 [Journal]
   
7. Thomas C. Shermer
   Computing Bushy and Thin Triangulations. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:115-125 [Journal]
   
8. Jürgen Bokowski, Jürgen Richter-Gebert, Werner Schindler
   On the Distribution of Order Types. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:127-142 [Journal]
   
9. David Eppstein
   The Farthest Point Delaunay Triangulation Minimizes Angles. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1991, v:1, n:, pp:143-148 [Journal]
   
10. Simeon C. Ntafos
    Watchman Routes Under Limited Visibility. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:149-170 [Journal]
    
11. David Rappaport
    A Convex Hull Algorithm for Discs, and Applications. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:171-187 [Journal]
    
12. Pankaj K. Agarwal, Jirí Matousek, Subhash Suri
    Farthest Neighbors, Maximum Spanning Trees and Related Problems in Higher Dimensions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:189-201 [Journal]
    
13. Susanne E. Hambrusch, Hung-Yi Tu
    A Framework for 1-D Compaction with Forbidden Region Avoidance. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:203-226 [Journal]
    
14. Remco C. Veltkamp
    The gamma-neighborhood Graph. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:227-246 [Journal]
    
15. Mark de Berg, Mark H. Overmars
    Hidden Surface Removal for C-oriented Polyhedra. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:247-268 [Journal]
    
16. Dan Halperin, Micha Sharir
    Improved Combinatorial Bounds and Efficient Techniques for Certain Motion Planning Problems with Three Degrees of Freedom. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:269-303 [Journal]
    
17. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:305-323 [Journal]
    
18. Rolf Klein
    Walking an Unknown Street with Bounded Detour. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:325-351 [Journal]