Sciweavers

SODA
2004
ACM
82views Algorithms» more  SODA 2004»
14 years 10 days ago
On 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 having approximately the largest visibility polygon inside P, and a nearlinear time algo...
Otfried Cheong, Alon Efrat, Sariel Har-Peled