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

clang-format and clang-tidy fixes for ee4cb635

Browse Source
This commit is contained in:
github-actions 2021-11-08 06:38:30 +00:00
parent ee4cb6352f
commit ef83af8370
1 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

14
geometry/graham_scan_algorithm.cpp
View File

@ -22,18 +22,18 @@
* points be sorting them with respect to the bottom-most point. Once the points
* are sorted, they form a simple closed path.
* The sorting criteria is to use the orientation to compare angles without
* actually computing them (See the compare() function below) because computation
* of actual angles would be inefficient since trigonometric functions are not
* simple to evaluate.
* actually computing them (See the compare() function below) because
*computation of actual angles would be inefficient since trigonometric
*functions are not simple to evaluate.
*
* Accept or Reject Points
* 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
* 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
* points be prev(p), curr(c) and next(n). If the orientation of these points
* (considering them in the same order) is not counterclockwise, we discard c,
* otherwise we keep it.
* 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 the orientation of these
*points (considering them in the same order) is not counterclockwise, we
*discard c, otherwise we keep it.
*
* @author [Lajat Manekar](https://github.com/Lazeeez)
*