{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,30]],"date-time":"2026-06-30T03:26:01Z","timestamp":1782789961820,"version":"3.54.5"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T00:00:00Z","timestamp":1652313600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T00:00:00Z","timestamp":1652313600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100004410","name":"T\u00fcrkiye Bilimsel ve Teknolojik Ara\u015ftirma Kurumu","doi-asserted-by":"publisher","award":["117E881"],"award-info":[{"award-number":["117E881"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Vis"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s12650-022-00842-x","type":"journal-article","created":{"date-parts":[[2022,5,12]],"date-time":"2022-05-12T07:03:01Z","timestamp":1652338981000},"page":"1103-1115","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Compact tetrahedralization-based acceleration structures for ray tracing"],"prefix":"10.1007","volume":"25","author":[{"given":"Aytek","family":"Aman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Serkan","family":"Demirci","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2462-6959","authenticated-orcid":false,"given":"U\u011fur","family":"G\u00fcd\u00fckbay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,5,12]]},"reference":[{"issue":"3\u20134","key":"842_CR1","doi-asserted-by":"crossref","first-page":"e2024","DOI":"10.1002\/cav.2024","volume":"32","author":"A Aman","year":"2021","unstructured":"Aman A, Demirci S, G\u00fcd\u00fckbay U, Wald I (2021) Multi-level tetrahedralization-based accelerator for ray-tracing animated scenes. Comput Anim Virtual World 32(3\u20134):e2024","journal-title":"Comput Anim Virtual World"},{"key":"842_CR2","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/S0097-8493(03)00034-7","volume":"27","author":"H Berk","year":"2003","unstructured":"Berk H, Aykanat C, Gudukbay U (2003) Direct volume rendering of unstructured grids. Comp & Graph 27:387\u2013406","journal-title":"Comp & Graph"},{"issue":"2","key":"842_CR3","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1093\/comjnl\/24.2.162","volume":"24","author":"A Bowyer","year":"1981","unstructured":"Bowyer A (1981) Computing dirichlet tessellations. Comput J 24(2):162\u2013166","journal-title":"Comput J"},{"issue":"1","key":"842_CR4","first-page":"1","volume":"6","author":"T Duff","year":"2017","unstructured":"Duff T, Burgess J, Christensen P, Hery C, Kensler A, Liani M, Villemin R (2017) Building an orthonormal basis, revisited. J Comp Graph Tech 6(1):1\u20138","journal-title":"J Comp Graph Tech"},{"key":"842_CR5","doi-asserted-by":"crossref","unstructured":"Edelsbrunner H, Shah NR (1992) Incremental topological flipping works for regular triangulations. In: Proc. Eighth Ann. Symp. Comp. Geom., ACM, New York, NY, USA, SCG \u201992, pp 43\u201352","DOI":"10.1145\/142675.142688"},{"issue":"4","key":"842_CR6","first-page":"34","volume":"6","author":"R Fellegara","year":"2020","unstructured":"Fellegara R, Floriani LD, Magillo P, Weiss K (2020) Tetrahedral trees: A family of hierarchical spatial indexes for tetrahedral meshes. ACM Trans Spat Algo Syst 6(4):23, 34 p","journal-title":"ACM Trans Spat Algo Syst"},{"key":"842_CR7","first-page":"148","volume-title":"Tutorial: computer graphics","author":"A Fujimoto","year":"1988","unstructured":"Fujimoto A, Tanaka T, Iwata K (1988) ARTS: accelerated ray-tracing system. In: Joy KI, Grant CW, Max NL, Hatfield L (eds) Tutorial: Computer Graphics. Image Synthesis, Computer Science Press Inc, New York, NY, USA, pp 148\u2013159"},{"key":"842_CR8","doi-asserted-by":"crossref","unstructured":"Garrity MP (1990) Raytracing irregular volume data. In Proc. Eighth Joint Eurographics\/IEEE VGTC Conf. Vis., ACM, New York, NY, USA, VVS \u201990, pp 35\u201340","DOI":"10.1145\/99308.99316"},{"issue":"6","key":"842_CR9","doi-asserted-by":"publisher","first-page":"1541","DOI":"10.1109\/TVCG.2010.156","volume":"16","author":"C Garth","year":"2010","unstructured":"Garth C, Joy KI (2010) Fast, memory-efficient cell location in unstructured grids for visualization. IEEE Trans Vis Comput Graph 16(6):1541\u20131550","journal-title":"IEEE Trans Vis Comput Graph"},{"issue":"10","key":"842_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/MCG.1984.6429331","volume":"4","author":"AS Glassner","year":"1984","unstructured":"Glassner AS (1984) Space subdivision for fast ray tracing. IEEE Comp Graph App 4(10):15\u201324","journal-title":"IEEE Comput Graphics Appl"},{"issue":"5","key":"842_CR11","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/MCG.1987.276983","volume":"7","author":"J Goldsmith","year":"1987","unstructured":"Goldsmith J, Salmon J (1987) Automatic creation of object hierarchies for ray tracing. IEEE Comp Graph App 7(5):14\u201320","journal-title":"IEEE Comp Graph App"},{"key":"842_CR12","doi-asserted-by":"crossref","unstructured":"Gunther J, Popov S, Seidel HP, Slusallek P (2007) Realtime ray tracing on GPU with BVH-based packet traversal. In Proc. IEEE Symp. Interactive Ray Tracing, IEEE Computer Society, Washington, DC, USA, RT \u201907, pp 113\u2013118","DOI":"10.1109\/RT.2007.4342598"},{"issue":"9","key":"842_CR13","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1109\/MCG.1986.276832","volume":"6","author":"E Haines","year":"1986","unstructured":"Haines E, Greenberg D (1986) The light buffer: a shadow-testing accelerator. IEEE Comp Graph App 6(9):6\u201316","journal-title":"IEEE Comp Graph App"},{"key":"842_CR14","first-page":"209","volume":"10","author":"V Havran","year":"2002","unstructured":"Havran V, Bittner J (2002) On improving kd tree for ray shooting. J WSCG 10:209\u2013216","journal-title":"J WSCG"},{"issue":"4","key":"842_CR15","first-page":"60","volume":"37","author":"Y Hu","year":"2018","unstructured":"Hu Y, Zhou Q, Gao X, Jacobson A, Zorin D, Panozzo D (2018) Tetrahedral meshing in the wild. ACM Trans Graph 37(4):60","journal-title":"ACM Trans Graph"},{"issue":"4","key":"842_CR16","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1145\/3306346.3323011","volume":"38","author":"Y Hu","year":"2019","unstructured":"Hu Y, Schneider T, Gao X, Zhou Q, Jacobson A, Zorin D, Panozzo D (2019) TriWild: Robust triangulation with curve constraints. ACM Trans Graph 38(4):52","journal-title":"ACM Trans Graph"},{"key":"842_CR17","doi-asserted-by":"crossref","unstructured":"Hunt W, Mark W (2008) Adaptive acceleration structures in perspective space. In: Proc. IEEE Symp. Interactive Ray Tracing, RT \u201908, pp 11\u201317","DOI":"10.1109\/RT.2008.4634614"},{"key":"842_CR18","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/978-4-431-68204-2_19","volume-title":"Vis Comput","author":"K Koyamada","year":"1992","unstructured":"Koyamada K (1992) Fast traverse of irregular volumes. In: Kunii TL (ed) Vis Comput. Springer Japan, Tokyo, pp 295\u2013311"},{"issue":"4","key":"842_CR19","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1111\/j.1467-8659.2008.01269.x","volume":"27","author":"A Lagae","year":"2008","unstructured":"Lagae A, Dutr\u00e9 P (2008) Accelerating ray tracing using constrained tetrahedralizations. Comp Graph Forum 27(4):1303\u20131312","journal-title":"Comp Graph Forum"},{"issue":"4","key":"842_CR20","doi-asserted-by":"publisher","first-page":"1235","DOI":"10.1111\/j.1467-8659.2008.01262.x","volume":"27","author":"A Lagae","year":"2008","unstructured":"Lagae A, Dutr\u00e9 P (2008) Compact, fast and robust grids for ray tracing. Comput Graph Forum 27(4):1235\u20131244","journal-title":"Comput Graph Forum"},{"issue":"3","key":"842_CR21","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/BF01911006","volume":"6","author":"DJ MacDonald","year":"1990","unstructured":"MacDonald DJ, Booth KS (1990) Heuristics for ray tracing using space subdivision. Vis Comput 6(3):153\u2013166","journal-title":"Vis Comput"},{"key":"842_CR22","unstructured":"Maria M, Horna S, Aveneau L (2014) Topological space partition for fast ray tracing in architectural models. In: Proc. Int. Conf. Comp. Graph. Theory App., GRAPP \u201914, pp 1\u201311"},{"issue":"1","key":"842_CR23","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1111\/cgf.12801","volume":"36","author":"M Maria","year":"2017","unstructured":"Maria M, Horna S, Aveneau L (2017) Constrained convex space partition for ray tracing in architectural environments. Comput Graph Forum 36(1):288\u2013300","journal-title":"Comput Graph Forum"},{"key":"842_CR24","doi-asserted-by":"crossref","unstructured":"Maria M, Horna S, Aveneau L (2017b) Efficient ray traversal of constrained Delaunay tetrahedralization. In: Proc. Int. Joint Conf. Comp. Vis., Imag. Comp. Graph. Theory Appl., VISIGRAPP \u201917, vol 1, pp 236\u2013243","DOI":"10.5220\/0006131002360243"},{"key":"842_CR25","unstructured":"Marmitt G, Slusallek P (2006) Fast ray traversal of tetrahedral and hexahedral meshes for direct volume rendering. In: Proc. Eighth Joint Eurographics\/IEEE VGTC Conf. Vis., Eurographics Assoc., Aire-la-Ville, Switzerland, EUROVIS \u201906, pp 235\u2013242"},{"key":"842_CR26","unstructured":"Maximo A, Ribeiro S, Bentes C, Oliveira A, Farias R (2008) Memory efficient GPU-based ray casting for unstructured volume rendering. In: Proc. Fifth Eurographics \/ IEEE VGTC Symp. Point-Based Graphics, Eurographics Assoc., Goslar, DEU, SPBG\u201908, pp 155\u2013162"},{"key":"842_CR27","doi-asserted-by":"publisher","first-page":"367","DOI":"10.4149\/cai_2018_2_367","volume":"37","author":"A Mebarki","year":"2018","unstructured":"Mebarki A (2018) XOR-based compact triangulations. Comp & Inform 37:367\u2013384","journal-title":"Comp & Inform"},{"key":"842_CR28","unstructured":"Miller GL, Talmor D, Teng SH, Walkington N, Wang H (1996) Control volume meshes using sphere packing: Generation, refinement and coarsening. In: Proc. 5th Int. Meshing Roundtable, pp 47\u201361"},{"key":"842_CR29","volume-title":"Physically based rendering: from theory to implementation","author":"M Pharr","year":"2016","unstructured":"Pharr M, Jakob W, Humphreys G (2016) Physically based rendering: from theory to implementation, 3rd edn. Morgan Kaufmann Publishers Inc, San Francisco, CA, USA","edition":"3"},{"issue":"4","key":"842_CR30","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/10867651.2003.10487593","volume":"8","author":"N Platis","year":"2003","unstructured":"Platis N, Theoharis T (2003) Fast ray-tetrahedron intersection using Pl\u00fccker coordinates. J Graph Tool 8(4):37\u201348","journal-title":"J Graph Tool"},{"key":"842_CR31","doi-asserted-by":"crossref","unstructured":"Ribeiro S, Maximo A, Bentes C, Oliveira A, Farias R (2007) Memory-aware and efficient ray-casting algorithm. In: Proc. XX Brazilian Symp. Comp. Graph. Img. Process., SIBGRAPI \u201907, pp 147\u2013154","DOI":"10.1109\/SIBGRAPI.2007.28"},{"key":"842_CR32","doi-asserted-by":"crossref","unstructured":"Sahistan A, Demirci S, Morrical N, Zellmann S, Aman A, Wald I, G\u00fcd\u00fckbay U (2021) Ray-traced shell traversal of tetrahedral meshes for direct volume visualization. In: Proc. IEEE Vis. Conf.-Short Papers, VIS \u201921, pp 91\u201395","DOI":"10.1109\/VIS49827.2021.9623298"},{"key":"842_CR33","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/PL00009321","volume":"18","author":"JR Shewchuk","year":"1996","unstructured":"Shewchuk JR (1996) Adaptive precision floating-point arithmetic and fast robust geometric predicates. Disc & Comp Geom 18:305\u2013363","journal-title":"Disc & Comp Geom"},{"issue":"2","key":"842_CR34","doi-asserted-by":"publisher","first-page":"11:1","DOI":"10.1145\/2629697","volume":"41","author":"H Si","year":"2015","unstructured":"Si H (2015) TetGen, a Delaunay-based quality tetrahedral mesh generator. ACM Trans Math Soft 41(2):11, 36 p","journal-title":"ACM Trans Math Soft"},{"issue":"2","key":"842_CR35","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1109\/2945.597797","volume":"3","author":"CT Silva","year":"1997","unstructured":"Silva CT, Mitchell JSB (1997) The lazy sweep ray casting algorithm for rendering irregular grids. IEEE Trans Vis Comp Graph 3(2):142\u2013157","journal-title":"IEEE Trans Vis Comp Graph"},{"key":"842_CR36","doi-asserted-by":"crossref","unstructured":"Silva CT, Mitchell JSB, Kaufman AE (1996) Fast rendering of irregular grids, Proc. Symp. Vol. Vis., VIS '96, 1996, pp. 15\u201322","DOI":"10.1109\/SVV.1996.558038"},{"key":"842_CR37","unstructured":"Sinha P (2004) A memory-efficient doubly linked list. Linux J, Available at\u00a0https:\/\/www.linuxjournal.com\/article\/6828. Accessed 5 May 2022"},{"key":"842_CR38","doi-asserted-by":"crossref","unstructured":"Stich M, Friedrich H, Dietrich A (2009) Spatial Splits in Bounding Volume Hierarchies. In: Proc. Conf. High Perf. Graph., ACM, New York, NY, USA, HPG \u201909, pp 7\u201313","DOI":"10.1145\/1572769.1572771"},{"key":"842_CR39","doi-asserted-by":"crossref","unstructured":"Wald I (2007) On fast construction of SAH-based bounding volume hierarchies. In: Proc. IEEE Symp. Interactive Ray Tracing, IEEE Computer Society, Washington, DC, USA, RT \u201907, pp 33\u201340","DOI":"10.1109\/RT.2007.4342588"},{"key":"842_CR40","doi-asserted-by":"crossref","unstructured":"Wald I, Havran V (2006) On building fast kd-trees for ray tracing, and on doing that in O(N log N). In: Proc. IEEE Symp. Interactive Ray Tracing, IEEE Computer Society, Washington, DC, USA, RT '06, pp 61\u201369","DOI":"10.1109\/RT.2006.280216"},{"issue":"2","key":"842_CR41","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1093\/comjnl\/24.2.167","volume":"24","author":"DF Watson","year":"1981","unstructured":"Watson DF (1981) Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. Comput J 24(2):167\u2013172","journal-title":"Comput J"},{"key":"842_CR42","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.cag.2016.12.003","volume":"62","author":"D Wodniok","year":"2017","unstructured":"Wodniok D, Goesele M (2017) Construction of bounding volume hierarchies with SAH cost approximation on temporary subtrees. Comp & Graph 62:41\u201352","journal-title":"Computers & Graphics"}],"container-title":["Journal of Visualization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-022-00842-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12650-022-00842-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12650-022-00842-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,21]],"date-time":"2023-11-21T12:05:06Z","timestamp":1700568306000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12650-022-00842-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,12]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["842"],"URL":"https:\/\/doi.org\/10.1007\/s12650-022-00842-x","relation":{},"ISSN":["1343-8875","1875-8975"],"issn-type":[{"value":"1343-8875","type":"print"},{"value":"1875-8975","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,5,12]]},"assertion":[{"value":"27 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 May 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}