Journals in DBLP
Comput. Geom. 1999, volume: 14, number: 4
Jerzy W. Jaromczyk , Miroslaw Kowaluk A geometric proof of the combinatorial bounds for the number of optimal solutions for the Euclidean 2-center problem. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1999, v:14, n:4, pp:187-196 [Journal ] Christos Levcopoulos , Drago Krznaric The greedy triangulation can be computed from the Delaunay triangulation in linear time. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1999, v:14, n:4, pp:197-220 [Journal ] Kevin D. Hunter , Theodosios Pavlidis Non-interactive geometric probing: Reconstructing non-convex polygons. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1999, v:14, n:4, pp:221-240 [Journal ] Alon Efrat , Matthew J. Katz On the union of k-curved objects. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1999, v:14, n:4, pp:241-254 [Journal ] Ruth Kuchem , Dorothea Wagner Wiring edge-disjoint layouts. [Citation Graph (0, 0)][DBLP ] Comput. Geom., 1999, v:14, n:4, pp:255-273 [Journal ]