scientific article; zbMATH DE number 6469255

MaRDI QIDQ5501374zbMATH OpenFDO

Authors Otfried Cheong, Alon Efrat, Sariel Har-Peled

Publication date 3 August 2015

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Finding a guard that sees most and a shop that sells most
• The clever shopper problem
• The clever shopper problem
• THE TWO GUARDS PROBLEM
• The chain store paradox
• How to guard an art gallery and other discrete mathematical adventures
• Optimum placement of guards
• Optimal Guard Placement Problem Under L-Visibility
• On Some City Guarding Problems
• Optimal strategies for patrolling fences

Cited in

(7)

• Facility location problems in the plane based on reverse nearest neighbor queries
• Finding a guard that sees most and a shop that sells most
• Maximizing the guarded boundary of an Art Gallery is APX-complete
• Shape Matching by Random Sampling
• Shape matching by random sampling
• The one-round Voronoi game replayed
• Maximizing the overlap of two planar convex sets under rigid motions

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501374)