Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
DOI10.1016/J.COMGEO.2005.06.001zbMATH Open1137.68608OpenAlexW1996942467MaRDI QIDQ2489540FDOQ2489540
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
Recommendations
Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Computational aspects related to convexity (52B55)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Tubes and Spheres in n-Spaces, and a Class of Statistical Problems
- Title not available (Why is that?)
- Faster core-set constructions and data stream algorithms in fixed dimensions
- Approximating extent measures of points.
- Title not available (Why is that?)
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Approximation of convex bodies by axially symmetric bodies
- Approximation of convex bodies by rectangles
- Title not available (Why is that?)
- Computing the maximum overlap of two convex polygons under translations
- Computing the extreme distances between two convex polygons
- Correction to metric entropy of some classes of sets with differentiable boundaries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Sublinear geometric algorithms
- EFFICIENT APPROXIMATION OF CONVEX POLYGONS
- Axially symmetric polygons inscribed in and circumscribed about convex sets
Cited In (12)
- Finding largest rectangles in convex polygons
- Maximizing the overlap of two planar convex sets under rigid motions
- Aligning two convex figures to minimize area or perimeter
- Largest area parallelogram inside a digital object in a triangular grid
- Approximation of convex bodies by axially symmetric bodies
- Computing and Combinatorics
- Inner and outer approximation of convex sets using alignment
- Largest inscribed rectangles in convex polygons
- Largest unit rectangles inscribed in a convex polygon
- Approximating a planar convex set using a sparse grid
- Geometric optimization and sums of algebraic functions
- 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)
