Minimum area circumscribing polygons
From MaRDI portal
Publication:1822239
DOI10.1007/BF01898354zbMATH Open0617.68040OpenAlexW1996940760MaRDI QIDQ1822239FDOQ1822239
Authors: Yanyan Li
Publication date: 1985
Published in: The Visual Computer (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01898354
Recommendations
- Area minimization of special polygons
- The geometry of circumscribing polygons of minimal perimeter
- Circumscribed polygons of small area
- Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
- Cutting circles and polygons from area-minimizing rectangles
- Minimum-perimeter intersecting polygons
- Minimum-perimeter intersecting polygons
- Minimum area of triangle's circumscribed ellipses
- scientific article; zbMATH DE number 3927286
- The inpolygon with minimal area and the cirenmpolygon
Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx) Convex sets in (2) dimensions (including convex curves) (52A10)
Cites Work
Cited In (24)
- Minimum-perimeter enclosures
- An algorithm to find maximum area polygons circumscribed about a convex polygon
- Parallel computational geometry
- Approximation of a closed polygon with a minimum number of circular arcs and line segments
- Stock cutting to minimize cutting length
- Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares
- Minimum area polygons with two reflex angles enclosingkPoints
- Finding minimum area simple pentagons
- The inpolygon with minimal area and the cirenmpolygon
- Finding the maximum bounded intersection of \(k\) out of \(n\) halfplanes
- Minimum Area Venn Diagrams Whose Curves Are Polyominoes
- Title not available (Why is that?)
- Hausdorff approximation of convex polygons
- Geometric applications of a matrix-searching algorithm
- Circumscribed polygons of small area
- Title not available (Why is that?)
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Finding minimal convex nested polygons
- Simultaneous inner and outer approximation of shapes
- An Algorithm to Compute Any Simple $k$-gon of a Maximum Area or Perimeter Inscribed in a Region of Interest
- Title not available (Why is that?)
- Isoperimetric triangular enclosures with a fixed angle
- A hybrid model predictive control scheme for containment and distributed sensing in multi-agent systems
- Title not available (Why is that?)
This page was built for publication: Minimum area circumscribing polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1822239)