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

DOI10.1016/S0925-7721(96)00011-9zbMath1133.52304OpenAlexW2045156582MaRDI QIDQ2482905

Petru Pau, Gill Barequet, Matthew T. Dickerson

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)

Related Items (11)

A mixed integer formulation for maximal covering by inclined parallelograms ⋮ Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ Solution methodologies for minimizing a sum of pointwise minima of two functions ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Covering points with a polygon ⋮ Capturing points with a rotating polygon (and a 3D extension) ⋮ Optimizing a constrained convex polygonal annulus ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ Optimal placement of convex polygons to maximize point containment ⋮ Minimizing Sum of Truncated Convex Functions and Its Applications ⋮ Offset-polygon annulus placement problems

Cites Work

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

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