Updated with current version

Author: Chillee

content/geometry/HalfPlane.h

@@ -40,11 +40,7 @@ vector<P> halfPlaneIntersection(vector<Line> vs) {
 		while (i!=n && ah<at && sideOf(sp(vs[i]),ans[ah])<0) ah++;
 		auto res = lineInter(sp(vs[i]), sp(deq[at]));
 		if (res.first != 1) continue;
-		mxErr1 = max(mxErr1, (lineDist(sp(vs[i]), res.second)));
-		mxErr2 = max(mxErr2, (lineDist(sp(vs[i]), lineInter2(sp(vs[i]), sp(deq[at])))));
-		assert((res.second - lineInter2(sp(vs[i]), sp(deq[at]))).dist() < 1e-8);
-		// ans[at++] = res.second;
-		ans[at++] = lineInter2(sp(vs[i]), sp(deq[at]));
+		ans[at++] = res.second;
 		deq[at] = vs[i];
 	}
 	if (at - ah <= 2) return {};

content/geometry/lineDistance.h

@@ -10,7 +10,7 @@ Returns the signed distance between point p and the line containing points a and
 \begin{minipage}{15mm}
 \includegraphics[width=\textwidth]{content/geometry/lineDistance}
 \end{minipage}
- * Status: tested 
+ * Status: tested
  */
 #pragma once
 

content/geometry/lineIntersection.h

@@ -5,8 +5,10 @@
  * Source: https://vlecomte.github.io/cp-geo.pdf
  * Description:\\
 \begin{minipage}{75mm}
-If a unique intersection point of the lines going through s1,e1 and s2,e2 exists {1, point} is returned. If no intersection point exists {0, (0,0)} is returned and if infinitely many exists {-1, (0,0)} is returned. The wrong position will be returned if P is Point<ll> and the intersection point does not have integer coordinates. Products of three coordinates are used in intermediate steps so watch out for overflow if using int or long long.
-\end{minipage}
+If a unique intersection point of the lines going through s1,e1 and s2,e2 exists {1, point} is returned. If no
+intersection point exists {0, (0,0)} is returned and if infinitely many exists {-1, (0,0)} is returned. The wrong
+position will be returned if P is Point<ll> and the intersection point does not have integer coordinates. Products of
+three coordinates are used in intermediate steps so watch out for overflow if using int or long long. \end{minipage}
 \begin{minipage}{15mm}
 \includegraphics[width=\textwidth]{content/geometry/lineIntersection}
 \end{minipage}
@@ -20,17 +22,13 @@ If a unique intersection point of the lines going through s1,e1 and s2,e2 exists
 
 #include "Point.h"
 
-template<class P>
-pair<int, P> lineInter(P s1, P e1, P s2, P e2) {
-	auto d = (e1-s1).cross(e2-s2);
-	if (d == 0)  //if parallel
-		return {-(s1.cross(e1, s2)==0 || s2==e2), P(0,0)};
-	else
-		return {1, s2-(e2-s2)*s1.cross(e1, s2)/d};
-}
+template <class P> pair<int, P> lineInter(P s1, P e1, P s2, P e2) {
+    auto d = (e1 - s1).cross(e2 - s2);
+    if (d == 0) // if parallel
+        return {-(s1.cross(e1, s2) == 0 || s2 == e2), P(0, 0)};
+    else {
 
-template<class P> P lineInter2(P p1, P p2, P q1, P q2) {
-    double a1 = q1.cross(q2, p1), a2 = -q1.cross(q2, p2);
-    auto res = (p1 * a2 + p2 * a1) / (a1 + a2);
-	return res;
+        double a1 = s2.cross(e2, s1), a2 = -s2.cross(e2, e1);
+        return {1, (s1 * a2 + e1 * a1) / (a1 + a2)};
+    }
 }