{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T03:10:05Z","timestamp":1751685005601,"version":"3.41.0"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319936970"},{"type":"electronic","value":"9783319936987"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-93698-7_47","type":"book-chapter","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T19:30:25Z","timestamp":1528745425000},"page":"614-623","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Experimental Assessment of Three Point-Insertion Sequences for 3-D Incremental Delaunay Tessellations"],"prefix":"10.1007","author":[{"given":"Sanderson L.","family":"Gonzaga de Oliveira","sequence":"first","affiliation":[]},{"given":"Diogo T.","family":"Robaina","sequence":"additional","affiliation":[]},{"given":"Diego N.","family":"Brand\u00e3o","sequence":"additional","affiliation":[]},{"given":"Mauricio","family":"Kischinhevsky","sequence":"additional","affiliation":[]},{"given":"Gabriel","family":"Oliveira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,12]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"Amenta, N., Choi, S., Rote, G.: Incremental constructions con BRIO. In: Proceedings of the Nineteenth Annual Symposium on Computational Geometry, SCG 2003, pp. 211\u2013219. ACM, San Diego, June 2003","DOI":"10.1145\/777792.777824"},{"key":"47_CR2","unstructured":"Artec3D. Artec3D (2018). https:\/\/www.artec3d.com\/3d-models"},{"issue":"9","key":"47_CR3","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1145\/361002.361007","volume":"18","author":"JL Bentley","year":"1975","unstructured":"Bentley, J.L.: Multidimensional binary search trees used for associative searching. Commun. ACM 18(9), 509\u2013517 (1975)","journal-title":"Commun. ACM"},{"key":"47_CR4","doi-asserted-by":"crossref","unstructured":"Boissonnat, J.D., Devillers, O., Samuel, H.: Incremental construction of the Delaunay graph in medium dimension. In: Proceedings of the Twenty-Fifth Annual Symposium on Computational Geometry, SCG 2009, Aarhus, Denmark, pp. 208\u2013216. ACM, June 2009","DOI":"10.1145\/1542362.1542403"},{"key":"47_CR5","unstructured":"Buchin, K.: Constructing Delaunay triangulations along space-filling curves. In: Proceedings of the 2nd International Symposium Voronoi Diagrams (ISVD) in Science and Engineering, Seoul, Korea, pp. 184\u2013195 (2005)"},{"key":"47_CR6","unstructured":"Buchin, K.: Organizing point sets: Space-filling curves, Delaunay tessellations of random point sets, and flow complexes. Ph.D. thesis, Free University, Berlin (2007)"},{"issue":"1","key":"47_CR7","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s40314-016-0358-0","volume":"37","author":"SL Gonzaga de Oliveira","year":"2018","unstructured":"Gonzaga de Oliveira, S.L., Nogueira, J.R.: An evaluation of point-insertion sequences for incremental Delaunay tessellations. Comput. Appl. Math. 37(1), 641\u2013674 (2018)","journal-title":"Comput. Appl. Math."},{"issue":"1","key":"47_CR8","first-page":"31","volume":"100","author":"SL Gonzaga de Oliveira","year":"2014","unstructured":"Gonzaga de Oliveira, S.L., Nogueira, J.R., Tavares, J.M.R.S.: A systematic review of algorithms with linear-time behaviour to generate Delaunay and Voronoi tessellations. CMES - Comput. Model. Eng. Sci. 100(1), 31\u201357 (2014)","journal-title":"CMES - Comput. Model. Eng. Sci."},{"issue":"1","key":"47_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/s10409-013-0001-x","volume":"29","author":"J-F Liu","year":"2013","unstructured":"Liu, J.-F., Yan, J.-H., Lo, S.H.: A new insertion sequence for incremental Delaunay triangulation. Acta Mechanica Sinica 29(1), 99\u2013109 (2013)","journal-title":"Acta Mechanica Sinica"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"Liu, Y., Snoeyink, J.: A comparison of five implementations of 3D Delaunay tessellation. In: Goodman, J.E., Pach, J., Welzl, E. (eds.) Combinatorial and Computational Geometry, vol. 52, pp. 439\u2013458. MSRI Publications, Cambridge (2005)","DOI":"10.1017\/9781009701259.024"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"Schrijvers, O., van Bommel, F., Buchin, K.: Delaunay triangulations on the word RAM: towards a practical worst-case optimal algorithm. In: Proceedings of the 10th International Symposium on Voronoi Diagrams in Science and Engineering (ISVD), Saint Petersburg, Russia, pp. 7\u201315 (2013)","DOI":"10.1109\/ISVD.2013.10"},{"key":"47_CR12","unstructured":"The CGAL Project. CGAL User and Reference Manual. CGAL Editorial Board, 4.11 edition (2017). http:\/\/doc.cgal.org\/4.11\/Manual\/packages.html"},{"key":"47_CR13","unstructured":"The Stanford Models. The Stanford 3D Scanning Repository (2014). http:\/\/graphics.stanford.edu\/data\/3Dscanrep"},{"key":"47_CR14","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.ipl.2004.09.020","volume":"93","author":"S Zhou","year":"2005","unstructured":"Zhou, S., Jones, C.B.: HCPO: an efficient insertion order for incremental Delaunay triangulation. Inf. Process. Lett. 93, 37\u201342 (2005)","journal-title":"Inf. Process. Lett."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93698-7_47","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T02:30:08Z","timestamp":1751682608000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-93698-7_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319936970","9783319936987"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93698-7_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"12 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wuxi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2018\/","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":"406","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":"148","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":"60","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":"36% - 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","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":"3","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":"Acceptance rate in the Main Track is 28%. Acceptance rate in the workshops is 43%. A high acceptance rate in the workshops is explained by the nature of these thematic sessions, where many experts in a particular field are personally invited by workshop organisers to participate in their sessions.","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"}]}}