Finding a guard that sees most and a shop that sells most
From MaRDI portal
Publication:2369935
DOI10.1007/S00454-007-1328-5zbMATH Open1118.52011OpenAlexW3136263486MaRDI QIDQ2369935FDOQ2369935
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
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)
Cited In (19)
- A bicriteria approximation algorithm for the minimum hitting set problem in measurable range spaces
- Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location
- The discrete Voronoi game in \(\mathbb{R}^2\)
- Peeling potatoes near-optimally in near-linear time
- Matching Triangles and Basing Hardness on an Extremely Popular Conjecture
- Title not available (Why is that?)
- Shape matching under rigid motion
- Solving the \(k\)-influence region problem with the GPU
- Structural properties of Voronoi diagrams in facility location problems with continuous demand
- On the overlap area of a disk and a piecewise circular domain
- Probabilistic matching of planar regions
- Translational packing of arbitrary polytopes
- The 1-dimensional discrete Voronoi game
- Optimal strategies for the one-round discrete Voronoi game on a line
- Maximum Neighbour Voronoi Games
- Geometric optimization and sums of algebraic functions
- Approximating the maximum overlap of polygons under translation
- Maximizing the area of overlap of two unions of disks under rigid motion
- Overlap of convex polytopes under rigid motion
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)
