Regular Steiner polygons

DOI10.1016/S0893-9659(98)00100-1MaRDI QIDQ1808576zbMATH OpenOpenAlexFDO

Authors Mark J. Kaiser

Publication date 25 November 1999

Published in Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0893-9659(98)00100-1

zbMATH Keywords

approximationareahexagonoctagonSteiner pointsymmetric difference

Mathematics Subject Classification ID

Approximation by convex sets (52A27) Inequalities and extremum problems involving convexity in convex geometry (52A40)

Review text

Let a convex polygon \(P\) be approximated by a regular polygon \(R_n\) with \(n\) sides such that the area of their symmetric difference, i.e. the region that belongs to exactly one of them, is as small as possible. The author further assumes \(R_n\) to have the same perimeter as \(P\). He does not discuss the orientation of \(R_n\) and so is left with an extremal problem whose only variable is the centre \(I\) of \(R_n\) which he calls generalized Steiner point of \(P\). He gives two methods for computing the area of the symmetric difference and approximates the optimal position for an octagon and for a hexagon by computer in a few seconds.

Recommendations

• scientific article; zbMATH DE number 177850
• scientific article; zbMATH DE number 3867938
• Approximation of convex discs by polygons
• scientific article; zbMATH DE number 4098747

Cites work

• scientific article; zbMATH DE number 4022030 (Why is no real title available?)
• scientific article; zbMATH DE number 967594 (Why is no real title available?)
• On the deterministic and stochastic approximation of regions
• The Steiner Point of a Convex Polytope

Cited in

(1)

• Regular triangulations and Steiner points

This page was built for publication: Regular Steiner polygons

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