Скачать или смотреть Convex Hull problem by Brute Force approach - Dr A Viji Amutha Mary

A set of points in a plane is called convex if for any two points p and q in the set, the entire line segment with the endpoints at p and q belongs to the set.
Convex Hull:
The convex hull is the smallest convex set that encloses all the points, forming a convex polygon. This polygon connects the outermost points in the sample and all whose inner angles are less than 180 degrees. Informally it is the shape formed by a rubber band wrapped around a set of nails. Using formulas, we can determine if two points are on the boundary, below or above the boundary to the convex hull. The convex hull algorithm is explained in detail with a suitable example.
Applications:
The Convex Hull Algorithm is used to find the convex hull of a set of points in computational geometry.
This algorithm is important in various applications such as Image Processing, Route Planning, Object Modeling, Mathematics, Statistics, Combinatorial Optimization, Economics, Geometric Modelling and Ethology (To Estimate the Extent of Occurrence for Species)
The algorithm takes cubic time complexity when using the brute force approach.
#sist #sathyabama #convexset #convexhull #examples #algorithm #outermostpoints #connect #applications #timecomplexity