Skip to content

bouhao01/gift_wrapping_convex_hall

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

3 Commits
 
 
 
 
 
 

Repository files navigation

Convex hall: Jarvis’ gift-wrapping algorithm

Compute the convex hall of a set of points

Time complexity = O(n*h)

Where n is the number of input points, and h is size of the convex hall (Output-Sensitive Algorithm)

About

Jarvis’ gift-wrapping algorithm

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

 
 
 

Contributors

Languages