Skip to content

Geometry algorithms

Jump to bottom
Daniil Basmanov edited this page Jun 20, 2018 · 5 revisions

D - Distance C - Closest point(s) I - Intersection

2D Line Ray Segment Circle
Point D, C, I D, C, I D, C, I D, C, I
Line D, C, I D, C, I D, C, I D, C, I
Ray D, C, I D, C, I D, C, I
Segment D, C, I D, C, I
Circle D, C, I
3D Line Ray Segment Sphere
Point D, C, I D, C, I D, C, I D, C, I
Line I - - D, C, I
Ray - - D, C, I
Segment - D, C, I
Sphere D, C
Clone this wiki locally