From ee4cb6352f00d8902feac689fa1fa2546936bf9f Mon Sep 17 00:00:00 2001 From: Lajat5 <64376519+Lazeeez@users.noreply.github.com> Date: Mon, 8 Nov 2021 12:07:37 +0530 Subject: [PATCH] Update geometry/graham_scan_algorithm.cpp Co-authored-by: David Leal --- geometry/graham_scan_algorithm.cpp | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/geometry/graham_scan_algorithm.cpp b/geometry/graham_scan_algorithm.cpp index be1505517..00bb528a1 100644 --- a/geometry/graham_scan_algorithm.cpp +++ b/geometry/graham_scan_algorithm.cpp @@ -30,10 +30,10 @@ * 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 orientation of these points - *(considering them in 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) *