Convex Hull Jarvis March(Gift wrapping algorithm)

Описание к видео Convex Hull Jarvis March(Gift wrapping algorithm)

the convex hull or convex envelope of a set X of points in the Euclidean plane or in a Euclidean space (or, more generally, in an affine space over the reals) is the smallest convex set that contains X. For instance, when X is a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around X.

https://github.com/mission-peace/inte...
https://leetcode.com/problems/erect-t...

Комментарии

Информация по комментариям в разработке

Похожие видео