Journals in DBLP

Comput. Geom.
1999, volume: 12, number: 1-2

1. David Eppstein
   Linear complexity hexahedral mesh generation. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:3-16 [Journal]
   
2. Sandy Irani, Prabhakar Raghavan
   Combinatorial and experimental results for randomized point matching algorithms. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:17-31 [Journal]
   
3. Simon Kahan, Jack Snoeyink
   On the bit complexity of minimum link paths: Superquadratic algorithms for problem solvable in linear time. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:33-44 [Journal]
   
4. Gill Barequet, Micha Sharir
   Partial surface matching by using directed footprints. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:45-62 [Journal]
   
5. Ernst P. Mücke, Isaac Saias, Binhai Zhu
   Fast randomized point location without preprocessing in two- and three-dimensional Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:63-83 [Journal]
   
6. Kurt Mehlhorn, Stefan Näher, Michael Seel, Raimund Seidel, Thomas Schilz, Stefan Schirra, Christian Uhrig
   Checking geometric programs or verification of geometric structures. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:85-103 [Journal]
   
7. Satyan R. Coorg, Seth J. Teller
   Temporally coherent conservative visibility. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:105-124 [Journal]
   
8. James E. Baker, Isabel F. Cruz, Giuseppe Liotta, Roberto Tamassia
   Visualizing geometric algorithms over the Web. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 1999, v:12, n:1-2, pp:125-152 [Journal]