<!--[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.
Only yesterday I have blogged about the upcoming Game Developers Conference 2009. It was about the big picture, namely the keynote sessions which are planned for GDC‘09. Beside this information at a rather abstract level there are also very technical presentations and workshops. What I‘m really interested in you will learn here and now.
I will attend dedicated tech sessions which are offered within the section „Programming“:
The interesting part of the algorithm is an XCHG-based producer part.
As Chris Thomasson correctly noted, the XCHG-based producer part can be combined with the well-known CAS-based consumer part in order to get multi-producer/multi-consumer (MPMC) queue:
Download How to sound like a Parallel Programming Expert Part 1: introducing concurrency and parallelism [PDF 73KB]
Download How to sound like a Parallel Programming Expert Part 2: Parallel hardware [PDF 80KB]