In computational geometry, identifying line segment intersections is an essential task that is essential for applications such as simulations, mapping, and gaming. Differentiating collinear segments that overlap from those that only share a vertex is a frequent problem. We can improve our algorithm's accuracy by adding more range checks and cross products. Several methods for addressing these edge circumstances while maximizing efficiency are examined in this article. Gaining knowledge of these methods helps enhance interactive apps, road network research, and collision detection.