Pages that link to "Item:Q2369935"

The following pages link to Finding a guard that sees most and a shop that sells most (Q2369935):

Displayed 17 items.

• Optimal strategies for the one-round discrete Voronoi game on a line (Q386423) ‎ (← links)
• Overlap of convex polytopes under rigid motion (Q390361) ‎ (← links)
• Approximating the maximum overlap of polygons under translation (Q527417) ‎ (← links)
• Maximizing Voronoi regions of a set of points enclosed in a circle with applications to facility location (Q655203) ‎ (← links)
• Translational packing of arbitrary polytopes (Q1005325) ‎ (← links)
• Probabilistic matching of planar regions (Q1037777) ‎ (← links)
• The discrete Voronoi game in \(\mathbb{R}^2\) (Q1616243) ‎ (← links)
• On the overlap area of a disk and a piecewise circular domain (Q1725599) ‎ (← links)
• Shape matching under rigid motion (Q1947970) ‎ (← links)
• The 1-dimensional discrete Voronoi game (Q2294280) ‎ (← links)
• Solving the \(k\)-influence region problem with the GPU (Q2629989) ‎ (← links)
• MAXIMIZING THE AREA OF OVERLAP OF TWO UNIONS OF DISKS UNDER RIGID MOTION (Q3405970) ‎ (← links)
• Structural Properties of Voronoi Diagrams in Facility Location Problems with Continuous Demand (Q3453339) ‎ (← links)
• Maximum Neighbour Voronoi Games (Q3605489) ‎ (← links)
• Matching Triangles and Basing Hardness on an Extremely Popular Conjecture (Q4571929) ‎ (← links)
• Peeling Potatoes Near-Optimally in Near-Linear Time (Q5363383) ‎ (← links)
• Geometric optimization and sums of algebraic functions (Q5501958) ‎ (← links)