Adaptive algorithms for planar convex hull problems

DOI10.1007/978-3-642-14553-7_30MaRDI QIDQ3587363zbMATH OpenOpenAlexFDO

Authors Hee-Kap Ahn, Yoshio Okamoto

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_30

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55)

Recommendations

• scientific article; zbMATH DE number 2089211
• Synergistic solutions for merging and computing planar convex hulls
• The Ultimate Planar Convex Hull Algorithm?
• Self-improving algorithms for convex hulls
• On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm

Cited in

(3)

• scientific article; zbMATH DE number 5722792 (Why is no real title available?)
• scientific article; zbMATH DE number 4216876 (Why is no real title available?)
• scientific article; zbMATH DE number 2089211 (Why is no real title available?)

This page was built for publication: Adaptive algorithms for planar convex hull problems

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