Update geometry-algorithms.md

Author: Rubix982

projects/dali/docs/geometry-algorithms.md

@@ -60,37 +60,45 @@ Each topic above is widely used in contests (ICPC, Codeforces, AtCoder, etc.) an
 
 ## References
 
-### General
-
-- [^1] [^2] [^3] [^4] [^5] [^9] Binary Exponentiation - Algorithms for Competitive Programming <https://cp-algorithms.com/algebra/binary-exp.html>
-- [^6] [^7] [^11] [^12] [^13] Operations on polynomials and series - Algorithms for Competitive Programming <https://cp-algorithms.com/algebra/polynomial.html>
-- [^8] [^15] [^16] [^17] [^18] Discrete Root - Algorithms for Competitive Programming <https://cp-algorithms.com/algebra/discrete-root.html>
-- [^10] Garner's Algorithm - Algorithms for Competitive Programming <https://cp-algorithms.com/algebra/garners-algorithm.html>
-- [^14] Convex hull construction - Algorithms for Competitive Programming <https://cp-algorithms.com/geometry/convex-hull.html>
-
-### Algorithm Based
-
-- [^gcd]: [GCD & Extended Euclidean Algorithm](https://cp-algorithms.com/algebra/euclid.html)  
-- [^binary-exp]: [Binary Exponentiation](https://cp-algorithms.com/algebra/binary-exp.html)  
-- [^sieve]: [Prime Sieve](https://cp-algorithms.com/algebra/sieve-of-eratosthenes.html)  
-- [^factorization]: [Primality & Factorization](https://cp-algorithms.com/algebra/primality_tests.html)  
-- [^mod-inv]: [Modular Inverse](https://cp-algorithms.com/algebra/module-inverse.html)  
-- [^crt]: [Chinese Remainder Theorem](https://cp-algorithms.com/algebra/chinese-remainder-theorem.html)  
-- [^garners]: [Garner's Algorithm](https://cp-algorithms.com/algebra/garners-algorithm.html)  
-- [^discrete-log]: [Discrete Logarithm](https://cp-algorithms.com/algebra/discrete-log.html)  
-- [^bitmask]: [Bitmask Techniques](https://cp-algorithms.com/algebra/all-submasks.html)  
-- [^bigint]: [Arbitrary Precision Arithmetic](https://cp-algorithms.com/algebra/big-integer.html)  
-- [^fft]: [Fast Fourier Transform](https://cp-algorithms.com/algebra/fft.html)  
-- [^poly]: [Polynomial Interpolation](https://cp-algorithms.com/algebra/polynomial.html)  
-- [^poly-series]: [Power Series Operations](https://cp-algorithms.com/algebra/polynomial.html#operations-on-series)  
-- [^gauss]: [Gaussian Elimination](https://cp-algorithms.com/linear_algebra/linear-system-gauss.html)  
-- [^geom-primitives]: [Basic Geometry Primitives](https://cp-algorithms.com/geometry/basic-geometry.html)  
-- [^circle]: [Circle Geometry](https://cp-algorithms.com/geometry/circle-circle-intersection.html)  
-- [^polygon]: [Polygon Geometry](https://cp-algorithms.com/geometry/oriented-triangle-area.html)  
-- [^convex-hull]: [Convex Hull Construction](https://cp-algorithms.com/geometry/convex-hull.html)  
-- [^cht]: [Convex Hull Trick](https://cp-algorithms.com/geometry/convex_hull_trick.html)  
-- [^sweep]: [Closest Pair of Points](https://cp-algorithms.com/geometry/closest-points.html)  
-- [^delaunay]: [Delaunay Triangulation](https://cp-algorithms.com/geometry/delaunay.html)  
-- [^half-plane]: [Half-Plane Intersection](https://cp-algorithms.com/geometry/halfplane-intersection.html)  
-- [^ternary]: [Ternary Search](https://cp-algorithms.com/num_methods/ternary_search.html)  
-- [^dp-opt]: [DP Optimization Techniques](https://cp-algorithms.com/dp/divide-and-conquer-dp.html)  
+[^1]: [1](Binary Exponentiation - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/binary-exp.html)
+[^2]: [2](Binary Exponentiation - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/binary-exp.html)
+[^3]: [3](Binary Exponentiation - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/binary-exp.html)
+[^4]: [4](Binary Exponentiation - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/binary-exp.html)
+[^5]: [5](Binary Exponentiation - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/binary-exp.html)
+[^9]: [9](Binary Exponentiation - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/binary-exp.html)
+[^6]: [6](Operations on polynomials and series - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/polynomial.html)
+[^7]: [7](Operations on polynomials and series - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/polynomial.html)
+[^11]: [11](Operations on polynomials and series - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/polynomial.html)
+[^12]: [12](Operations on polynomials and series - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/polynomial.html)
+[^13]: [13](Operations on polynomials and series - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/polynomial.html)
+[^8]: [8](Discrete Root - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/discrete-root.html)
+[^15]: [15](Discrete Root - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/discrete-root.html)
+[^16]: [16](Discrete Root - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/discrete-root.html)
+[^17]: [17](Discrete Root - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/discrete-root.html)
+[^18]: [18](Discrete Root - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/discrete-root.html)
+[^10]: [10](Garner's Algorithm - Algorithms for Competitive Programming https://cp-algorithms.com/algebra/garners-algorithm.html)
+[^14]: [14](Convex hull construction - Algorithms for Competitive Programming https://cp-algorithms.com/geometry/convex-hull.html)
+[^gcd]: [GCD & Extended Euclidean Algorithm](https://cp-algorithms.com/algebra/euclid.html)  
+[^binary-exp]: [Binary Exponentiation](https://cp-algorithms.com/algebra/binary-exp.html)  
+[^sieve]: [Prime Sieve](https://cp-algorithms.com/algebra/sieve-of-eratosthenes.html)  
+[^factorization]: [Primality & Factorization](https://cp-algorithms.com/algebra/primality_tests.html)  
+[^mod-inv]: [Modular Inverse](https://cp-algorithms.com/algebra/module-inverse.html)  
+[^crt]: [Chinese Remainder Theorem](https://cp-algorithms.com/algebra/chinese-remainder-theorem.html)  
+[^garners]: [Garner's Algorithm](https://cp-algorithms.com/algebra/garners-algorithm.html)  
+[^discrete-log]: [Discrete Logarithm](https://cp-algorithms.com/algebra/discrete-log.html)  
+[^bitmask]: [Bitmask Techniques](https://cp-algorithms.com/algebra/all-submasks.html)  
+[^bigint]: [Arbitrary Precision Arithmetic](https://cp-algorithms.com/algebra/big-integer.html)  
+[^fft]: [Fast Fourier Transform](https://cp-algorithms.com/algebra/fft.html)  
+[^poly]: [Polynomial Interpolation](https://cp-algorithms.com/algebra/polynomial.html)  
+[^poly-series]: [Power Series Operations](https://cp-algorithms.com/algebra/polynomial.html#operations-on-series)  
+[^gauss]: [Gaussian Elimination](https://cp-algorithms.com/linear_algebra/linear-system-gauss.html)  
+[^geom-primitives]: [Basic Geometry Primitives](https://cp-algorithms.com/geometry/basic-geometry.html)  
+[^circle]: [Circle Geometry](https://cp-algorithms.com/geometry/circle-circle-intersection.html)  
+[^polygon]: [Polygon Geometry](https://cp-algorithms.com/geometry/oriented-triangle-area.html)  
+[^convex-hull]: [Convex Hull Construction](https://cp-algorithms.com/geometry/convex-hull.html)  
+[^cht]: [Convex Hull Trick](https://cp-algorithms.com/geometry/convex_hull_trick.html)  
+[^sweep]: [Closest Pair of Points](https://cp-algorithms.com/geometry/closest-points.html)  
+[^delaunay]: [Delaunay Triangulation](https://cp-algorithms.com/geometry/delaunay.html)  
+[^half-plane]: [Half-Plane Intersection](https://cp-algorithms.com/geometry/halfplane-intersection.html)  
+[^ternary]: [Ternary Search](https://cp-algorithms.com/num_methods/ternary_search.html)  
+[^dp-opt]: [DP Optimization Techniques](https://cp-algorithms.com/dp/divide-and-conquer-dp.html)