Journals in DBLP

Comput. Geom.
2005, volume: 31, number: 3

1. Jack Snoeyink
   Editorial. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:149-0 [Journal]
   
2. Michael Hoffmann
   A simple linear algorithm for computing rectilinear 3-centers. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:150-165 [Journal]
   
3. Christian Sohler
   Fast reconstruction of Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:166-178 [Journal]
   
4. Stefan Funke, Kurt Mehlhorn, Stefan Näher
   Structural filtering: a paradigm for efficient and exact geometric programs. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:179-194 [Journal]
   
5. Ileana Streinu
   Non-stretchable pseudo-visibility graphs. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:195-206 [Journal]
   
6. Therese C. Biedl, Anna Lubiw, Julie Sun
   When can a net fold to a polyhedron? [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:207-218 [Journal]
   
7. Godfried T. Toussaint
   The Erdös-Nagy theorem and its ramifications . [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:219-236 [Journal]
   
8. Erik D. Demaine, Martin L. Demaine, David Eppstein, Greg N. Frederickson, Erich Friedman
   Hinged dissection of polyominoes and polyforms. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2005, v:31, n:3, pp:237-262 [Journal]