mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
Update geometry/graham_scan_algorithm.cpp
Co-authored-by: David Leal <halfpacho@gmail.com>
This commit is contained in:
parent
bfe80a05c7
commit
47d37586f1
@ -22,9 +22,9 @@
|
||||
* 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
|
||||
|
Loading…
Reference in New Issue
Block a user