{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:09:01Z","timestamp":1759133341674,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030293994"},{"type":"electronic","value":"9783030294007"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29400-7_12","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"156-169","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Load-Balancing for Parallel Delaunay Triangulations"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Funke","sequence":"first","affiliation":[]},{"given":"Peter","family":"Sanders","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Winkler","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/BF01762120","volume":"3","author":"A Aggarwal","year":"1988","unstructured":"Aggarwal, A., Chazelle, B., Guibas, L.: Parallel computational geometry. Algorithmica 3(1), 293\u2013327 (1988)","journal-title":"Algorithmica"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1007\/978-3-319-96983-1_47","volume-title":"Euro-Par 2018: Parallel Processing","author":"Y Akhremtsev","year":"2018","unstructured":"Akhremtsev, Y., Sanders, P., Schulz, C.: High-quality shared-memory graph partitioning. In: Aldinucci, M., Padovani, L., Torquati, M. (eds.) Euro-Par 2018. LNCS, vol. 11014, pp. 659\u2013671. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96983-1_47"},{"issue":"8","key":"12_CR3","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1016\/j.comgeo.2010.04.008","volume":"43","author":"VH Batista","year":"2010","unstructured":"Batista, V.H., Millman, D.L., Pion, S., Singler, J.: Parallel geometric algorithms for multi-core computers. Comp. Geom. 43(8), 663\u2013677 (2010)","journal-title":"Comp. Geom."},{"issue":"4","key":"12_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10867651.1997.10487480","volume":"2","author":"G van den Bergen","year":"1997","unstructured":"van den Bergen, G.: Efficient collision detection of complex deformable models using aabb trees. J. Graph. Tools 2(4), 1\u201313 (1997)","journal-title":"J. Graph. Tools"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Chen, M.B.: The merge phase of parallel divide-and-conquer scheme for 3D Delaunay triangulation. In: International Symposium on Parallel and Distributed Processing with Applications (ISPA), pp. 224\u2013230, IEEE (2010)","DOI":"10.1109\/ISPA.2010.71"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/3-540-31619-1_7","volume-title":"Numerical Solution of Partial Differential Equations on Parallel Computers","author":"N Chrisochoides","year":"2006","unstructured":"Chrisochoides, N.: Parallel mesh generation. Numerical Solution of Partial Differential Equations on Parallel Computers. LNCS, vol. 51, pp. 237\u2013264. Springer, Berlin (2006). https:\/\/doi.org\/10.1007\/3-540-31619-1_7"},{"issue":"4","key":"12_CR7","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/S0378-4754(00)00192-0","volume":"54","author":"N Chrisochoides","year":"2000","unstructured":"Chrisochoides, N., Nave, D.: Simultaneous mesh generation and partitioning for Delaunay meshes. Math. Comput. Sim. 54(4), 321\u2013339 (2000)","journal-title":"Math. Comput. Sim."},{"issue":"5","key":"12_CR8","first-page":"333","volume":"30","author":"P Cignoni","year":"1998","unstructured":"Cignoni, P., Montani, C., Scopigno, R.: DeWall: a fast divide and conquer Delaunay triangulation algorithm in $$E^d$$. CAD 30(5), 333\u2013341 (1998)","journal-title":"CAD"},{"key":"12_CR9","unstructured":"Collaboration, G.: Gaia data release 2. summary of the contents and survey properties. arXiv (abs\/1804.09365) (2018)"},{"issue":"02","key":"12_CR10","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1142\/S0129054102001035","volume":"13","author":"O Devillers","year":"2002","unstructured":"Devillers, O.: The Delaunay hierarchy. Int. J. Found. Comput. Sci. 13(02), 163\u2013180 (2002)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"12_CR11","doi-asserted-by":"crossref","unstructured":"Funke, D., Sanders, P.: Parallel $$d$$-d Delaunay triangulations in shared and distributed memory. In: ALENEX, pp. 207\u2013217, SIAM (2017)","DOI":"10.1137\/1.9781611974768.17"},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Funke, D., Sanders, P., Winkler, V.: Load-Balancing for Parallel Delaunay Triangulations. arXiv (abs\/1902.07554) (2019)","DOI":"10.1007\/978-3-030-29400-7_12"},{"key":"12_CR13","unstructured":"Hert, S., Seel, M.: dD convex hulls and delaunay triangulations. In: CGAL User and Reference Manual, CGAL Editorial Board, 4.7 edn. (2015)"},{"issue":"2","key":"12_CR14","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Techn. J. 49(2), 291\u2013307 (1970)","journal-title":"Bell Syst. Techn. J."},{"issue":"5","key":"12_CR15","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.parco.2005.02.010","volume":"31","author":"J Kohout","year":"2005","unstructured":"Kohout, J., Kolingerov\u00e1, I., \u017d\u00e1ra, J.: Parallel Delaunay triangulation in E2 and E3 for computers with shared memory. Par. Comp. 31(5), 491\u2013522 (2005)","journal-title":"Par. Comp."},{"issue":"1","key":"12_CR16","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1080\/2151237X.2007.10129232","volume":"12","author":"T Larsson","year":"2007","unstructured":"Larsson, T., Akenine-M\u00f6ller, T., Lengyel, E.: On faster sphere-box overlap testing. J. Graph., GPU, Game Tools 12(1), 3\u20138 (2007)","journal-title":"J. Graph., GPU, Game Tools"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0129626401000634","volume":"11","author":"S Lee","year":"2001","unstructured":"Lee, S., Park, C.I., Park, C.M.: An improved parallel algorithm for Delaunay triangulation on distributed memory parallel computers. Parallel Process. Lett. 11, 341\u2013352 (2001)","journal-title":"Parallel Process. Lett."},{"issue":"3","key":"12_CR18","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/3157734","volume":"44","author":"P Sanders","year":"2018","unstructured":"Sanders, P., Lamm, S., H\u00fcbschle-Schneider, L., Schrade, E., Dachsbacher, C.: Efficient parallel random sampling - vectorized, cache-efficient, and online. ACM Trans. Math. Softw. 44(3), 29:1\u201329:14 (2018)","journal-title":"ACM Trans. Math. Softw."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-38527-8_16","volume-title":"Experimental Algorithms","author":"P Sanders","year":"2013","unstructured":"Sanders, P., Schulz, C.: Think locally, act globally: highly balanced graph partitioning. In: Bonifaci, V., Demetrescu, C., Marchetti-Spaccamela, A. (eds.) SEA 2013. LNCS, vol. 7933, pp. 164\u2013175. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38527-8_16"},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume":"1148","author":"J Shewchuk","year":"1996","unstructured":"Shewchuk, J.: Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. Appl. Comp. Geom. Towards Geom. Eng. 1148, 203\u2013222 (1996)","journal-title":"Appl. Comp. Geom. Towards Geom. Eng."},{"issue":"3","key":"12_CR21","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"J Shewchuk","year":"1997","unstructured":"Shewchuk, J.: Adaptive precision floating-point arithmetic and fast robust geometric predicates. Disc. Comp. Geom. 18(3), 305\u2013363 (1997)","journal-title":"Disc. Comp. Geom."},{"issue":"5","key":"12_CR22","first-page":"1436","volume":"18","author":"HD Simon","year":"1997","unstructured":"Simon, H.D., Teng, S.H.: How good is recursive bisection? J. Sci. Comput. 18(5), 1436\u20131445 (1997)","journal-title":"J. Sci. Comput."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Su, P., Drysdale, R.L.S.: A comparison of sequential delaunay triangulation algorithms. In: Symposium on Computing Geometry (SCG), pp. 61\u201370, ACM (1995)","DOI":"10.1145\/220279.220286"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2019: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29400-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T00:03:15Z","timestamp":1691884995000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29400-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030293994","9783030294007"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29400-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"G\u00f6ttingen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/europar.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"142","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,94","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4,27","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"double blind review in two cases","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}