2D Cutting Stock Problems

This submission contains two algorithms for solving 2D Cutting Stock Problems:
1. A continued fractions and branch-and-bound algorithm for generating cutting patterns with equal rectangles;
2. An efficient recursive algorithm for generating cutting patterns of circular blanks.
References:
[1] Cui Yaodong, Zhang Chunling, Zhao Yi, A Continued Fractions and Branch-and-Bound Algorithm for Generating Cutting Patterns With Equal Rectangles, Journal of Computer-Aided Design & Computer Graphics, Vol.16 No.2, Feb 2004
http://d.wanfangdata.com.cn/Periodical_jsjfzsjytxxxb200402020.aspx

[2] Yang Ying, Zhao Xinfang, Cui Yaodong, An Efficient Recursive Algorithm for Generating Cutting Patterns of Circular Blanks, Journal of Henan University (Natural Science), Vol.38 No.2, Mar 2008
http://d.wanfangdata.com.cn/Periodical_hndxxbzr200802022.aspx

See demo.m for more information.