Convex Hull

buet.ac.bd

Convex Hull

• Let S={s[0],s[1],……,s[n‐1]}

be a set of n distinct points

in the Euclidean space.

• The convex hull of S is the

minimal convex region

that contains every point

of S.

• So the convex hull of S is a

convex polygon whose

vertices are points of S.

More magazines by this user
Similar magazines