The geometry of carpentry and joinery

In this paper, we propose to model a simplified wood shop. Following the work of Demaine et al. (Comput. Geom.: Theory Appl. 20 (1-2) (2002) 69) we limit the cutting tools of our carpenter to a circular saw. We extend that previous work to include a model of basic rules of carpentry and joinery. This model is then applied to the problem of building a polygon P by joining together strips of wood and cutting them with a circular saw. We describe a linear time algorithm to decide if a blueprint can be constructed in such a workshop.

[1]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[2]  Craig S. Kaplan,et al.  Polygons cuttable by a circular saw , 2001, Comput. Geom..

[3]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[4]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[5]  Bernard Chazelle.  Triangulating a simple polygon in linear time , 1991, Discret. Comput. Geom..

[6]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .