Parallelization And Optimization of The Line Segment Intersection Problem

<!--[endif]--><!--[if gte mso 9]> Normal 0 false false false MicrosoftInternetExplorer4 <![endif]--><!--[if gte mso 9]> <![endif]--> <!--[endif]--><!--[if gte mso 9]> <![endif]--><!--[if gte mso 9]> <![endif]-->

Line Segment Intersection Problem

1. Problem Statement

Write a threaded code to find pairs of input line segments that intersect within three-dimensional space. Line segments are defined by 6 integers representing the two (x,y,z) endpoints.

Assine o parallelization