The SCEAS System
Navigation Menu

Journals in DBLP

Comput. Geom.
2006, volume: 34, number: 2

  1. Stephan Eidenbenz
    Finding minimum hidden guard sets in polygons - tight approximability results. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:49-57 [Journal]
  2. Clara I. Grima, Alberto Márquez, Lidia M. Ortega
    A new 2D tessellation for angle problems: The polar diagram. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:58-74 [Journal]
  3. Hervé Brönnimann, Timothy M. Chan
    Space-efficient algorithms for computing the convex hull of a simple polygonal line in linear time. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:75-82 [Journal]
  4. Pankaj K. Agarwal, Nabil H. Mustafa
    Independent set of intersection graphs of convex objects in 2D. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:83-95 [Journal]
  5. Christopher Dyken, Michael S. Floater
    Preferred directions for resolving the non-uniqueness of Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:96-101 [Journal]
  6. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Online searching with an autonomous robot. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:102-115 [Journal]
  7. Prosenjit Bose, Ferran Hurtado, Eduardo Rivera-Campo, David R. Wood
    Partitions of complete geometric graphs into plane trees. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:116-125 [Journal]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002