Computing and Combinatorics

DOI10.1007/B99243MaRDI QIDQ4681184zbMATH OpenOpenAlexFDO

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

Publication date 15 June 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99243

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Largest inscribed rectangles in convex polygons
• scientific article; zbMATH DE number 177850
• Finding largest rectangles in convex polygons
• EFFICIENT APPROXIMATION OF CONVEX POLYGONS

Cited in

(4)

• Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets
• Approximation of convex sets by polytopes
• Largest inscribed rectangles in convex polygons
• Scandinavian thins on top of cake: new and improved algorithms for stacking and packing

This page was built for publication: Computing and Combinatorics

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