Finding a Guard that Sees Most and a Shop that Sells Most

We present a near-quadratic time algorithm that computes a point inside a simple polygon P in the plane having approximately the largest visibility polygon inside P, and a near-linear time algorithm for finding the point that will have approximately the largest Voronoi region when added to an n-point set in the plane. We apply the same technique to find the translation that approximately maximizes the area of intersection of two polygonal regions in near-quadratic time, and the rigid motion doing so in near-cubic time.

[1]  Yi Li,et al.  Improved bounds on the sample complexity of learning , 2000, SODA '00.

[2]  Micha Sharir,et al.  On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles , 1986, Discret. Comput. Geom..

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

[4]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[5]  Raimund Seidel,et al.  Maximizing a Voronoi Region: the Convex Case , 2002, Int. J. Comput. Geom. Appl..

[6]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[7]  Gerald Weber,et al.  Matching Convex Shapes with Respect to the Symmetric Difference , 1996, Algorithmica.

[8]  Remco C. Veltkamp,et al.  Maximizing the Area of Overlap of Two Unions of Disks Under Rigid Motion , 2004, SWAT.

[9]  Simeon C. Ntafos,et al.  Optimum Placement of Guards , 1994, Inf. Sci..

[10]  Mark de Berg,et al.  Computing the Maximum Overlap of Two Convex Polygons under Translations , 1996, Theory of Computing Systems.

[11]  Noga Alon,et al.  The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.

[12]  Boris Aronov,et al.  On approximating the depth and related problems , 2005, SODA '05.

[13]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[14]  Jirí Matousek,et al.  The one-round Voronoi game , 2002, SCG '02.

[15]  Sariel Har-Peled,et al.  Guarding galleries and terrains , 2002, Inf. Process. Lett..

[16]  Joseph S. B. Mitchell,et al.  Path planning in 0/1/ weighted regions with applications , 1988, SCG '88.

[17]  Otfried Cheong,et al.  Competitive Facility Location along a Highway , 2001, COCOON.

[18]  Jorge Urrutia,et al.  Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.

[19]  M. Degroot,et al.  Probability and Statistics , 2021, Examining an Operational Approach to Teaching Probability.

[20]  D. Hochbaum,et al.  Analysis of the greedy approach in problems of maximum k‐coverage , 1998 .

[21]  P. Valtr.  Guarding galleries where no point sees a small area , 1998 .

[22]  Otfried Cheong,et al.  Competitive facility location: the Voronoi game , 2004, Theor. Comput. Sci..

[23]  David M. Mount,et al.  On the Area of Overlap of Translated Polygons , 1996, Comput. Vis. Image Underst..

[24]  Chan-Su Shin,et al.  Maximizing the overlap of two planar convex sets under rigid motions , 2005, Symposium on Computational Geometry.