Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets

DOI10.1016/J.COMGEO.2005.06.001MaRDI QIDQ2489540zbMATH OpenOpenAlexFDO

Authors Hee-Kap Ahn, Hyeon-Suk Na, Chan-Su Shin, Antoine Vigneron, Peter Brass, Otfried Cheong

Publication date 28 April 2006

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.comgeo.2005.06.001

zbMATH Keywords

ApproximationAxial symmetryShape matching

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)

Recommendations

• Computing and Combinatorics
• scientific article; zbMATH DE number 177850
• scientific article; zbMATH DE number 4206040
• Approximation of convex bodies by axially symmetric bodies
• Finding largest rectangles in convex polygons

Cites work

• scientific article; zbMATH DE number 3160756 (Why is no real title available?)
• scientific article; zbMATH DE number 4206040 (Why is no real title available?)
• scientific article; zbMATH DE number 177850 (Why is no real title available?)
• scientific article; zbMATH DE number 3511136 (Why is no real title available?)
• scientific article; zbMATH DE number 741008 (Why is no real title available?)
• scientific article; zbMATH DE number 3229353 (Why is no real title available?)
• scientific article; zbMATH DE number 3052220 (Why is no real title available?)
• Approximating extent measures of points.
• Approximation of convex bodies by axially symmetric bodies
• Approximation of convex bodies by rectangles
• Axially symmetric polygons inscribed in and circumscribed about convex sets
• Computing the extreme distances between two convex polygons
• Computing the maximum overlap of two convex polygons under translations
• Correction to metric entropy of some classes of sets with differentiable boundaries
• EFFICIENT APPROXIMATION OF CONVEX POLYGONS
• Faster core-set constructions and data stream algorithms in fixed dimensions
• Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
• Sublinear geometric algorithms
• Tubes and Spheres in n-Spaces, and a Class of Statistical Problems

Cited in

(12)

• Largest area parallelogram inside a digital object in a triangular grid
• Approximation of convex bodies by axially symmetric bodies
• Maximizing the overlap of two planar convex sets under rigid motions
• Approximating a planar convex set using a sparse grid
• Computing and Combinatorics
• Geometric optimization and sums of algebraic functions
• Aligning two convex figures to minimize area or perimeter
• Largest unit rectangles inscribed in a convex polygon
• Largest inscribed rectangles in convex polygons
• Finding largest rectangles in convex polygons
• Inner and outer approximation of convex sets using alignment
• Overlap of convex polytopes under rigid motion

This page was built for publication: Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets

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