برمجة خوارزميات Convex Hull حسب المطلوب في السؤال

لغه البايثون

برنامج anaconda spyder

هذا المطلوب وعندي الاتفاق سيتم ارسال البيانات التي سيتم العمل عليها

Design data structures: present three data structure including tree for a big data (given data), for computational geometry algorithms. In this project you will implement and analyze the following.

- Convex Hull: Implement several versions of the convex hull algorithm: (a) the divide and conquer version, (b) the Graham Scan version, (c) the version in which a preprocessing step removes all points in the extremal quadrilateral, and ( d) a convex hull algorithm when the input is not a set of points but a nonconvex polygon. Have a GUI where one can insert new points (for (d), the user can add a new vertex to the input polygon) and the application recalculates the hull. Compare the performances of all algorithms. data

على ان يتم نهاية الحل شرح كامل الحل فيديو