Skip to content

Divide and conquer algorithm for computing convex hulls

Notifications You must be signed in to change notification settings

ravenkls/Convex-Hull

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Convex Hull

In mathematics, the convex hull or convex envelope or convex closure 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.

What I Learnt

  • Using numpy for linear algebra
  • Using matplotlib to visualise what I am doing
  • Thinking graphically to solve the problem

Screenshots

250 Points

2500 Points

25000 Points

100000 Points

About

Divide and conquer algorithm for computing convex hulls

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages