Line segments intersection for Unity.

Ray tracing / Line intersection formulas for various 2d and 3d objects

Pure Python implementation of a sweep line algorithm for line-segment intersections, based on a paper by Mehlhorn and Näher.

a methods to compute line to line, the line to segment and segment to segment in 3D space

Ray casting is the use of ray–surface intersection tests to solve a variety of problems in 3D computer graphics and computational geometry.

An algorithm for splitting line segments at their intersections.

Convex-Hull-and-Line-Intersection-Algorithms-With-Visualization. Convex Hull Algorithms: - Graham Scan Algorithm - Jarvis March or Gift Wrapping Algorithm - Bruteforce Algorithm - Quick Hull . Line Intersection Algorithms - CCW - Cramers Method - Vector Method - Graph Algorithms - Dijkstra - Kruskal - Max Flow - Havel Hakimi

Convex Hull and Line intersection: Research-based GUI project to simulate time and space complexity using Sloped-based, Cross product, Determinant, Brute Force, Graham Scan, Jarvis March, alogorithm using Java.

2d raycasting on lines intersection