On the minimum perimeter triangle enclosing a convex polygon
From MaRDI portal
Publication:5897091
Recommendations
- Implementation of linear minimum area enclosing triangle algorithm. Application note
- Efficient algorithm for computing the triangle maximizing the length of its smallest side inside a convex polygon
- A new linear convex hull algorithm for simple polygons (Corresp.)
- Minimum-area enclosing triangle with a fixed angle
- A note on lower bounds for the maximum area and maximum perimeter k-gon problems
Cited in
(13)- Minimum-perimeter enclosures
- An estimation of the perimeter of a geodesic triangle on a strictly convex surface
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- The inpolygon with minimal area and the cirenmpolygon
- Finding a Hausdorff Core of a Polygon: On Convex Polygon Containment with Bounded Hausdorff Distance
- Separating bichromatic point sets by minimal triangles with a fixed angle
- scientific article; zbMATH DE number 6963692 (Why is no real title available?)
- Finding the smallest triangles containing a given convex polygon
- Scandinavian thins on top of cake: new and improved algorithms for stacking and packing
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- Isoperimetric triangular enclosures with a fixed angle
- scientific article; zbMATH DE number 6938032 (Why is no real title available?)
- Extremal polygons with minimal perimeter
This page was built for publication: On the minimum perimeter triangle enclosing a convex polygon
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5897091)