Journal: Comput. Geom.

Volume 32, Issue 3

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

Volume 32, Issue 2

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

Volume 32, Issue 1

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