Computational Geometry, Volume 21

Volume 21, Number 1-2, January 2002

• Matthew J. Katz, Klara Kedem: Sixteenth European Workshop on Computational Geometry - Editorial. 1 BibTeX
• Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado: Sequences of spanning trees and a fixed tree theorem. 3-20 BibTeX
• Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen: Orienting polyhedral parts by pushing. 21-38 BibTeX
• Pankaj K. Agarwal, Eyal Flato, Dan Halperin: Polygon decomposition for efficient construction of Minkowski sums. 39-61 BibTeX
• Udo Adamy, Joachim Giesen, Matthias John: Surface reconstruction using umbrella filters. 63-86 BibTeX

Volume 21, Number 3, March 2002

• Michal Etzion, Ari Rappoport: Computing Voronoi skeletons of a 3-D polyhedron by space subdivision. 87-120 BibTeX
• Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki: Rectangular drawings of plane graphs without designated corners. 121-138 BibTeX
• Stephan Eidenbenz: Inapproximability of finding maximum hidden sets on polygons and terrains. 139-153 BibTeX
• Danny Z. Chen, Jinhui Xu: Two-variable linear programming in parallel. 155-165 BibTeX
• Jean-Daniel Boissonnat, Antoine Vigneron: An elementary algorithm for reporting intersections of red/blue curve segments. 167-175 BibTeX
• Boris Aronov, Jacob E. Goodman, Richard Pollack: A Helly-type theorem for higher-dimensional transversals. 177-183 BibTeX
• Csaba D. Tóth: Art galleries with guards of uniform range of vision. 185-192 BibTeX
• Csaba D. Tóth: Illumination in the presence of opaque line segments in the plane. 193-204 BibTeX