Computational Geometry, Volume 32

Volume 32, Number 1, September 2005

Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon:
Approximating the minimum triangulation of convex 3-polytopes with bounded degrees. 1-12
Electronic Edition (link) BibTeX
Adrian Dumitrescu:
On some monotone path problems in line arrangements. 13-25
Electronic Edition (link) BibTeX
Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
Computing straight-line 3D grid drawings of graphs in linear volume. 26-58
Electronic Edition (link) BibTeX
Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia:
On the chromatic number of some geometric type Kneser graphs. 59-69
Electronic Edition (link) BibTeX

Carla Binucci, Walter Didimo, Giuseppe Liotta, Maddalena Nonato:
Orthogonal drawings of graphs with vertex and edge labels. 71-114
Electronic Edition (link) BibTeX
Yehuda Koren, David Harel:
One-dimensional layout optimization, with applications to graph drawing by axis separation. 115-138
Electronic Edition (link) BibTeX
Mario A. Lopez, Shlomo Reisner:
Hausdorff approximation of convex polygons. 139-158
Electronic Edition (link) BibTeX
Yogish Sabharwal, Sandeep Sen:
A linear time algorithm for approximate 2-means clustering. 159-172
Electronic Edition (link) BibTeX

Danny Z. Chen, Ovidiu Daescu, John Hershberger, Peter M. Kogge, Ningfang Mi, Jack Snoeyink:
Polygonal path simplification with angle constraints. 173-187
Electronic Edition (link) BibTeX
Paz Carmi, Sariel Har-Peled, Matthew J. Katz:
On the Fermat-Weber center of a convex object. 188-195
Electronic Edition (link) BibTeX
Esther Ezra, Micha Sharir:
Counting and representing intersections among triangles in three dimensions. 196-215
Electronic Edition (link) BibTeX
Zsolt Fekete, Tibor Jordán:
Rigid realizations of graphs on small grids. 216-222
Electronic Edition (link) BibTeX
Ovidiu Daescu, Robert Serfling:
Extremal point queries with lines and line segments and related problems. 223-237
Electronic Edition (link) BibTeX