Finding the minimum illuminating direction set for a polyhedron

The minimum illuminating direction set cover problem for a polyhedron seeks the minimum cardinality set of 3-D directions that illuminate the entire polyhedron surface. This thesis introduces a new algorithm for solving such problem. The algorithm includes four steps: (1) Computing sliding planes; (2) Constructing visibility polygons; (3) Conducting overlay of polygons on the unit sphere and (4) Applying greedy algorithm to solve a set cover problem. Results have shown the algorithm gives correct answers to a set of polyhedra. Because the visibility polygons results are exact, the solution of the minimum illuminating direction set cover problem is accurate, though might not be optimal.

[1]  Kai Tang,et al.  Maximum Intersection of Spherical Polygons and Workpiece Orientation for 4- and 5-Axis Machining , 1992 .

[2]  Kai Tang,et al.  Global obstacle avoidance and minimum workpiece setups in five-axis machining , 2013, Comput. Aided Des..

[3]  T. C. Woo,et al.  Computational Geometry on the Sphere With Application to Automated Machining , 1992 .

[4]  Gonzalo Valiño,et al.  Laser scan planning based on visibility analysis and space partitioning techniques , 2008 .

[5]  Min Liu,et al.  Computing an exact spherical visibility map for meshed polyhedra , 2007, Symposium on Solid and Physical Modeling.

[6]  Gershon Elber,et al.  Cone visibility decomposition of freeform surface , 1998, Comput. Aided Des..

[7]  M. W. Fu,et al.  The application of surface demoldability and moldability to side-core design in die and mold CAD , 2008, Comput. Aided Des..

[8]  Michaël Roy,et al.  3D part inspection path planning of a laser scanner with control on the uncertainty , 2011, Comput. Aided Des..

[9]  Suk-Hwan Suh,et al.  Process planning for multi-axis NC machining of free surfaces , 1995 .

[10]  Peter Slavík.  A Tight Analysis of the Greedy Algorithm for Set Cover , 1997, J. Algorithms.

[11]  Matthew C. Frank,et al.  Computing the Global Visibility Map Using Slice Geometry for Setup Planning , 2017 .

[12]  Min Liu,et al.  On minimal orthographic view covers for polyhedra , 2009, 2009 IEEE International Conference on Shape Modeling and Applications.

[13]  Prosenjit Gupta,et al.  Efficient geometric algorithms for workpiece orientation in 4- and 5-axis NC machining , 1996, Comput. Aided Des..

[14]  Andrew Y. C. Nee,et al.  The application of surface visibility and moldability to parting line generation , 2002, Comput. Aided Des..

[15]  Monique Teillaud,et al.  The computational geometry algorithms library CGAL , 2015, ACCA.

[16]  Sanjay E. Sarma,et al.  Generating 5-axis NC roughing paths directly from a tessellated representation , 2000, Comput. Aided Des..

[18]  Kai Tang,et al.  Optimized sequence planning for multi-axis hybrid machining of complex geometries , 2018, Comput. Graph..

[19]  Deborah J. Medeiros,et al.  Part orientations for CMM inspection using dimensioned visibility maps , 1998, Comput. Aided Des..

[20]  Min Liu,et al.  Computing global visibility maps for regions on the boundaries of polyhedra using Minkowski sums , 2009, Comput. Aided Des..

[21]  Hoda A. ElMaraghy,et al.  Automated accessibility analysis and measurement clustering for CMMs , 2000 .

[22]  Aristides A. G. Requicha,et al.  Accessibility Analysis Using Computer Graphics Hardware , 2000, IEEE Trans. Vis. Comput. Graph..

[23]  Ye Li,et al.  Computing non-visibility of convex polygonal facets on the surface of a polyhedral CAD model , 2007, Comput. Aided Des..

[24]  Guangyu Hou,et al.  Computing axes of rotation for 4-axis CNC milling machine by calculating global visibility map from slice geometry , 2015 .

[25]  Kai Tang,et al.  Maximal intersection of spherical polygons by an arc with applications to 4-axis machining , 2003, Comput. Aided Des..