Covering points with a polygon

DOI10.1016/J.COMGEO.2007.05.001MaRDI QIDQ2477192zbMATH OpenOpenAlexFDO

Authors Gill Barequet, Matthew T. Dickerson, Yuval Scharf

Publication date 13 March 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2007.05.001

zbMATH Keywords

geometric matching problemsoptimizationtolerancing

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Offset polygon and annulus placement problems
• Capturing points with a rotating polygon (and a 3D extension)
• 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

Cites work

• Computing the smallest k-enclosing circle and related problems
• Extremal polygon containment problems
• scientific article; zbMATH DE number 741008 (Why is no real title available?)
• scientific article; zbMATH DE number 1033560 (Why is no real title available?)
• scientific article; zbMATH DE number 797435 (Why is no real title available?)
• scientific article; zbMATH DE number 6472585 (Why is no real title available?)
• Iterated nearest neighbors and finding minimal polytopes
• Offset-polygon annulus placement problems
• Optimal placement of convex polygons to maximize point containment
• Optimizing a constrained convex polygonal annulus
• The Ultimate Planar Convex Hull Algorithm?
• Translating a convex polygon to contain a maximum number of points.

Cited in

(8)

• Covering a convex polygon by triangles
• Does a point lie inside a polygon ?
• Capturing points with a rotating polygon (and a 3D extension)
• Isoperimetric triangular enclosures with a fixed angle
• Selecting Heavily Covered Points
• Spherical coverage verification
• Mapping a Polygon with Holes Using a Compass
• Planar expropriation problem with non-rigid rectangular facilities

This page was built for publication: Covering points with a polygon

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2477192)