All-Pairs Segment Intersection is a computational geometry problem that consists in identifying all pairwise intersections among a given set of line segments, distinguished from other intersection problems by explicitly considering every possible pair of segments without spatial filtering or omission.