OpenSoure_Repos/TheAlgorithms-C-Plus-Plus
1
0
Fork 0
mirror of https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git synced 2023-10-11 13:05:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update geometry/graham_scan_algorithm.cpp

Browse Source 
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
Lajat5 2021-11-08 12:07:37 +05:30 committed by GitHub
parent 47d37586f1
commit ee4cb6352f
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

8
geometry/graham_scan_algorithm.cpp
View File

@ -30,10 +30,10 @@
* Once we have the closed path, the next step is to traverse the path and * Once we have the closed path, the next step is to traverse the path and
* remove concave points on this path using orientation. The first two points in * remove concave points on this path using orientation. The first two points in
* sorted array are always part of Convex Hull. For remaining points, we keep * sorted array are always part of Convex Hull. For remaining points, we keep
*track of recent three points, and find the angle formed by them. Let the three * track of recent three points, and find the angle formed by them. Let the three
*points be prev(p), curr(c) and next(n). If orientation of these points * points be prev(p), curr(c) and next(n). If the orientation of these points
*(considering them in same order) is not counterclockwise, we discard c, * (considering them in the same order) is not counterclockwise, we discard c,
*otherwise we keep it. * otherwise we keep it.
* *
* @author [Lajat Manekar](https://github.com/Lazeeez) * @author [Lajat Manekar](https://github.com/Lazeeez)
* *