Convex Hull: Starting with graph algorithms for interviews
Автор: Gaurav Sen
Загружено: 2018-10-27
Просмотров: 54037
Описание:
What is the convex hull of n points? It is the smallest set of points which completely cover all the n points in such a way that all two points have their joining segment inside the polygon. The convex hull algorithm is a graph algorithm sometimes asked as an interview question.
This graph algorithm is difficult to come up with during an interview, and hence requires some practise beforehand.
The graham scan method is very efficient for the convex hull graph algorithm. Aman helps us understand the intricacies of the algorithm.
ICPC question: https://www.codechef.com/ACM16CHN/pro...
Convex Hull references:
https://brilliant.org/wiki/convex-hull/
http://mathworld.wolfram.com/ConvexHu...
https://www.geeksforgeeks.org/convex-...
https://en.wikipedia.org/wiki/Convex_...
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
