EFFICIENT APPROXIMATION OF CONVEX POLYGONS

DOI10.1142/S0218195900000267zbMath0973.65013OpenAlexW2114490261MaRDI QIDQ4762908

Mario A. Lopez, Shlomo Reisner

Publication date: 9 December 2001

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218195900000267

zbMATH Keywords

convex polygonapproximation algorithms

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (8)

Floating bodies and approximation of convex bodies by polytopes ⋮ Affinely regular polygons as extremals of area functionals ⋮ Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets ⋮ Unnamed Item ⋮ Approximation of convex sets by polytopes ⋮ Hausdorff approximation of convex polygons ⋮ Unnamed Item ⋮ Linear time approximation of 3D convex polytopes

Cites Work

• An isoperimetric inequality for convex polygons and convex sets with the same symmetrals
• Minimum area circumscribing polygons
• Über einige Affinvarianten konvexer Bereiche
• An isoperimetric minimax
• Finding Extremal Polygons
• Volume Ratios and a Reverse Isoperimetric Inequality
• Finding the smallest triangles containing a given convex polygon
• Circumscribing a convex polygon by a polygon of fewer sides with minimal area addition
• An optimal algorithm for finding minimal enclosing triangles
• Determining the minimum-area encasing rectangle for an arbitrary closed curve
• [https://portal.mardi4nfdi.de/wiki/Publication:5728818 �ber die konvexe H�lle von n zuf�llig gew�hlten Punkten]

This page was built for publication: EFFICIENT APPROXIMATION OF CONVEX POLYGONS