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

Otfried Cheong, Alon Efrat, Sariel Har-Peled

Research output: Chapter in Book/Report/Conference proceedingConference contribution

19 Citations (Scopus)

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)
Title of host publicationProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms
Pages1091-1100
Number of pages10
Volume15
StatePublished - 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

Fingerprint

Visibility
Simple Polygon
Voronoi
Linear-time Algorithm
Point Sets
Polygon
Intersection
Maximise

ASJC Scopus subject areas

  • Software
  • Discrete Mathematics and Combinatorics
  • Safety, Risk, Reliability and Quality
  • Chemical Health and Safety

Cite this

Cheong, O., Efrat, A., & Har-Peled, S. (2004). On Finding a Guard that Sees Most and a Shop that Sells Most. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms (Vol. 15, pp. 1091-1100)

On Finding a Guard that Sees Most and a Shop that Sells Most. / Cheong, Otfried; Efrat, Alon; Har-Peled, Sariel.

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 15 2004. p. 1091-1100.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Cheong, O, Efrat, A & Har-Peled, S 2004, On Finding a Guard that Sees Most and a Shop that Sells Most. in Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. vol. 15, pp. 1091-1100, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA., United States, 1/11/04.
Cheong O, Efrat A, Har-Peled S. On Finding a Guard that Sees Most and a Shop that Sells Most. In Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 15. 2004. p. 1091-1100
Cheong, Otfried ; Efrat, Alon ; Har-Peled, Sariel. / On Finding a Guard that Sees Most and a Shop that Sells Most. Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Vol. 15 2004. pp. 1091-1100
@inproceedings{d0e6c4e19f53415a9c5cedcb6c36a908,
title = "On Finding a Guard that Sees Most and a Shop that Sells Most",
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.",
author = "Otfried Cheong and Alon Efrat and Sariel Har-Peled",
year = "2004",
language = "English (US)",
volume = "15",
pages = "1091--1100",
booktitle = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

}

TY - GEN

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

AU - Cheong, Otfried

AU - Efrat, Alon

AU - Har-Peled, Sariel

PY - 2004

Y1 - 2004

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=1842538784&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=1842538784&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:1842538784

VL - 15

SP - 1091

EP - 1100

BT - Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

ER -