default search action
Computational Geometry, Volume 21
Volume 21, Number 1-2, January 2002
- Matthew J. Katz, Klara Kedem:
Sixteenth European Workshop on Computational Geometry - Editorial. Comput. Geom. 21(1-2): 1 (2002) - Oswin Aichholzer, Franz Aurenhammer, Ferran Hurtado:
Sequences of spanning trees and a fixed tree theorem. 3-20 - Robert-Paul Berretty, Mark H. Overmars, A. Frank van der Stappen:
Orienting polyhedral parts by pushing. 21-38 - Pankaj K. Agarwal, Eyal Flato, Dan Halperin:
Polygon decomposition for efficient construction of Minkowski sums. 39-61 - Udo Adamy, Joachim Giesen, Matthias John:
Surface reconstruction using umbrella filters. 63-86
Volume 21, Number 3, March 2002
- Michal Etzion, Ari Rappoport:
Computing Voronoi skeletons of a 3-D polyhedron by space subdivision. 87-120 - Md. Saidur Rahman, Shin-Ichi Nakano, Takao Nishizeki:
Rectangular drawings of plane graphs without designated corners. 121-138 - Stephan J. Eidenbenz:
Inapproximability of finding maximum hidden sets on polygons and terrains. 139-153 - Danny Z. Chen, Jinhui Xu:
Two-variable linear programming in parallel. 155-165 - Jean-Daniel Boissonnat, Antoine Vigneron:
An elementary algorithm for reporting intersections of red/blue curve segments. 167-175 - Boris Aronov, Jacob E. Goodman, Richard Pollack:
A Helly-type theorem for higher-dimensional transversals. 177-183 - Csaba D. Tóth:
Art galleries with guards of uniform range of vision. 185-192 - Csaba D. Tóth:
Illumination in the presence of opaque line segments in the plane. 193-204
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.