
Journals in DBLP
Comput. Geom. 2006, volume: 34, number: 2
 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:4957 [Journal]
 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:5874 [Journal]
 Hervé Brönnimann, Timothy M. Chan
Spaceefficient 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:7582 [Journal]
 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:8395 [Journal]
 Christopher Dyken, Michael S. Floater
Preferred directions for resolving the nonuniqueness of Delaunay triangulations. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:34, n:2, pp:96101 [Journal]
 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:102115 [Journal]
 Prosenjit Bose, Ferran Hurtado, Eduardo RiveraCampo, David R. Wood
Partitions of complete geometric graphs into plane trees. [Citation Graph (0, 0)][DBLP] Comput. Geom., 2006, v:34, n:2, pp:116125 [Journal]
