Computational Geometry, Volume 42

Volume 42, Number 1, January 2009

• Hoa Nguyen, John Burkardt, Max Gunzburger, Lili Ju, Yuki Saka:
  Constrained CVT meshes and a comparison of triangular mesh generators. 1-19
  
• Shripad Thite:
  Adaptive spacetime meshing for discontinuous Galerkin methods. 20-44
  
• Lilian Buzer:
  Optimal simplification of polygonal chains for subpixel-accurate rendering. 45-59
  
• Prosenjit Bose, Ferran Hurtado:
  Flips in planar graphs. 60-80
  
• Vojtech Franek, Jirí Matousek:
  Computing D-convex hulls in the plane. 81-89
  
• Ana Paulina Figueroa:
  A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs. 90-91
  

Volume 42, Number 2, February 2009

• Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff:
  Matching points with rectangles and squares. 93-108
  
• Alper Üngör:
  Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations. 109-118
  
• Peter Brass, Kyue D. Kim, Hyeon-Suk Na, Chan-Su Shin:
  Escaping offline searchers and isoperimetric theorems. 119-126
  
• János Pach, Géza Tóth:
  Decomposition of multiple coverings into many parts. 127-133
  
• Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil Maheshwari, Michiel H. M. Smid, Norbert Zeh:
  Geometric spanners with small chromatic number. 134-146
  
• Konstantin A. Rybnikov:
  An efficient local approach to convexity testing of piecewise-linear hypersurfaces. 147-172
  
• Justin Cappos, Alejandro Estrella-Balderrama, J. Joseph Fowler, Stephen G. Kobourov:
  Simultaneous graph embedding with bends and circular arcs. 173-182
  

Volume 42, Number 3, April 2009

• Jean Cardinal, Sébastien Collette, Stefan Langerman:
  Empty region graphs. 183-195
  
• Ho-Lun Cheng, Xinwei Shi:
  Quality mesh generation for molecular skin surfaces using restricted union of balls. 196-206
  
• Hee-Kap Ahn, Peter Brass, Hyeon-Suk Na, Chan-Su Shin:
  On the minimum total length of interval systems expressing all intervals, and range-restricted queries. 207-213
  
• Md. Saidur Rahman, Kazuyuki Miura, Takao Nishizeki:
  Octagonal drawings of plane graphs with prescribed face areas. 214-230
  
• Joachim Gudmundsson, Marc J. van Kreveld, Giri Narasimhan:
  Region-restricted clustering for geographic data mining. 231-240
  
• Eyal Ackerman, Oswin Aichholzer, Balázs Keszegh:
  Improved upper bounds on the reflexivity of point sets. 241-249
  
• Mark de Berg, Herman J. Haverkort, Micha Streppel:
  Efficient c-oriented range searching with DOP-trees. 250-267
  

Volume 42, Number 4, May 2009

• Jens Egeblad, Benny K. Nielsen, Marcus Brazil:
  Translational packing of arbitrary polytopes. 269-288
  
• Tetsuo Asano, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Chang Shu, Michiel H. M. Smid, Stefanie Wuhrer:
  A linear-space algorithm for distance preserving graph embedding. 289-304
  
• Sergey Bereg:
  Orthogonal equipartitions. 305-314
  
• Horst Martini, Senlin Wu:
  Geometric dilation of closed curves in normed planes. 315-321
  
• Rodrigo I. Silveira, Marc J. van Kreveld:
  Towards a definition of higher order constrained Delaunay triangulations. 322-337
  
• Pedro A. Ramos, Raquel Viaña:
  Depth of segments and circles through points enclosing many points: a note. 338-341
  
• Yakov Nekrich:
  Orthogonal range searching in linear and almost-linear space. 342-351
  
• Ihsan Salleh:
  K-vertex guarding simple polygons. 352-361