scientific article; zbMATH DE number 871906

MaRDI QIDQ4875175zbMATH OpenFDO

Authors Daniel Scharstein, Matthew T. Dickerson

Publication date 28 April 1996

zbMATH Keywords

containing regions

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

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 1947380
• scientific article; zbMATH DE number 1766719
• scientific article; zbMATH DE number 1822170

Cited in

(13)

• Optimal placement of convex polygons to maximize point containment
• Offset-polygon annulus placement problems
• Largest placement of one convex polygon inside another
• Capturing points with a rotating polygon (and a 3D extension)
• Covering points with a polygon
• Translating a convex polygon to contain a maximum number of points.
• Placing two axis-parallel squares to maximize the number of enclosed points
• Optimal space coverage with white convex polygons
• On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
• scientific article; zbMATH DE number 1947380 (Why is no real title available?)
• scientific article; zbMATH DE number 1766719 (Why is no real title available?)
• Offset-polygon annulus placement problems
• Convex polygon containment: improving quadratic to near linear time

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