Computational Geometry, Volume 42
Volume 42, Number 1, January 2009
: Adaptive spacetime meshing for discontinuous Galerkin methods.
: Optimal simplification of polygonal chains for subpixel-accurate rendering.
Ana Paulina Figueroa
: A note on a theorem of Perles concerning non-crossing paths in convex geometric graphs.
Volume 42, Number 2, February 2009
: Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations.
Konstantin A. Rybnikov
: An efficient local approach to convexity testing of piecewise-linear hypersurfaces.
Volume 42, Number 3, April 2009
, Xinwei Shi
: Quality mesh generation for molecular skin surfaces using restricted union of balls.
Volume 42, Number 4, May 2009
: Orthogonal range searching in linear and almost-linear space.
Volume 42, Number 5, July 2009
Special Issue on the Canadian Conference on Computational Geometry (CCCG 2005)
Timothy G. Abbott
, Michael Burr
, Timothy M. Chan
, Erik D. Demaine
, Martin L. Demaine
, John Hugg
, Daniel M. Kane
, Stefan Langerman
, Jelani Nelson
, Eynat Rafalin
, Kathryn Seyboth
, Vincent Yeung
: Dynamic ham-sandwich cuts in the plane.
Special Issue on the Canadian Conference on Computational Geometry (CCCG 2006). Guest Editors:
H. Meijer and D. Rappaport
Volume 42, Numbers 6-7, August 2009
, Sergey Bereg
, Adrian Dumitrescu
, Alfredo García Olaverri
, Clemens Huemer
, Ferran Hurtado
, Mikio Kano
, Alberto Márquez
, David Rappaport
, Shakhar Smorodinsky
, Diane L. Souvaine
, Jorge Urrutia
, David R. Wood
: Compatible geometric matchings.
Volume 42, Number 8, October 2009
Volume 42, Number 9, November 2009