An algorithm for converting the contour of a 2D workpiece into a rectilinear polygon
暂无分享,去创建一个
[1] Joseph O'Rourke,et al. Some NP-hard polygon decomposition problems , 1983, IEEE Trans. Inf. Theory.
[2] R. Brubaker. Models for the perception of speech and visual form: Weiant Wathen-Dunn, ed.: Cambridge, Mass., The M.I.T. Press, I–X, 470 pages , 1968 .
[3] Muh-Cherng Wu,et al. A skeleton-retrieving technique for aiding modular-fixtures design , 1993 .
[4] Muh-Cherng Wu,et al. Global shape information modelling and classification of 2D workpieces , 1994 .
[5] Jimmy J. M. Tan,et al. Minimum rectangular partition problem for simple rectilinear polygons , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[6] B. Logar,et al. Feature-Based Part Database Design and Automatic Forming of Part Families for GT , 1991 .
[7] Kevin D. Gourley,et al. A Polygon-to-Rectangle Conversion Algorithm , 1983, IEEE Computer Graphics and Applications.
[8] András Hegedüs. Algorithms for covering polygons by rectangles , 1982 .
[9] B. Logar,et al. Design of the database for CAD based on group technology , 1988 .
[10] Mikell P. Groover,et al. CAD/CAM: Computer-Aided Design and Manufacturing , 1983 .
[11] Ibrahim Zeid,et al. CAD/CAM theory and practice , 1991 .
[12] Daniel J. Kleitman,et al. An Algorithm for Covering Polygons with Rectangles , 1986, Inf. Control..
[13] Muh-Cherng Wu,et al. A neural network approach to the classification of 3D prismatic parts , 1996 .
[14] Sartaj Sahni,et al. Covering rectilinear polygons by rectangles , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..