scientific article; zbMATH DE number 1947380

MaRDI QIDQ4411344zbMATH OpenFDO

Authors Torben Hagerup, Rahul Ray, Pankaj K. Agarwal, Micha Sharir, Michiel Smid, Emo Welzl

Publication date 8 July 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2461/24610042.htm

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Approximation algorithms (68W25)

Recommendations

• Optimal placement of convex polygons to maximize point containment
• Translating a convex polygon to contain a maximum number of points.
• scientific article; zbMATH DE number 871906
• scientific article; zbMATH DE number 910876
• Multiple translational containment. II: Exact algorithms

Cited in

(13)

• Optimal placement of convex polygons to maximize point containment
• Near-linear time approximation schemes for geometric maximum coverage
• Computing large planar regions in terrains, with an application to fracture surfaces
• Translating a regular grid over a point set
• Capturing points with a rotating polygon (and a 3D extension)
• Translating a convex polygon to contain a maximum number of points.
• Linear Time Approximation Schemes for Geometric Maximum Coverage
• Union of random Minkowski sums and network vulnerability analysis
• scientific article; zbMATH DE number 871906 (Why is no real title available?)
• Computing Large Planar Regions in Terrains
• A linear time algorithm for the maximum overlap of two convex polygons under translation
• Covering many or few points with unit disks
• Enclosing weighted points with an almost-unit ball

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 Q4411344)