Volume 30,
Number 1,
January 2005
- Emilio Di Giacomo, Walter Didimo, Giuseppe Liotta, Stephen K. Wismath:
Curve-constrained drawings of planar graphs.
1-23
- David R. Wood:
Grid drawings of k-colourable graphs.
25-28
- Huaming Zhang, Xin He:
Improved visibility representation of plane graphs.
29-39
- Ovidiu Daescu, Ningfang Mi:
Polygonal chain approximation: a query based approach.
41-58
- Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff:
Optimal spanners for axis-aligned rectangles.
59-77
Volume 30,
Number 2,
February 2005
Special Issue on the 19th European Workshop on Computational Geometry
- Rolf Klein:
Foreword.
79
- Sándor P. Fekete, Henk Meijer:
The one-round Voronoi game replayed.
81-94
- Mattias Andersson, Joachim Gudmundsson, Christos Levcopoulos:
Chips on wafers, or packing rectangles into grids.
95-111
- Axel Mosig, Michael Clausen:
Approximately matching polygonal curves with respect to the Fre'chet distance.
113-127
- Kenji Kashiwabara, Masataka Nakamura, Yoshio Okamoto:
The affine representation theorem for abstract convex geometries.
129-144
- Bernard Mourrain, Jean-Pierre Técourt, Monique Teillaud:
On the computation of an arrangement of quadrics in 3D.
145-164
- Yi-Jen Chiang, Tobias Lenz, Xiang Lu, Günter Rote:
Simple and optimal output-sensitive construction of contour trees using monotone paths.
165-195
- Matthew J. Katz, Joseph S. B. Mitchell, Yuval Nir:
Orthogonal segment stabbing.
197-205
Volume 30,
Number 3,
March 2005
Last update Tue Feb 14 04:15:36 2012
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
