{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T01:50:40Z","timestamp":1779933040234,"version":"3.53.1"},"reference-count":44,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education","award":["NRF-2022R1I1A3069371"],"award-info":[{"award-number":["NRF-2022R1I1A3069371"]}]},{"name":"BK21 Fostering Outstanding Universities for Research","award":["5199990914048"],"award-info":[{"award-number":["5199990914048"]}]},{"DOI":"10.13039\/501100002560","name":"Soonchunhyang University Research Fund","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002560","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2024.3525025","type":"journal-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T19:32:30Z","timestamp":1735846350000},"page":"4759-4773","source":"Crossref","is-referenced-by-count":8,"title":["A Fast Parallel Processing Algorithm for Triangle Collision Detection Based on AABB and Octree Space Slicing in Unity3D"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2910-0302","authenticated-orcid":false,"given":"Kunthroza","family":"Hor","sequence":"first","affiliation":[{"name":"Department of Software Convergence, Soonchunhyang University, Asan-si, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3514-7152","authenticated-orcid":false,"given":"Nak-Jun","family":"Sung","sequence":"additional","affiliation":[{"name":"Department of Software Convergence, Soonchunhyang University, Asan-si, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Ma","sequence":"additional","affiliation":[{"name":"Department of Software Convergence, Soonchunhyang University, Asan-si, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Min-Hyung","family":"Choi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Saint Louis University, Saint Louis, MO, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9963-5521","authenticated-orcid":false,"given":"Min","family":"Hong","sequence":"additional","affiliation":[{"name":"Department of Computer Software Engineering, Soonchunhyang University, Asan-si, South Korea"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13113"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s12065-020-00559-6"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2972317"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-018-6063-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1088\/1757-899X\/768\/7\/072107"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3596711.3596795"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3837\/tiis.2023.11.012"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.4310\/CIS.2022.v22.n1.a3"},{"key":"ref9","first-page":"1029","article-title":"Collision and proximity queries","volume-title":"Handbook of Discrete and Computational Geometry","author":"Lin","year":"2017"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2017.2744059"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13884"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.142662"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.matcom.2019.10.001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218709"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/3550454.3555523"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1732\/1\/012067"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2018.07.003"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3390\/app11178255"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3392920"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/0951192X.2015.1033755"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13948"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ICMRA51221.2020.9398368"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2019.07.006"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2015.7138981"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13795"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3390\/ijgi6040106"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3123266.3123306"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3115934"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3272127.3275005"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2018.04.031"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.13162"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.2514\/6.2015-3057"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1080\/16864360.2015.1131530"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1080\/10867651.1997.10487472"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.commatsci.2019.04.004"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1016\/j.cpc.2017.03.002"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3359566.3360073"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.compfluid.2023.105972"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3245130"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.14345"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/AICT50176.2020.9368841"},{"issue":"3","key":"ref42","first-page":"23","article-title":"Bonsai: Rapid bounding, volume hierarchy generation using mini trees","volume":"4","author":"Ganestam","year":"2015","journal-title":"J. Comput. Graph. Techn."},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3102163.3102185"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-020-09066-3"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/10820353.pdf?arnumber=10820353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T20:49:39Z","timestamp":1736542179000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10820353\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3525025","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}