scientific article; zbMATH DE number 871906

zbMATH Open0848.68044MaRDI QIDQ4875175FDOQ4875175

Authors: Daniel Scharstein, Matthew T. Dickerson 

Publication date: 28 April 1996

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

containing regions

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Cited In (11)

• Offset-polygon annulus placement problems
• Capturing points with a rotating polygon (and a 3D extension)
• Largest placement of one convex polygon inside another
• Offset-polygon annulus placement problems
• Covering points with a polygon
• Optimal space coverage with white convex polygons
• Placing two axis-parallel squares to maximize the number of enclosed points
• On Finding a Better Position of a Convex Polygon Inside a Circle to Minimize the Cutting Cost
• Title not available (Why is that?)
• Translating a convex polygon to contain a maximum number of points.
• Title not available (Why is that?)

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)