Optimal placement of convex polygons to maximize point containment
From MaRDI portal
Publication:1265324
DOI10.1016/S0925-7721(98)00015-7zbMath0904.68175OpenAlexW2050146595MaRDI QIDQ1265324
Daniel Scharstein, Matthew T. Dickerson
Publication date: 28 September 1998
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0925-7721(98)00015-7
Related Items (10)
Optimizing some constructions with bars: new geometric knapsack problems ⋮ A mixed integer formulation for maximal covering by inclined parallelograms ⋮ Linear Time Approximation Schemes for Geometric Maximum Coverage ⋮ Maximizing the overlap of two planar convex sets under rigid motions ⋮ Covering Polygons with Rectangles ⋮ Near-linear time approximation schemes for geometric maximum coverage ⋮ Covering points with a polygon ⋮ Capturing points with a rotating polygon (and a 3D extension) ⋮ Largest empty circle centered on a query line ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons
- On a circle placement problem
- Iterated nearest neighbors and finding minimal polytopes
- Computing the smallest \(k\)-enclosing circle and related problems
- The nesting problem in the leather manufacturing industry
- Translating a convex polygon to contain a maximum number of points.
- 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
- Static and dynamic algorithms for k-point clustering problems
- Offset-polygon annulus placement problems
This page was built for publication: Optimal placement of convex polygons to maximize point containment
