This list is also available as a BibTeX file.

CCCG 1999 Papers

1
T. Biedl, A. Lubiw, and J. Sun.
When can a net fold to a polyhedron.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp16.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp16.pdf.

2
Roxana Cocan and Joseph O'Rourke.
Polygonal chains cannot lock in 4d.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c17.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c17.pdf.

3
Godfried Toussaint.
The erdös-nagy theorem and its ramifications.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp19.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp19.pdf.

4
M. Bern, E. D. Demaine, D. Eppstein, and E. Kuo.
Ununfoldable polyhedra.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp38.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp38.pdf.

5
Victor Klee.
Shapes of the future - some unsolved problems in high-dimensional intuitive geometry.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/klee.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/klee.pdf.

6
B. Bultena B. Grunbaum and F. Ruskey.
Convex drawings of intersecting families of simple closed curves.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c14.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c14.pdf.

7
Ileana Streinu.
Non-stretchable pseudo-visibility graphs.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c52.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c52.pdf.

8
H. Balza-Gomez, D. Michelucci, and JM Moreau.
The periodicity of integral convex hulls for conics in r<sup>2</sup>.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c23.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c23.pdf.

9
Vladimir Estivill-Castro.
Convex group clustering of large geo-referenced data sets.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp13.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp13.pdf.

10
Herman Haverkort and Hans Bodlaender.
Finding a minimal tree in a polygon with its medial axis.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp54.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp54.pdf.

11
Stefan Funke, Kurt Mehlhorn, and Stefan Näher.
Structural filtering: A paradigm for efficient and exact geometric programs.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp25.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp25.pdf.

12
Michael Soss.
On the size of the euclidean sphere of influence graph.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c29.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c29.pdf.

13
Matthias Fischer, Támas Lukovszki, and Martin Ziegler.
Partitioned neighborhood spanners of minimal outdegree.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp36.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp36.pdf.

14
Evangelos Kranakis, Harvinder Singh, and Jorge Urrutia.
Compass routing on geometric networks.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c46.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c46.pdf.

15
Binhai Zhu.
A simple probablistic algorithm for approximating two and three-dimensional objects.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c18.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c18.pdf.

16
Ian Ashdown.
Comparing photometric distributions.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp41.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp41.pdf.

17
Robert J. MacG. Dawson and Wendy A. Finbow.
A computational approach to stability problems.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c09.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c09.pdf.

18
Matthew J. Katz, Klara Kedem, , and Michael Segal.
Improved algorithms for placing undesirable facilities.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/open.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp12.pdf.

19
Sergei Bespamyatnikh and David Kirpatrick.
Rectilinear 2-center problems.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp55.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp55.pdf.

20
Michael Hoffman.
A simple linear algorithm for computing rectangle 3-centers.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp53.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp53.pdf.

21
Boaz Ben-Moshe, Matthew J. Katz, , and Michael Segal.
Obnoxious facility location: Complete service with minimal harm.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp11.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp11.pdf.

22
Ian Sanders.
Non-orthogonal ray guarding.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp15.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp15.pdf.

23
Eduardo Rivera-Campo and Virginia Urrutia-Galicia.
A note on the path graph of a set of points in convex position in the plane.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c08.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c08.pdf.

24
Otfried Cheong and René van Oostrum.
The visibility region of points in a simple polygon.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c22.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c22.pdf.

25
A. Kaneko, Y. Oda, and K. Yoshimoto.
Some results on geometric independency trees.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c26.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c26.pdf.

26
Dinesh Pai.
Touching geometry.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/pai.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/pai.pdf.

27
R. Hammersley, K. Lu, and S. Assa.
Geometric modeling with a multiresolution representation.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c40.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c40.pdf.

28
Ernst Huber.
Surface-to-surface intersection based on triangular parameter domain subdivision 100.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c48.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c48.pdf.

29
Michael McAllister.
A watershed algorithm for triangulated terrains.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp50.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp50.pdf.

30
Subhas Chandra Nandy.
Shattering a set of objects in 2d.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp30.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp30.pdf.

31
Adrian Dumitrescu.
On two lower bound constructions.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c10.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c10.pdf.

32
Tetsuo Asano and Yasuyuki Kawamura and.
Computational comparison of voting-based and arrangement-based schema for digital line detection.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c49.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c49.pdf.

33
C. Icking, R. Klein, N-M. Løe, L. Ma, and F. Santos.
On bisectors for convex distance functions in 3-space.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp28.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp28.pdf.

34
Michael J. Spriggs and J. Mark Keil.
Minimum spanning trees on polyhedra.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp34.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp34.pdf.

35
Hee-Kap Ahn, Siu-Wing Cheng, , and Otfried Cheong.
Casting with skewed ejection direction revisited.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c27.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c27.pdf.

36
Takayuki Ishizeki and Fumihiko Takeuchi.
Geometric shellings of 3-polytopes.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp47.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp47.pdf.

37
L. Devroye, C. Lemaire, , and JM Moreau.
Fast delaunay point location with search structures.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c24.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c24.pdf.

38
Christian Sohler.
Fast reconstruction of delaunay triangulations.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp42.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp42.pdf.

39
Davis King and Jarek Rossignac.
Guaranteed 3.67v bit encoding of planar triangle graphs.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c39.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c39.pdf.

40
Francois Anton and Darka Mioc.
On the conversion of ordinary voronoi diagrams into laguerre diagrams.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c44.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c44.pdf.

41
G. Csizmadia, J. Czyzowicz, L. Gasieniec, E. Kranakis, and J.Urrutia.
Domino tilings of orthogonal polygons.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c32.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c32.pdf.

42
J. Czyzowicz, E. Kranakis, and J.Urrutia.
Dissections, cuts and triangulations.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c33.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c33.pdf.

43
P. Bose, J. Czyzowicz, E. Kranakis, D. Krizanc, and D. Lessard.
Near optimal-partitioning of rectangles and prisms.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp45.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp45.pdf.

44
E. D. Demaine, M. L. Demaine, D. Eppstein, and E. Friedman.
Hinged dissections of polyominoes and polyforms.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fp37.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fp37.pdf.

45
Roland Ulber.
On the number of star-shaped polygons and polyhedra.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c20.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c20.pdf.

46
Christian Sohler.
Generating random star-shaped polygons.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c31.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c31.pdf.

47
A. Dumitrescu and G. Tóth.
Ramsey-type results for unions of comparability graphs and convex sets inrestricted position.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c35.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c35.pdf.

48
David Bremner and Victor Klee.
Inner diagonals of convex polytopes.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/c51.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/c51.pdf.

49
Susanne Fortier.
Looking at molecules with smart computers.
In Proceedings of the 11th Canadian Conference on Computational Geometry (CCCG'99), 1999.
URL http://www.cccg.ca/proceedings/1999/fortier.ps.gz.
URL2 http://www.cccg.ca/proceedings/1999/fortier.pdf.


CCCG Website 2003-06-20