store AABBs / Thai Statue / bar Carta Blanca / Stanford University / Saarland University / On building / Czech Technical University / OPERA TEAM / /
IndustryTerm
approximation algorithm / kd-tree ray tracing algorithm / construction algorithm / parallel solution / Ray traversal algorithm / sweep-and-prune algorithm / off-line high quality building algorithm / Min-max binning algorithm / Conventional binning algorithm / evaluation algorithm / dynamic builder / performing algorithms / Dedicated ray tracing hardware / computing / parallel algorithm / sequential kd-tree construction algorithm / kd-tree construction algorithms / kd-tree building algorithm / interactive ray tracing algorithms / /
Organization
Czech Technical University in Prague / Core2 Duo / Saarland University / Programmable Ray Processing Unit / pp. / dualIntel Core2 Duo / GHz Duo / Stanford University / IEEE Computer Society / Eurographics Association / /
Person
Shirley Scene / Maxim Shevtsov / Ray Tracing / Alexei Soupikov / Alexander Kapustin / D ONALD / Ward Conf / Stanford Dragon / /
Position
request memory manager / manager / General / /
Product
Opteron Intel P4HT 2.6 GHz 2.8 / /
ProvinceOrState
Massachusetts / /
PublishedMedium
ACM Transactions on Graphics / Computer Graphics / /
SportsLeague
Stanford University / /
Technology
SOA / kd-tree building algorithm / Conventional binning algorithm / 3-D / kd-tree construction algorithms / 3D-DDA algorithm / parallel algorithm / building algorithm / kd-tree ray tracing algorithm / shared memory / Cell processor / sweep-and-prune algorithm / high performing algorithms / load balancing / interactive ray tracing algorithms / Stream Processor / existing sequential kd-tree construction algorithm / Ray traversal algorithm / SAH approximation algorithm / simulation / animation / Min-max binning algorithm / construction algorithm / Parallel processing / SAH evaluation algorithm / using global illumination simulation / /
EUROGRAPHICSD. Cohen-Or and P. Slavík (Guest Editors) Volume), Number 3 Highly Parallel Fast KD-tree Construction for Interactive