{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:13:54Z","timestamp":1761894834898},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642002182"},{"type":"electronic","value":"9783642002199"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-00219-9_10","type":"book-chapter","created":{"date-parts":[[2009,2,4]],"date-time":"2009-02-04T13:03:51Z","timestamp":1233752631000},"page":"90-101","source":"Crossref","is-referenced-by-count":26,"title":["Rapid Multipole Graph Drawing on the GPU"],"prefix":"10.1007","author":[{"given":"Apeksha","family":"Godiyal","sequence":"first","affiliation":[]},{"given":"Jared","family":"Hoberock","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Garland","sequence":"additional","affiliation":[]},{"given":"John C.","family":"Hart","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Aluru, S., Prabhu, G.M., Gustafson, J.: Truly distribution-independent algorithms for the n-body problem. In: Proc. Supercomputing, pp. 420\u2013428 (1994)","DOI":"10.1145\/602843.602844"},{"issue":"1","key":"10_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1137\/0906008","volume":"6","author":"A.W. Appel","year":"1985","unstructured":"Appel, A.W.: An efficient program for many-body simulation. SIAM J. Sci. & Stat. Comp.\u00a06(1), 85\u2013103 (1985)","journal-title":"SIAM J. Sci. & Stat. Comp."},{"issue":"6096","key":"10_CR3","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1038\/324446a0","volume":"324","author":"J. Barnes","year":"1986","unstructured":"Barnes, J., Hut, P.: A hierarchical o(n log n) force-calculation algorithm. Nature\u00a0324(6096), 446\u2013449 (1986)","journal-title":"Nature"},{"issue":"1","key":"10_CR4","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/152992.152995","volume":"24","author":"C. Batini","year":"1993","unstructured":"Batini, C.: Applications of graph drawing to software engineering (abstract). SIGACT News\u00a024(1), 57 (1993)","journal-title":"SIGACT News"},{"issue":"9","key":"10_CR5","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"J.L. Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. CACM\u00a018(9), 509\u2013517 (1975)","journal-title":"CACM"},{"key":"10_CR6","unstructured":"Carr, N.A., Hoberock, J., Crane, K., Hart, J.C.: Fast gpu ray tracing of dynamic meshes using geometry images. In: Proc. Graphics Interface, pp. 203\u2013209 (2006)"},{"issue":"4","key":"10_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1145\/234535.234538","volume":"15","author":"R. Davidson","year":"1996","unstructured":"Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Trans. Graph.\u00a015(4), 301\u2013331 (1996)","journal-title":"ACM Trans. Graph."},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Dikaiakos, M.D., Stadel, J.: A performance study of cosmological simulations on message-passing and shared-memory multiprocessors. In: Intl. Conf. on Supercomputing, pp. 94\u2013101 (1996)","DOI":"10.1145\/237578.237590"},{"key":"10_CR9","first-page":"149","volume":"42","author":"P.A. Eades","year":"1984","unstructured":"Eades, P.A.: A heuristic for graph drawing. Congressus Numerantium\u00a042, 149\u2013160 (1984)","journal-title":"Congressus Numerantium"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Foley, T., Sugerman, J.: Kd-tree acceleration structures for a GPU raytracer. In: Proc. Graphics Hardware, pp. 15\u201322 (2005)","DOI":"10.1145\/1071866.1071869"},{"issue":"6","key":"10_CR11","doi-asserted-by":"publisher","first-page":"1310","DOI":"10.1109\/TVCG.2007.70580","volume":"13","author":"Y. Frishman","year":"2007","unstructured":"Frishman, Y., Tal, M.-A.: Multi-level graph layout on the gpu. IEEE Trans. Vis. Comp. Graph.\u00a013(6), 1310\u20131319 (2007)","journal-title":"IEEE Trans. Vis. Comp. Graph."},{"issue":"11","key":"10_CR12","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1002\/spe.4380211102","volume":"21","author":"T.M.J. Fruchterman","year":"1991","unstructured":"Fruchterman, T.M.J., Reingold, E.M.: Graph drawing by force-directed placement. Software - Practice and Experience\u00a021(11), 1129\u20131164 (1991)","journal-title":"Software - Practice and Experience"},{"issue":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2004.03.014","volume":"29","author":"P. Gajer","year":"2004","unstructured":"Gajer, P., Goodrich, M.T., Kobourov, S.G.: A multi-dimensional approach to force-directed layouts of large graphs. Comput. Geom. Theory Appl.\u00a029(1), 3\u201318 (2004)","journal-title":"Comput. Geom. Theory Appl."},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-44541-2_21","volume-title":"Graph Drawing","author":"P. Gajer","year":"2001","unstructured":"Gajer, P., Kobourov, S.G.: GRIP: Graph dRawing with intelligent placement. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 222\u2013228. Springer, Heidelberg (2001)"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Grama, A.Y., Kumar, V., Sameh, A.: Scalable parallel formulations of the Barnes-Hut method for n-body simulations. In: Proc. Supercomputing, pp. 439\u2013448 (1994)","DOI":"10.1145\/602843.602846"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Greengard, L.F.: The rapid evaluation of potential fields in particle systems. Ph.D. thesis, Yale, New Haven, CT, USA (1987)","DOI":"10.7551\/mitpress\/5750.001.0001"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"8290","DOI":"10.1016\/j.jcp.2008.05.023","volume":"227","author":"N.A. Gumerov","year":"2008","unstructured":"Gumerov, N.A., Duraiswami, R.: Fast multipole methods on graphics processors. J. Comp. Physics\u00a0227, 8290\u20138313 (2008)","journal-title":"J. Comp. Physics"},{"key":"10_CR18","unstructured":"Hachul, S., J\u00fcnger, M.: Large-graph layout with the fast multipole multilevel method. Tech. rep., Zentrum f\u00fcr Angewandte Informatik K\u00f6ln (December 2005)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11618058_22","volume-title":"Graph Drawing","author":"S. Hachul","year":"2006","unstructured":"Hachul, S., Junger, M.: An experimental comparison of fast algorithms for drawing general large graphs. In: Healy, P., Nikolov, N.S. (eds.) GD 2005. LNCS, vol.\u00a03843, pp. 235\u2013250. Springer, Heidelberg (2006)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/3-540-44541-2_18","volume-title":"Graph Drawing","author":"D. Harel","year":"2001","unstructured":"Harel, D., Koren, Y.: A fast multi-scale method for drawing large graphs. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 183\u2013196. Springer, Heidelberg (2001)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36151-0_20","volume-title":"Graph Drawing","author":"D. Harel","year":"2002","unstructured":"Harel, D., Koren, Y.: Graph drawing by high dimensional embedding. In: Goodrich, M.T., Kobourov, S.G. (eds.) GD 2002. LNCS, vol.\u00a02528. Springer, Heidelberg (2002)"},{"issue":"1","key":"10_CR22","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0020-0190(89)90102-6","volume":"31","author":"T. Kamada","year":"1989","unstructured":"Kamada, T., Kawai, S.: An algorithm for drawing general undirected graphs. Inf. Process. Lett.\u00a031(1), 7\u201315 (1989)","journal-title":"Inf. Process. Lett."},{"key":"10_CR23","unstructured":"Koren, Y., Carmel, L., Harel, D.: ACE: a fast multiscale eigenvectors computation for drawing huge graphs (2001)"},{"key":"10_CR24","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032886","volume-title":"Sorting: A Distribution Theory, chap. High Qulaity Ambient Occlusion","author":"H.M. Mahmoud","year":"2000","unstructured":"Mahmoud, H.M.: Sorting: A Distribution Theory, chap. High Qulaity Ambient Occlusion. Wiley Interscience, Hoboken (2000)"},{"key":"10_CR25","unstructured":"NVIDIA: CUDA data parallel primitives library, http:\/\/www.gpgpu.org\/developer\/cudpp\/"},{"key":"10_CR26","unstructured":"NVIDIA: CUDA programming guide (2007), http:\/\/developer.nvidia.com\/object\/cuda.html"},{"key":"10_CR27","volume-title":"GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation","author":"M. Pharr","year":"2005","unstructured":"Pharr, M., Fernando, R.: GPU Gems 2: Programming Techniques for High-Performance Graphics and General-Purpose Computation. Addison-Wesley, Reading (2005)"},{"key":"10_CR28","doi-asserted-by":"crossref","unstructured":"Sarin, V.: Analyzing the error bounds of multipole-based treecodes. In: Proc. Supercomputing, p. 19 (1998)","DOI":"10.1109\/SC.1998.10041"},{"key":"10_CR29","unstructured":"Sengupta, S., Harris, M., Zhang, Y., Owens, J.D.: Scan primitives for gpu computing. In: Proc. Graphics Hardware, August 2007, pp. 97\u2013106 (2007)"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Stock, M.J., Gharakhani, A.: Toward efficient gpu-accelerated n-body simulations. In: 46th AIAA Aerospace Sciences Meeting & Exhibit (2008)","DOI":"10.2514\/6.2008-608"},{"key":"10_CR31","unstructured":"Uhlmann, J.K.: Enhancing multidimensional tree structures by using a bi-linear decomposition. Natl. Tech. Info. Svc. ADA229756 (1990)"},{"key":"10_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-44541-2_17","volume-title":"Graph Drawing","author":"C. Walshaw","year":"2001","unstructured":"Walshaw, C.: A multilevel algorithm for force-directed graph drawing. In: Marks, J. (ed.) GD 2000. LNCS, vol.\u00a01984, pp. 171\u2013182. Springer, Heidelberg (2001)"},{"key":"10_CR33","unstructured":"Walshaw, C.: Graph collection, staffweb.cms.gre.ac.uk\/~wc06\/partition\/ (2007)"}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-00219-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,15]],"date-time":"2020-05-15T09:53:35Z","timestamp":1589536415000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-00219-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642002182","9783642002199"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-00219-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}