Wang, F. C., Marchetti, L., and Wright, P. K., 1999, “Rapid Prototyping Using Machining,” SME Technical Paper, PE99-118.

Frank, M. C., Wysk, R. A., and Joshi, S. B., 2003, “Rapid Prototyping Using CNC Machining,” "*Proc. of ASME Design Engineering Technical Conf. and Computers and Information in Engineering Conf., Chicago*", IL, ASME, New York.

Frank, M. C., Joshi, S. B., and Wysk, R. A., 2003, “Rapid Prototyping as an Integrated Product/Process Development Tool: An Overview of Issues and Economics,” J. Chin. Inst. Eng., 20 (3), pp. 239–245.

Chen, L. L., and Woo, T. C., 1992, “Computational Geometry on the Sphere With Application to Automated Machining,” Trans. ASME, 114 (2), pp. 288–295.

Gan, J. G., Woo, T. C., and Tang, K., 1994, “Spherical Maps: Their Construction, Properties, and Approximation,” J. Mech. Des., 116 (2), pp. 357–363.

Tang, K., Woo, T. C., and Gan, J., 1992, “Maximum Intersection of Spherical Polygons and Workpiece Orientation for 4- and 5-Axis Machining,” J. Mech. Des., 114 (3), pp. 477–485.

Chen, L., Chou, S., and Woo, T. C., 1993, “Separating and Intersecting Spherical Polygons: Computing Machinability on Three-, Four-, and Five-Axis Numerically Controlled Machines,” ACM Trans. Graphics

[CrossRef], 12 (4), pp. 305–326.

Suh, S. H., and Kang, J. K., 1995, “Process Planning for Multi-Axis NC Machining of Free Surfaces,” Int. J. Prod. Res., 33 (10), pp. 2723–2738.

Joshi, S. B., and Chang, T. C., 1988, “Graph-Base Heuristic for Recognition of Machined Features From a 3-D Solid Model,” Comput.-Aided Des.

[CrossRef], 20 (2), pp. 58–66.

Ferreira, J. C. E., and Hinduja, S., 1990, “Convex Hull-Based Feature Recognition Method for 2.5D Components,” Comput.-Aided Des.

[CrossRef], 22 (1), pp. 41–49.

Vanderbrande, J. H., and Requicha, A. A. G., 1993, “Spatial Reasoning for the Automatic Recognition of Machinable Features in Solid Models,” IEEE Trans. Pattern Anal. Mach. Intell.

[CrossRef], 15 (12), pp. 1269–1285.

Balasubramanium, M., Laxmiprasad, P., Sarma, S., and Shaikh, Z., 2000, “Generating 5-Axis NC Roughing Paths Directly From a Tessellated Representation,” Comput.-Aided Des.

[CrossRef], 32 (4), pp. 261–277.

Tseng, Y. J., and Joshi, S. B., 1991, “Determining Feasible Tool-Approach Directions for Machining Bezier Curves and Surfaces,” Comput.-Aided Des.

[CrossRef], 23 (5), pp. 367–379.

Glaeser, G., Wallner, J., and Pottman, H., 1999, “Collision Free 3-Axis Milling and Selection of Cutting Tools,” Comput.-Aided Des.

[CrossRef], 31 (3), pp. 225–232.

Yang, D. C. H., and Han, Z., 1999, “Interference Detection and Optimal Tool Selection in 3-Axis NC Machining of Free-Form Surfaces,” Comput.-Aided Des.

[CrossRef], 31 (5), pp. 303–315.

Suh, S. H., Lee, J. J., and Kim, S. K., 1998, “Multiaxis Machining With Additional-Axis NC System: Theory and Development,” Int. J. Adv. Manuf. Technol.

[CrossRef], 14 (12), pp. 865–875.

Suh, S., and Lee, J., 1998, “Five Axis Part Machining With Three Axis CNC Machine and Indexing Table,” ASME J. Manuf. Sci. Eng., 120 (1), pp. 120–128.

Li, S., and Jerard, R., 1994, “5-Axis Machining of Sculptured Surfaces With a Flat-End Cutter,” Comput.-Aided Des.

[CrossRef], 26 (3), pp. 165–178.

Xu, X. J., Bradley, C., Zhang, Y. F., Loh, H. T., and Wong, Y. S., 2002, “Tool-Path Generation for Five-Axis Machining of Free-Form Surfaces Based on Accessibility Analysis,” Int. J. Prod. Res.

[CrossRef], 40 (14), pp. 3253–3274.

Balasubramanium, M., Sarma, S., and Marciniak, K., 2003, “Collision-Free Finishing Toolpaths From Visibility Data,” Comput.-Aided Des.

[CrossRef], 35 (4), pp. 359–374.

Lee, D. T., 1983, “Visibility of a Simple Polygon,” Comput. Vis. Graph. Image Process.

[CrossRef], 22 (2), pp. 207–221.

Shin, S. Y., and Woo, T. C., 1989, “An Optimal Algorithm for Finding all Visible Edges in a Simple Polygon,” IEEE J. Rob. Autom., 5 (2), pp. 202–207.

Ghosh, S. B., and Mount, D. M., 1991, “An Output-Sensitive Algorithm for Computing Visibility Graphs,” SIAM J. Comput.

[CrossRef], 20 (5), pp. 888–910.

Gewali, L. P., and Ntafos, S., 1998, “Watchman Routes in the Presence of a Pair of Convex Polygons,” Inf. Sci. (N.Y.), 105 (1–4), pp. 123–149.

Everett, H., Hurtado, F., and Noy, M., 1999, “Stabbing Information of a Simple Polygon,” Discrete Appl. Math.

[CrossRef], 91 (1–3), pp. 67–82.

Kapoor, S., and Maheshwari, S. N., 2000, “Efficiently Constructing the Visibility Graph of a Simple Polygon With Obstacles,” SIAM J. Comput.

[CrossRef], 30 (3), pp. 847–871.

Ntafos, S., and Gewali, L., 1994, “External Watchman Routes,” Visual Comput.

[CrossRef], 10 (8), pp. 474–483.

Laurentini, A., 1999, “Guarding the Walls of an Art Gallery,” Visual Comput.

[CrossRef], 15 (6), pp. 265–278.

O’Rourke, J., 1987, "*Art Gallery Theorems and Algorithms*", Oxford University Press, New York.

Peshkin, M. A., and Sanderson, A. C., 1986, “Reachable Grasps on a Polygon: The Convex Rope Algorithm,” IEEE J. Rob. Autom., RA-2 (1), pp. 53–58.

Lee, D. T., and Preparata, F. P., 1984, “Euclidean Shortest Paths in the Presence of Rectilinear Barriers,” Networks, 14 (3), pp. 393–410.

Guibas, L. J., Hershberger, J., Leven, D., Sharir, M., and Tarjan, R. E., 1987, “Linear Time Algorithms for Visibility and Shortest Path Problems Inside Triangulated Simple Polygons,” Algorithmica

[CrossRef], 2 (2), pp. 209–233.

Stewart, J. A., 1999, “Computing Visibility From Folded Surfaces,” Comput. Graph.

[CrossRef], 23 (5), pp. 693–702.

Toussaint, G., 1991, “Efficient Triangulation of Simple Polygons,” Visual Comput.

[CrossRef], 7 (5–6), pp. 280–295.

Held, M., 1998, "*Efficient and Reliable Triangulation of Polygons*", Computer Graphics International, Hannover, Germany, pp. 633–643.

Chvátal, V., 1979, “A Greedy Heuristic for the Set-Covering Problem,” Math. Op. Res., 4 (3), pp. 233–235.