Journals in DBLP

Comput. Geom.
2006, volume: 33, number: 3

1. Jianbo Qian, Cao An Wang
   Progress on maximum weight triangulation. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:99-105 [Journal]
   
2. Christopher J. Hillar, Darren L. Rhea
   A result about the density of iterated line intersections in the plane. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:106-114 [Journal]
   
3. Ovidiu Daescu, Jun Luo, David M. Mount
   Proximity problems on line segments spanned by points. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:115-129 [Journal]
   
4. Siu-Wing Cheng
   On the sizes of Delaunay meshes. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:130-138 [Journal]
   
5. Mark de Berg, Micha Streppel
   Approximate range searching using binary space partitions. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:139-151 [Journal]
   
6. Hee-Kap Ahn, Peter Braß, Otfried Cheong, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron
   Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:152-164 [Journal]
   
7. Binay K. Bhattacharya, Subir Kumar Ghosh, Thomas C. Shermer
   A linear time algorithm to remove winding of a simple polygon. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:165-173 [Journal]
   
8. Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexander Wolff
   Farthest-point queries with geometric and combinatorial constraints. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2006, v:33, n:3, pp:174-185 [Journal]