Aperture angle optimization problems

Let P and Q be two disjoint convex polygons in the plane with m and n vertices, respectively. Given a point x in P, the aperture angle of x with respect to Q is deened as the angle subtended by the cone that contains Q, has apex at x, and has its two rays emanating from x tangent to Q. We present algorithms with complexities O(n logm) and O(n+m) for computing the maximum aperture angle with respect to Q when x is allowed to vary in P. To compute the minimum aperture angle we modify the latter algorithm obtaining an O(n + m) algorithm. In fact, this is optimal as we show that (maxfm; ng) is a lower bound for the minimization problem. Finally, we establish an (n) time lower bound for the maximization problem.

[1]  Cregg K. Cowan Model-based synthesis of sensor location , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[2]  Shaun Ault,et al.  Analytic Geometry and Calculus , 1938, Nature.

[3]  T. Shermer Recent Results in Art Galleries , 1992 .

[4]  Leonidas J. Guibas,et al.  The Floodlight Problem , 1997, Int. J. Comput. Geom. Appl..

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

[6]  Alan Burns The Polygon Trail. , 1982 .

[7]  Godfried T. Toussaint,et al.  Convex Hulls for Random Lines , 1993, J. Algorithms.

[8]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[9]  James H. McKay,et al.  Analytic geometry and calculus , 1961 .