Description: gram Method convex hull, convex hull is a straight line between any two points within the region do not intersect with the boundary simple closed area. gram algorithm can efficiently solve a convex point set
To Search:
- [Gramham-CH] - Gramham method convex hull. Data from th
- [Convex] - Kofgfdgdhgfdhdhgh g
File list (Check if you may need any files):
convex.cpp
Download