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
  
• Adrian Dumitrescu:
  On some monotone path problems in line arrangements. 13-25
  
• Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer:
  Computing straight-line 3D grid drawings of graphs in linear volume. 26-58
  
• Gabriela Araujo, Adrian Dumitrescu, Ferran Hurtado, Marc Noy, Jorge Urrutia:
  On the chromatic number of some geometric type Kneser graphs. 59-69
  

Volume 32, Number 2, October 2005

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

Volume 32, Number 3, November 2005

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

Last update Mon May 20 00:03:17 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page