Journals in DBLP

Comput. Geom.
2008, volume: 40, number: 1

1. 
   Steiner hull algorithm for the uniform orientation metrics. [Citation Graph (, )][DBLP]
   
   
2. 
   Optimal core-sets for balls. [Citation Graph (, )][DBLP]
   
   
3. 
   On the density of iterated line segment intersections. [Citation Graph (, )][DBLP]
   
   
4. 
   Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. [Citation Graph (, )][DBLP]
   
   
5. 
   A unified and efficient solution to the room search problem. [Citation Graph (, )][DBLP]
   
   
6. 
   Classroom examples of robustness problems in geometric computations. [Citation Graph (, )][DBLP]
   
   
7. 
   Triangulations without pointed spanning trees. [Citation Graph (, )][DBLP]
   
   
8. 
   Weak epsilon-nets have basis of size O(1/epsilonlog(1/epsilon)) in any dimension. [Citation Graph (, )][DBLP]