Volume 39,
Number 1,
January 2008
Special Issue on the Canadian Conference on Computational Geometry - CCCG 2004
- Prosenjit Bose, Thomas Fevens:
Editorial.
1
- Harish Gopala, Pat Morin:
Algorithms for bivariate zonoid depth.
2-13
- Ferran Hurtado, Mikio Kano, David Rappaport, Csaba D. Tóth:
Encompassing colored planar straight line graphs.
14-23
- Bernard Chazelle, Ding Liu, Avner Magen:
Approximate range searching in higher dimension.
24-29
- Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands.
30-42
- Mirela Damian, Joseph O'Rourke:
On corners of objects built from parallelepiped bricks.
43-54
- Jean Cardinal, Sébastien Collette, Stefan Langerman:
Local properties of geometric graphs.
55-64
Volume 39,
Number 2,
February 2008
- Manuel Abellanas, Prosenjit Bose, Alfredo García Olaverri, Ferran Hurtado, Pedro Ramos, Eduardo Rivera-Campo, Javier Tejel:
On local transformations in plane geometric graphs embedded on small grids.
65-77
- Alireza Zarei, Mohammad Ghodsi:
Query point visibility computation in polygons with holes.
78-90
- Theocharis Malamatos:
Lower bounds for expected-case planar point location.
91-103
- Ho-Lun Cheng, Tony Tan:
Approximating polyhedral objects with deformable smooth surfaces.
104-117
- Sergio Cabello, Panos Giannopoulos, Christian Knauer, Günter Rote:
Matching point sets with respect to the Earth Mover's Distance.
118-133
- Oswin Aichholzer, Franz Aurenhammer, Paola Gonzalez-Nava, Thomas Hackl, Clemens Huemer, Ferran Hurtado, Hannes Krasser, Saurabh Ray, Birgit Vogtenhuber:
Matching edges and faces in polygonal partitions.
134-141
Volume 39,
Number 3,
April 2008
Copyright © Mon Nov 2 21:28:43 2009
by Michael Ley (ley@uni-trier.de)
