Proceedings of the 9th Canadian Conference on Computational Geometry, Kingston, Ontario, Canada, August 11-14, 1997.
9. CCCG 1997:
Kingston, Ontario, Canada
: On the number of internal and external visibility edges of polygons.
: A straight-line embedding of two or more rooted trees in the plane.
: A balanced partition of points in the plane and tree embedding problems.
: The visibility graph contains a bounded-degree spanner.
: Handling rotations in the placement of curved convex polygons.
: Some methods to determine the sign of a long integer from its remainders.
, Jean-Michel Moreau
: Analysis of a class of k-dimensional merge procedures, with an application to 2d delaunay triangulation in expected linear time after two-directional sorting.
: Walking in the visibility complex with applications to visibility polygons and dynamic visibility.
: Stability of voronoi neighborship under perturbations of the sites.