Translating a convex polygon to contain a maximum number of points.

DOI10.1016/S0925-7721(96)00011-9MaRDI QIDQ2482905zbMATH OpenOpenAlexFDO

Authors Gill Barequet, Matthew T. Dickerson, Petru Pau

Publication date 25 April 2008

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0925-7721(96)00011-9

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 871906
• Optimal placement of convex polygons to maximize point containment
• scientific article; zbMATH DE number 1947380
• Computing the maximum overlap of two convex polygons under translations
• Approximating the maximum overlap of polygons under translation

Cites work

• A PARALLEL ALGORITHM FOR ENCLOSED AND ENCLOSING TRIANGLES
• An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
• An optimal algorithm for finding minimal enclosing triangles
• Computing the smallest k-enclosing circle and related problems
• Finding the smallest triangles containing a given convex polygon
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• scientific article; zbMATH DE number 871906 (Why is no real title available?)
• Iterated nearest neighbors and finding minimal polytopes
• New Upper Bounds in Klee’s Measure Problem
• On \(k\)-sets in arrangements of curves and surfaces
• SEQUENTIAL AND PARALLEL ALGORITHMS FOR THE k CLOSEST PAIRS PROBLEM

Cited in

(16)

• Optimal placement of convex polygons to maximize point containment
• Offset-polygon annulus placement problems
• Near-linear time approximation schemes for geometric maximum coverage
• Optimizing a constrained convex polygonal annulus
• A mixed integer formulation for maximal covering by inclined parallelograms
• Capturing points with a rotating polygon (and a 3D extension)
• Covering points with a polygon
• Solution methodologies for minimizing a sum of pointwise minima of two functions
• Placing two axis-parallel squares to maximize the number of enclosed points
• Linear Time Approximation Schemes for Geometric Maximum Coverage
• Minimizing Sum of Truncated Convex Functions and Its Applications
• scientific article; zbMATH DE number 1947380 (Why is no real title available?)
• scientific article; zbMATH DE number 1766719 (Why is no real title available?)
• scientific article; zbMATH DE number 871906 (Why is no real title available?)
• Computing the maximum overlap of two convex polygons under translations
• Title not available (Why is no real title available?)

This page was built for publication: Translating a convex polygon to contain a maximum number of points.

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