Journals in DBLP

Comput. Geom.
2004, volume: 29, number: 3

1. Partha P. Goswami, Sandip Das, Subhas C. Nandy
   Triangular range counting query in 2D and its application in finding k nearest neighbors of a line segment. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:3, pp:163-175 [Journal]
   
2. Frédéric Vivien, Nicolas Wicker
   Minimal enclosing parallelepiped in 3D. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:3, pp:177-190 [Journal]
   
3. Seok-Hee Hong, Peter Eades, Jonathan Hillman
   Linkless symmetric drawings of series parallel digraphs. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:3, pp:191-221 [Journal]
   
4. Adrian Dumitrescu
   An approximation algorithm for cutting out convex polygons. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:3, pp:223-231 [Journal]
   
5. Prosenjit Bose, Anil Maheshwari, Giri Narasimhan, Michiel H. M. Smid, Norbert Zeh
   Approximating geometric bottleneck shortest paths. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:3, pp:233-249 [Journal]
   
6. Marcus Brazil, Benny K. Nielsen, Pawel Winter, Martin Zachariasen
   Rotationally optimal spanning and Steiner trees in uniform orientation metrics. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2004, v:29, n:3, pp:251-263 [Journal]