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.

Another Sorts of Sorts

Asaf Shelly posted interesting blog regarding first problem (radix sort) of the Intel Threading Contest 2009:
All Sorts of Sorts
There is also active discussion going in the comments. Since I had mentioned some aspects of my submission, I decided to post my write-up here (I've checked up with Contest Rules, luckily Intel leave me enough rights for this :) ). So here it goes:

Radix Sort

Подписаться на parallelization