From 0eedbb34a461e6da98b3cb92b1a5b50988c75cc4 Mon Sep 17 00:00:00 2001
From: Sajied Shah Yousuf <40203390+meSajied@users.noreply.github.com>
Date: Sat, 30 May 2020 20:57:45 +0600
Subject: [PATCH 1/2] =?UTF-8?q?feat:=20added=20a=20new=20algorithm=20to=20?=
 =?UTF-8?q?find=20whether=20two=20line=20segment=20intersec=E2=80=A6=20(#7?=
 =?UTF-8?q?96)?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

* feat: added a new algorithm to find whether two line segment intersect or not

* fix: cpplint issues

* added documentation.....

* added documentation....

* added documentation...

* added doxygen format....

* fix: comment blocks...

* fix: cpplint issue

* fix: cpplint issues...

* fix: comment spaces...

* fix: additional spaces...

* fix: documentation issue
---
 geometry/line_segment_intersection.cpp | 101 +++++++++++++++++++++++++
 1 file changed, 101 insertions(+)
 create mode 100644 geometry/line_segment_intersection.cpp

diff --git a/geometry/line_segment_intersection.cpp b/geometry/line_segment_intersection.cpp
new file mode 100644
index 000000000..0b5b858d7
--- /dev/null
+++ b/geometry/line_segment_intersection.cpp
@@ -0,0 +1,101 @@
+/**
+ * @file
+ * @brief check whether two line segments intersect each other
+ * or not.
+ */
+#include <iostream>
+
+/**
+ * Define a Point.
+ */
+struct Point {
+    int x;  /// Point respect to x coordinate
+    int y;  /// Point respect to y coordinate
+};
+
+/**
+ * intersect returns true if segments of two line intersects and
+ * false if they do not. It calls the subroutines direction
+ * which computes the orientation.
+ */
+struct SegmentIntersection {
+    inline bool intersect(Point first_point, Point second_point,
+                                    Point third_point, Point forth_point) {
+        int direction1 = direction(third_point, forth_point, first_point);
+        int direction2 = direction(third_point, forth_point, second_point);
+        int direction3 = direction(first_point, second_point, third_point);
+        int direction4 = direction(first_point, second_point, forth_point);
+
+        if ((direction1 < 0 || direction2 > 0) && (direction3 < 0 ||
+                                                            direction4 > 0))
+            return true;
+
+        else if (direction1 == 0 && on_segment(third_point, forth_point,
+                                                                first_point))
+            return true;
+
+        else if (direction2 == 0 && on_segment(third_point, forth_point,
+                                                                second_point))
+            return true;
+
+        else if (direction3 == 0 && on_segment(first_point, second_point,
+                                                                third_point))
+            return true;
+
+        else if (direction3 == 0 && on_segment(first_point, second_point,
+                                                                forth_point))
+            return true;
+
+        else
+            return false;
+    }
+
+   /**
+    * We will find direction of line here respect to @first_point.
+    * Here @second_point and @third_point is first and second points
+    * of the line respectively. we want a method to determine which way a
+    * given angle these three points turns. If returned number is negative,
+    * then the angle is counter-clockwise. That means the line is going to
+    * right to left. We will fount angle as clockwise if the method returns
+    * positive number.
+    */
+    inline int direction(Point first_point, Point second_point,
+                                                    Point third_point) {
+        return ((third_point.x-first_point.x)*(second_point.y-first_point.y))-
+            ((second_point.x-first_point.x) * (third_point.y-first_point.y));
+    }
+
+   /**
+    * This method determines whether a point known to be colinear
+    * with a segment lies on that segment.
+    */
+    inline bool on_segment(Point first_point, Point second_point,
+                                                        Point third_point) {
+        if (std::min(first_point.x, second_point.x) <= third_point.x &&
+            third_point.x <= std::max(first_point.x, second_point.x) &&
+            std::min(first_point.y, second_point.y) <= third_point.y &&
+            third_point.y <= std::max(first_point.y, second_point.y))
+            return true;
+
+        else
+            return false;
+    }
+};
+
+/**
+ * This is the main function to test whether the algorithm is
+ * working well.
+ */
+int main() {
+    SegmentIntersection segment;
+    Point first_point, second_point, third_point, forth_point;
+
+    std::cin >> first_point.x >> first_point.y;
+    std::cin >> second_point.x >> second_point.y;
+    std::cin >> third_point.x >> third_point.y;
+    std::cin >> forth_point.x >> forth_point.y;
+
+    printf("%d", segment.intersect(first_point, second_point, third_point,
+                                    forth_point));
+    std::cout << std::endl;
+}

From 46aba07f2006793af967090b11026f2a2e3ab0fe Mon Sep 17 00:00:00 2001
From: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
Date: Sat, 30 May 2020 14:58:01 +0000
Subject: [PATCH 2/2] updating DIRECTORY.md

---
 DIRECTORY.md | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/DIRECTORY.md b/DIRECTORY.md
index 9fdf260a9..98580ef85 100644
--- a/DIRECTORY.md
+++ b/DIRECTORY.md
@@ -72,6 +72,9 @@
   * [Searching Of Element In Dynamic Array](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/searching_of_element_in_dynamic_array.cpp)
   * [Tree Height](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/dynamic_programming/tree_height.cpp)
 
+## Geometry
+  * [Line Segment Intersection](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/geometry/line_segment_intersection.cpp)
+
 ## Graph
   * [Bfs](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/BFS.cpp)
   * [Bridge Finding With Tarjan Algorithm](https://github.com/TheAlgorithms/C-Plus-Plus/blob/master/graph/bridge_finding_with_tarjan_algorithm.cpp)