{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T21:00:45Z","timestamp":1761512445722,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424956"},{"type":"electronic","value":"9783540446811"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44681-8_95","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:35:09Z","timestamp":1188358509000},"page":"663-673","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Case Study of Load Distribution in Parallel View Frustum Culling and Collision Detection"],"prefix":"10.1007","author":[{"given":"Ulf","family":"Assarsson","sequence":"first","affiliation":[]},{"given":"Per","family":"Stenstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"issue":"1","key":"95_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/10867651.2000.10487517","volume":"5","author":"U. Assarsson","year":"2000","unstructured":"Ulf Assarsson and Tomas M\u00f6ller, \u201cOptimized View Frustum Culling Algorithms for Bounding Boxes\u201d, Journal of Graphics Tools, 5(1), Pages 9\u201322, 2000.","journal-title":"Journal of Graphics Tools"},{"key":"95_CR2","doi-asserted-by":"publisher","first-page":"1212","DOI":"10.1145\/63047.63075","volume":"2","author":"L. Boxer","year":"1988","unstructured":"L. Boxer and R. Miller, \u201dDynamic computational geometry on parallel computers\u201d, Proceedings of the third conference on Hypercube concurrent computers and applications (Vol. 2), Pages 1212\u20131219, 1988.","journal-title":"Proceedings of the third conference on Hypercube concurrent computers and applications"},{"key":"95_CR3","doi-asserted-by":"publisher","first-page":"1500","DOI":"10.1145\/63047.63107","volume":"2","author":"E. W. Felten","year":"1988","unstructured":"E. W. Felten, \u201dBest-first Branch-and Bound on a Hypercube\u201d, Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, (Vol. 2), Pages 1500\u20131504, 1988.","journal-title":"Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications"},{"key":"95_CR4","doi-asserted-by":"crossref","unstructured":"Matteo Frigo, Charles E. Leiserson, and Keith H. Randall, \u201dThe Implementation of the Cilk-5 Multithreaded Language\u201d, ACM SIGPLAN Conference on Programming Language, 1998.","DOI":"10.1145\/277650.277725"},{"key":"95_CR5","doi-asserted-by":"crossref","unstructured":"S. Gottschalk, M.C Lin, and D. Manocha, \u201dOBBTree: A Hierarchical Structure for Rapid Interference Detection\u201d, Proc. of ACM Siggraph, Pages 171\u2013180, 1996.","DOI":"10.1145\/237170.237244"},{"key":"95_CR6","doi-asserted-by":"crossref","unstructured":"Taosong He, \u201dFast collision detection using Quospo trees\u201d, Proceedings of the 1999symposium on Interactive 3D graphics, Pages 55\u201362, 1999.","DOI":"10.1145\/300523.300529"},{"key":"95_CR7","doi-asserted-by":"crossref","unstructured":"Martin Held, James T. Klosowski, Joseph S. B. Mitchell, \u201dCollision Detection for Fly-Throughs in Virtual Environments\u201d, Symposium on Computational Geometry, V-13\u2013V-14, 1996","DOI":"10.1145\/237218.237428"},{"key":"95_CR8","unstructured":"V. K. Janakiram, D. P. Agrawal, and R. Mehrotra, \u201dA Randomized Parallel Branch-and-Bound Algorithm\u201d, in Proc. Int. Conf. Parallel Process., Pages 69\u201375., Aug. 1988."},{"key":"95_CR9","doi-asserted-by":"crossref","unstructured":"M. Karlsson, F. Dahlgren, and P. Stenstr\u00f6m, \u201dA Prefetching Technique for Irregular Accesses to Linked Data Structures\u201d, Proc. of 6th Int. Symp. on High Performance Computer Architecture, Pages 206\u2013217, Jan. 2000.","DOI":"10.1109\/HPCA.2000.824351"},{"issue":"3","key":"95_CR10","doi-asserted-by":"publisher","first-page":"765","DOI":"10.1145\/174130.174145","volume":"40","author":"R. M. Karp","year":"1993","unstructured":"Richard M. Karp, Yanjun Zhang, \u201dRandomized Parallel Algorithms for Backtrack Search and Branch-and-Bound Computation\u201d, Journal of the ACM, Volume 40, Pages 765\u2013789, Issue 3, 1993.","journal-title":"Journal of the ACM"},{"key":"95_CR11","unstructured":"Tomas M\u00f6ller and Eric Haines, \u201dReal-Time Rendering\u201d, A. K. Peters Ltd, ISBN 1-56881-101-2, 1999."},{"key":"95_CR12","doi-asserted-by":"crossref","unstructured":"Roy P. Pargas and E. Daniels Wooster, \u201dBranch-and-Bound Algorithms on a Hypercube\u201d, Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, (Vol. 2), Pages 1514\u20131519, 1988.","DOI":"10.1145\/63047.63109"},{"issue":"3","key":"95_CR13","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/12.48868","volume":"C-39","author":"M. J. Quinn","year":"1990","unstructured":"Michael J Quinn, \u201dAnalysis and Implementation of Branch-and-Bound Algorithms on a Hypercube Multicomputer\u201d, IEEE Transactions on Computers, vol. C-39, Pages 384\u2013387, no. 3, March, 1990.","journal-title":"IEEE Transactions on Computers"},{"key":"95_CR14","unstructured":"V. Nageshwara Rao and Vipin Kumar, \u201dParallel Depth-First Search on Multiprocessors \u2014Part I: Implementation; and Part II-analysis\u201d, International Journal of Parallel Programming, vol. 16, no. 6, 1987."},{"issue":"4","key":"95_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1109\/71.219757","volume":"4","author":"V. N. Rao","year":"1993","unstructured":"V. Nageshwara Rao, Vipin Kumar, \u201dOn the Efficiency of Parallel Backtracking\u201d, IEEE Transactions on Parallel and Distributed Systems, vol 4, no. 4, Pages 427\u2013437, April, 1993.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"95_CR16","doi-asserted-by":"crossref","unstructured":"A. Reinefeld, V. Schnecke, \u201dWork-Load Balancing in Highly Parallel Depth-First Search\u201d, Proc. Scalable High Performance Computing Conf. SHPCC\u201994, IEEE Comp. Sc. Press, Pages 773\u2013780, 1994.","DOI":"10.1109\/SHPCC.1994.296719"},{"key":"95_CR17","unstructured":"Peter Rundberg, \u201dAn Optimized Collision Detection Algorithm\u201d, http:\/\/www.ce.chalmers.se\/staff\/biff\/exjobb , 1998."},{"key":"95_CR18","doi-asserted-by":"crossref","unstructured":"A. Saulsbury, F. Pong, and A. Novatzyk, \u201cMissing the Memory Wall: The Case for Processor\/Memory Integration\u201d Proc. of 23rd Int. Symp. on Computer Architecture, Pages 90\u2013101, June, 1996.","DOI":"10.1145\/232974.232984"},{"issue":"2","key":"95_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10867651.1998.10487488","volume":"3","author":"B. Smits","year":"1999","unstructured":"Brian Smits, \u201cEfficiency Issues for Ray Tracing\u201d, A K Peters, Ltd, Journal of Graphics Tools, vol 3, no 2, Pages 1\u201314, 1999.","journal-title":"Journal of Graphics Tools"},{"key":"95_CR20","unstructured":"Seth Teller, John Alex, \u201dFrustum Casting for Progressive, Interactive Rendering,\u201d MIT LCS Technical Report 740, January, 1998."},{"key":"95_CR21","first-page":"1","volume-title":"Rendering Techniques\u2019 95\u2019","author":"M. Zwaan van der","year":"1995","unstructured":"Maurice van der Zwaan, Erik Reinhard, Frederik W. Jansen, \u201cPyramid Clipping for Efficient Ray Traversal\u201d, in Hanrahan, P. M. and Purgathofer, W., eds., Rendering Techniques\u2019 95\u2019, Springer-Verlag Wien, pp 1\u201310, 1995."},{"key":"95_CR22","unstructured":"C. Xu, S. Tschoke, and B. Monien, \u201dPerformance Evaluation of Load Distribution Strategies in Parallel Branch and bound Computations\u201d, Proc. of the 7th IEEE Symposium of Parallel and Distributed Processing (SPDP95), Oct. 1995."},{"key":"95_CR23","doi-asserted-by":"crossref","unstructured":"C. Xu and R. L\u00fcling and B. Monien and F. Lau, \u201dAn analytical comparison of nearest neighbor algorithms for load balancing in parallel computers\u201d, Proceedings of 9th International Parallel Processing Symposium, 1995.","DOI":"10.1002\/cpe.4330070709"},{"key":"95_CR24","doi-asserted-by":"crossref","unstructured":"Myung K. Yang, Chita R. Das, \u201dEvaluation of a Parallel Branch-and-Bound Algorithm on a Class of Multiprocessors\u201d, IEEE Transactions on Parallel and Distributed Systems, vol. 5, no. 1, January, 1994.","DOI":"10.1109\/71.262590"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2001 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44681-8_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:34:35Z","timestamp":1737398075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44681-8_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424956","9783540446811"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-44681-8_95","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}