Finding a guard that sees most and a shop that sells most

DOI10.1007/S00454-007-1328-5MaRDI QIDQ2369935zbMATH OpenOpenAlexFDO

Authors Sariel Har-Peled, Otfried Cheong, Alon Efrat

Publication date 21 June 2007

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-007-1328-5

Mathematics Subject Classification ID

Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 6469255
• Guarding galleries and terrains
• Optimum placement of guards
• scientific article; zbMATH DE number 2077120
• Locating guards for visibility coverage of polygons

Cited in

(22)

• Translational packing of arbitrary polytopes
• Probabilistic matching of planar regions
• The discrete Voronoi game in \(\mathbb{R}^2\)
• On the overlap area of a disk and a piecewise circular domain
• Shape matching under rigid motion
• The 1-dimensional discrete Voronoi game
• Solving the \(k\)-influence region problem with the GPU
• Maximizing the area of overlap of two unions of disks under rigid motion
• Structural properties of Voronoi diagrams in facility location problems with continuous demand
• Maximum Neighbour Voronoi Games
• Optimal strategies for the one-round discrete Voronoi game on a line
• Overlap of convex polytopes under rigid motion
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
• Approximating the maximum overlap of polygons under translation
• Peeling potatoes near-optimally in near-linear time
• scientific article; zbMATH DE number 6469255 (Why is no real title available?)
• Geometric optimization and sums of algebraic functions
• Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
• A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
• Optimizing visibility-based search in polygonal domains
• Deterministic 3SUM-hardness
• The maximum cover with rotating field of view

This page was built for publication: Finding a guard that sees most and a shop that sells most

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