- Takayuki Ishizeki, Fumihiko Takeuchi:
Geometric shellings of 3-polytopes. CCCG 1999 - Atsushi Kaneko, Yoshiaki Oda, Kiyoshi Yoshimoto:
Some results on geometric independency trees. CCCG 1999 - Matthew J. Katz, Klara Kedem, Michael Segal:
Improved algorithms for placing undesirable facilities. CCCG 1999 - Davis King, Jarek Rossignac:
Guaranteed 3.67v bit encoding of planar triangle graphs. CCCG 1999 - Victor Klee:
Shapes of the future - some unsolved problems in high-dimensional intuitive geometry. CCCG 1999 - Evangelos Kranakis, Harvinder Singh, Jorge Urrutia:
Compass routing on geometric networks. CCCG 1999 - Michael McAllister:
A watershed algorithm for triangulated terrains. CCCG 1999 - Subhas C. Nandy:
Shattering a set of objects in 2d. CCCG 1999 - Dinesh K. Pai:
Touching geometry. CCCG 1999 - Eduardo Rivera-Campo, Virginia Urrutia-Galicia:
A note on the path graph of a set of points in convex position in the plane. CCCG 1999 - Ian D. Sanders:
Non-orthogonal ray guarding. CCCG 1999 - Christian Sohler
:
Fast reconstruction of delaunay triangulations. CCCG 1999 - Christian Sohler:
Generating random star-shaped polygons. CCCG 1999 - Michael A. Soss:
On the size of the euclidean sphere of influence graph. CCCG 1999 - Michael J. Spriggs, J. Mark Keil:
Minimum spanning trees on polyhedra. CCCG 1999 - Ileana Streinu:
Non-stretchable pseudo-visibility graphs. CCCG 1999 - Godfried T. Toussaint:
The Erdös-Nagy theorem and its ramifications. CCCG 1999 - Roland Ulber:
On the number of star-shaped polygons and polyhedra. CCCG 1999 - Binhai Zhu:
A simple probablistic algorithm for approximating two and three-dimensional objects. CCCG 1999 - Proceedings of the 11th Canadian Conference on Computational Geometry, UBC, Vancouver, British Columbia, Canada, August 15-18, 1999. 1999 [contents]
