Open problems from CCCG 2005

Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006

Volumn , Issue , 2006, Pages 75-80

  Demaine, Erik D ^a   O’Rourke, Joseph ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b SMITH COLLEGE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85072869799     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. Danny Z. Chen, Vladimir Estivill-Castro, and Jorge Urrutia. Optimal guarding of polygons and monotone chains. In Proc. 7th Canadian Conference on Computational Geometry, pages 133–138, Aug. 1995.
2. James King. A 4-approximation algorithm for guarding 1.5-dimensional terrains. In Proc. 7th Latin American Symposium on Theoretical Informatics, volume 3887 of Lecture Notes Comput. Sci., pages 629–640, Apr. 2006.
3. Prosenjit Bose and Stefan Langerman. Weighted ham-sandwich cuts. In Proc. Japan Conference on Discrete and Computational Geometry, volume 3742 of Lecture Notes Comput. Sci., pages 48–53, Oct. 2004.
4. Hank Chien and William Steiger. Some geometric lower bounds. In Proc. 6th International Symposium on Algorithms and Computation, volume 1004 of Lecture Notes Comput. Sci., pages 72–81, Dec. 1995.
5. Tamal K. Dey. Improved bounds for planar k-sets and related problems. Discrete Comput. Geom., 19(3):373–382, 1998.
6. Chi-Yuan Lo, Jiří Matoušek, and William L. Steiger. Algorithms for ham-sandwich cuts. Discrete Comput. Geom. 11:433–452, 1994.
7. Audrey Lee, Ileana Streinu, and Louis Theran. Finding and maintaining rigid components. In Proc. 17th Canadian Conference on Computational Geometry, pages 219–222, Aug. 2005.
8. Jack Snoeyink and Ileana Streinu. Computing rigid components of pseudotriangulation mechanisms in linear time. In Proc. 17th Canadian Conference on Computational Geometry, pages 223–226, Aug. 2005.
9. S. P. Fekete and H. Meijer. Rectangle and box visibility graphs in 3D. International Journal of Computational Geometry and its Applications, 9:1–27, 1999.
10. Ching-Chi Lin and Hseuh-I Lu and I-Fan Sun. Improved compact visibility representation of planar graph via Schnyder’s realizer. In Proc. 20th International Symposium on Theoretical Aspects of Computer Science, volume 2607 of Lecture Notes Comput. Sci., pages 14–25, Feb.–Mar. 2003.
11. Rebecca Alexander, Heather Dyson, and Joseph O’Rourke. The convex polyhedra foldable from a square. In Revised Papers from the Japan Conference on Discrete and Computational Geometry, volume 2866 of Lecture Notes Comput. Sci., pages 38–50, Dec. 2002.
12. E. D. Demaine and J. O’Rourke. Geometric Folding Algorithms: Linkages, Origami, and Polyhedra. Cambridge University Press. In preparation. http://www.fucg.org.
13. Erik D. Demaine and Joseph O’Rourke. Open problems from CCCG 2002. In Proc. 15th Canadian Conference on Computational Geometry, pages 178–181, 2003. arXiv:cs.CG/0212050.
14. Friedrich Eisenbrand, Stefan Funke, Andreas Karrenbauer, and Domagoj Matijevic. Energy-aware stage illumination. In Proc. 21st ACM Symposium on Computational Geometry, pages 336–345, Jun. 2005.
15. M. Oskar van Deventer. Rolling block mazes. In Barry Cipra, Erik D. Demaine, Martin L. Demaine, and Tom Rodgers, editors, A Tribute to a Mathemagician, pages 241–250, A K Peters, Nov. 2004.
16. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, and Perouz Taslakian. Necklaces, convolutions, and X + Y . In Proc. 14th Annual European Symposium on Algorithms, Sept. 2006. To appear.