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

• 1 May 2007
• journal article
• Published by Springer Nature in Discrete & Computational Geometry
• Vol. 37  (4) , 545-563
• https://doi.org/10.1007/s00454-007-1328-5

Abstract

Keywords

• QUADRATIC TIME
• SHOP
• APPROXIMATELY
• POLYGON
• GUARD
• TIME ALGORITHM
• INTERSECTION
• LARGEST VORONOI
• LARGEST VISIBILITY