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

Otfried Cheong, Alon Efrat, Sariel Har-Peled

Research output: Contribution to conferencePaper

20 Scopus citations

Abstract

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

Original languageEnglish (US)
Pages1091-1100
Number of pages10
StatePublished - Apr 15 2004
EventProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms - New Orleans, LA., United States
Duration: Jan 11 2004Jan 13 2004

Other

OtherProceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms
CountryUnited States
CityNew Orleans, LA.
Period1/11/041/13/04

ASJC Scopus subject areas

  • Software
  • Mathematics(all)

Fingerprint Dive into the research topics of 'On Finding a Guard that Sees Most and a Shop that Sells Most'. Together they form a unique fingerprint.

  • Cite this

    Cheong, O., Efrat, A., & Har-Peled, S. (2004). On Finding a Guard that Sees Most and a Shop that Sells Most. 1091-1100. Paper presented at Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA., United States.