Optimal Inscribed Polygons in Convex Curves

DOI10.2307/2324583MaRDI QIDQ4713191zbMATH OpenOpenAlexFDO

Authors Donald A. jun. Quarles, John S. Lew

Publication date 25 June 1992

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2324583

zbMATH Keywords

approximation of convex curvesminimization of areapolygonal line

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Approximation by convex sets (52A27)

Recommendations

• Optimal polygonal approximation of digitized curves using the sum of square deviations criterion
• Asymptotic approximation of convex curves
• A dynamical systems approach to the polygonal approximation of plane convex compacts
• An optimal algorithm for polygonal approximation of digitized curves

Cited in

(5)

• The convergence rate of the sandwich algorithm for approximating convex functions
• Asymptotic approximation by quadratic spline curves
• On Convex Curves Which Have Many Inscribed Triangles of Maximum Area
• Solving extremal problems in the case of piecewise smooth approximation of polygons
• A finite descent method for Steiner's problem of inpolygons with minimal circumference

This page was built for publication: Optimal Inscribed Polygons in Convex Curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4713191)