This list is also available as a BibTeX file.

You may notice that author and title information is missing from many of the papers listed below. You can help correct this by submitting this information online using the "Correct" link after each paper.

CCCG 1995 Papers

1
Frank Follert, Elmar Schömer, and Jürgen Sellen.
Subquadratic algorithms for the weighted maximin facility location problem.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 1-6, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0000.pdf.
Correct.

2
Frank Follert.
Maxmin location of an anchored ray in 3-space and related problems.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 7-12, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0001.pdf.
Correct.

3
R. Varadarajant, Pankaj, and K. Agarwal.
Linear approximation of simple objects kasturi.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 13-18, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0002.pdf.
Correct.

4
Jerzy W. Jaromczyk and Miroslaw Kowalukt.
A geometric proof of the combinatorial bounds the number of optimal solutions for the 2 center euclidean problem.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 19-24, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0003.pdf.
Correct.

5
Nimish R. Shah.
Homeomorphic meshes in $r^3$.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 25-30, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0004.pdf.
Correct.

6
Tamal, K. Dey Nimish, and R. Shah.
On the number of simplicial complexes in and.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 31-36, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0005.pdf.
Correct.

7
Tetsuo, Asano, Naomi, Thomas, and Roos.
Optimal approximation of monotone curves on a grid kathy 2 elena lodi 3.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 37-42, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0006.pdf.
Correct.

8
Jian, Huang, Anil, Maheshwari, A Jorg, u Doron, and Nussbaum.
A note on approximations of rectilinear polygons t at gear race.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 43-48, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0007.pdf.
Correct.

9
Pascal, Desnogues Olivier, and Devillers.
A locally optimal triangulation of the hyperbolic paraboloid.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 49-54, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0008.pdf.
Correct.

10
Victor and J. Milenkovic.
Practical methods for set operations on polygons using exact arithmetic.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 55-60, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0009.pdf.
Correct.

11
Gill, Barequet, Matthew, Dickerson, and Paul.
Translating a convex polygon to contain maximum number of points peru.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 61-66, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0010.pdf.
Correct.

12
Helmut Alt, David Hsu, and Jack Snoeyink.
Computing the largest inscribed isothetic rectangle.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 67-72, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0011.pdf.
Correct.

13
Prosenjit, Bose, Ferran, Hurtado, Diaz, Elsa, Omana, Pulido, Godfried, and Toussaint.
Aperture angle optimization problems.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 73-78, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0012.pdf.
Correct.

14
Victor and Milenkovic.
Position based physics animating and packing spheres inside polyhedra.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 79-84, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0013.pdf.
Correct.

15
Jeff Erickson.
On the relative complexities of some geometric problems.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 85-90, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0014.pdf.
Correct.

16
Sariel Har-Peled, Timothy M. Chan, Boris Aronov, Dan Halperin, and Jack Snoeyink.
The complexity of a single face of a minkowski sum.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 91 -96, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0015.pdf.
Correct.

17
Alfredo, Garcia, Marc, Noy, Javier, and Tejel.
Lower bounds for the number noncrossing free subgraphs of in.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 97-102, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0016.pdf.
Correct.

18
Gautam, Das, Narasimhan, and t.
Short cuts in higher dimensional space girl.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 103-108, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0017.pdf.
Correct.

19
William Evans.
Regular polygons are most tolerant.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 109-113, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0018.pdf.
Correct.

20
Kwon and Kim.
Simple algorithms for orthogonal upward drawings of binary and ternary trees sung.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 115-120, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0019.pdf.
Correct.

21
Paul, Colley, Henk, Meijer, David, and Rappaport.
Motivating lazy guards.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 121-126, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0020.pdf.
Correct.

22
Laxmi, P Gewali, Simon, and Ntafos.
Watchman routes in the presence of a pair of convex polygons.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 127-132, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0021.pdf.
Correct.

23
Danny, Z. Chen, Vladimir, Estivill, Castro, Jorge, and Urrutia.
Optimal guarding of polygons and monotone chains.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 133-138, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0022.pdf.
Correct.

24
S. M. Yiu.
A generalized fortress problem using k consecutive vertex guards.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 139-144, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0023.pdf.
Correct.

25
Patrice Belleville.
Convex covers in higher dimensions.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 145-150, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0024.pdf.
Correct.

26
Joseph, O' Thomas, Shermer, Ileana, and Streinu.
Illuminating convex polygonswith vertex floodlight rourke y.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 151-156, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0025.pdf.
Correct.

27
Hazel Everett.
Visibility graphs of polygonal rings liz len gait.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 157-161, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0026.pdf.
Correct.

28
Kathleen Romanik.
Directed rectangle visibility graphs have unbounded dimension.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 163-167, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0027.pdf.
Correct.

29
Danny, Z. Chen, Kevin, and S. Klenk.
Rectilinear short path queries among rectangular obstacles.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 169-174, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0028.pdf.
Correct.

30
Christian Chenier and Jorge Urrutia.
Shortest paths in convex and simple weighted polygons.
In Proceedings of the Seventh Canadian Conference on Computational Geometry (CCCG 1995), pages 175-179, 1995.
URL http://www.cccg.ca/proceedings/1995/cccg1995_0029.pdf.
Correct.



CCCG Website 2006-06-06