Gift Wrapper/Jarvis March Algorithm Demonstration in Java - With Steps
Автор: Brandon Conrady
Загружено: 2024-08-06
Просмотров: 1402
Описание:
The goal of this algorithm is to take a set of points and find the smallest shape that encloses all points. It does this by starting at the leftmost point, checking every other point for the one that is most clockwise, then adding that point, then finding the point most clockwise to that point... so on until it returns to that starting point.
The code was written fully in Java, and the GUI uses the Java Swing library to animate the steps this algorithm takes. Compare this to another algorithm that solves this same problem - Graham Scan. This algorithm is comparatively slow and gets slower much faster compared to Graham Scan as the number of points grows.
Повторяем попытку...
Доступные форматы для скачивания:
Скачать видео
-
Информация по загрузке:
![Почему работает теория шести рукопожатий? [Veritasium]](https://image.4k-video.ru/id-video/ggI1xKzoANs)
