Finding minimal convex nested polygons
From MaRDI portal
Publication:1822960
DOI10.1016/0890-5401(89)90049-7zbMath0679.68068OpenAlexW2017400043MaRDI QIDQ1822960
Heather Booth, Subhash Suri, Alok Aggarwal, Joseph O'Rourke, Chee-Keng Yap
Publication date: 1989
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0890-5401(89)90049-7
Analysis of algorithms and problem complexity (68Q25) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Computing minimum length paths of a given homotopy class ⋮ Nonnegative Matrix Factorization Requires Irrationality ⋮ SOME LOWER BOUNDS ON GEOMETRIC SEPARABILITY PROBLEMS ⋮ On the complexity of approximating and illuminating three-dimensional convex polyhedra ⋮ Separation and approximation of polyhedral objects ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces ⋮ Deconstructing approximate offsets ⋮ Analytical enclosure of the set of solutions of the three-species multivariate curve resolution problem ⋮ Sparse convex hull coverage ⋮ On the geometric interpretation of the nonnegative rank ⋮ COMPUTING LARGEST CIRCLES SEPARATING TWO SETS OF SEGMENTS ⋮ An approximate algorithm for the minimal vertex nested polygon problem ⋮ Fixed points of the EM algorithm and nonnegative rank boundaries ⋮ Query-Points Visibility Constraint Minimum Link Paths in Simple Polygons
Cites Work
- Unnamed Item
- Minimum polygonal separation
- Minimum area circumscribing polygons
- Finding the smallest triangles containing a given convex polygon
- Finding minimal enclosing boxes
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
- An optimal algorithm for finding minimal enclosing triangles
