Finding the smallest triangles containing a given convex polygon
From MaRDI portal
Publication:3697817
DOI10.1016/0196-6774(85)90005-7zbMath0577.52003OpenAlexW2069047468MaRDI QIDQ3697817
Victor Klee, Michael Chris Laskowski
Publication date: 1985
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(85)90005-7
local minimumconvex polygonpolynomial algorithmHausdorff distanceanchored triangletriangles of minimum area
Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Convex sets in (2) dimensions (including convex curves) (52A10) Polytopes and polyhedra (52Bxx)
Related Items (30)
A polynomial solution for the Potato-peeling problem ⋮ Finding minimal enclosing boxes ⋮ On the complexity of some basic problems in computational convexity. I. Containment problems ⋮ Largest \(j\)-simplices in \(n\)-polytopes ⋮ An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest ⋮ A B-spline basis for \(C^1\) quadratic splines on triangulations with a 10-split ⋮ AN OPTIMAL PARALLEL ALGORITHM FOR FINDING THE SMALLEST ENCLOSING TRIANGLE ON A MESH-CONNECTED COMPUTER∗ ⋮ On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees ⋮ Parallel computational geometry ⋮ Optimizing Squares Covering a Set of Points ⋮ Minimum-area enclosing triangle with a fixed angle ⋮ Construction and analysis of cubic Powell-Sabin B-splines ⋮ Separating Bichromatic Point Sets by Minimal Triangles with a Fixed Angle ⋮ Polynomial-time approximation of largest simplices in \(V\)-polytopes. ⋮ An algorithm to find maximum area polygons circumscribed about a convex polygon ⋮ \(\mathcal{C}^1\) cubic splines on Powell-Sabin triangulations ⋮ ON COMPUTING ENCLOSING ISOSCELES TRIANGLES AND RELATED PROBLEMS ⋮ A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane ⋮ Optimizing squares covering a set of points ⋮ Minimum vertex hulls for polyhedral domains ⋮ Translating a convex polygon to contain a maximum number of points. ⋮ Implementation of linear minimum area enclosing triangle algorithm. Application note ⋮ Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes ⋮ Approximation of convex sets by polytopes ⋮ Optimal placement of convex polygons to maximize point containment ⋮ Computing shortest transversals ⋮ Extremal convex polygons inscribed in a given convex polygon ⋮ Minimum area circumscribing polygons ⋮ Finding minimal convex nested polygons ⋮ EFFICIENT APPROXIMATION OF CONVEX POLYGONS
This page was built for publication: Finding the smallest triangles containing a given convex polygon
