From f2f69234961c49ae4708b5123d90dd433761f2a6 Mon Sep 17 00:00:00 2001
From: Lajat5 <64376519+Lazeeez@users.noreply.github.com>
Date: Mon, 8 Nov 2021 23:10:06 +0530
Subject: [PATCH] Update graham_scan_functions.hpp

---
 geometry/graham_scan_functions.hpp | 18 +++++++++---------
 1 file changed, 9 insertions(+), 9 deletions(-)

diff --git a/geometry/graham_scan_functions.hpp b/geometry/graham_scan_functions.hpp
index a97b98493..1bdcd886d 100644
--- a/geometry/graham_scan_functions.hpp
+++ b/geometry/graham_scan_functions.hpp
@@ -1,8 +1,8 @@
 /******************************************************************************
  * @file
  * @brief Implementation of the [Convex
- *Hull](https://en.wikipedia.org/wiki/Convex_hull) implementation using [Graham
- *Scan](https://en.wikipedia.org/wiki/Graham_scan)
+ * Hull](https://en.wikipedia.org/wiki/Convex_hull) implementation using [Graham
+ * Scan](https://en.wikipedia.org/wiki/Graham_scan)
  * @details
  * In geometry, the convex hull or convex envelope or convex closure of a shape
  * is the smallest convex set that contains it. The convex hull may be defined
@@ -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 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 orientation of these points
+ * (considering them in same order) is not counterclockwise, we discard c,
+ * otherwise we keep it.
  *
  * @author [Lajat Manekar](https://github.com/Lazeeez)
  *