{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:19:19Z","timestamp":1783185559124,"version":"3.54.6"},"reference-count":163,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100012165","name":"Key Technologies Research and Development Program","doi-asserted-by":"publisher","award":["2023YFB3309000"],"award-info":[{"award-number":["2023YFB3309000"]}],"id":[{"id":"10.13039\/501100012165","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006579","name":"Ministry of Industry and Information Technology of the People's Republic of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006579","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computer-Aided Design"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.cad.2026.104081","type":"journal-article","created":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T05:32:01Z","timestamp":1777527121000},"page":"104081","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A survey of Boolean operations in 3D geometric modeling"],"prefix":"10.1016","volume":"197","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-9586-5588","authenticated-orcid":false,"given":"Sili","family":"Liang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Anchang","family":"Bao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enya","family":"Shen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianmin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cad.2026.104081_b1","series-title":"Computer aided design and manufacturing","author":"Sarcar","year":"2008"},{"key":"10.1016\/j.cad.2026.104081_b2","volume":"vol. 12110","author":"Foley","year":"1996"},{"key":"10.1016\/j.cad.2026.104081_b3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0010-4485(03)00104-0","article-title":"Boolean operations for 3D simulation of CNC machining of drilling tools","volume":"36","author":"Tost","year":"2004","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b4","doi-asserted-by":"crossref","first-page":"1697","DOI":"10.1007\/s11548-017-1637-y","article-title":"3D Boolean operations in virtual surgical planning","volume":"12","author":"Charton","year":"2017","journal-title":"Int J Comput Assist Radiol Surg"},{"key":"10.1016\/j.cad.2026.104081_b5","doi-asserted-by":"crossref","DOI":"10.1145\/3730908","article-title":"Boolean operation for cad models using a hybrid representation","volume":"44","author":"Yang","year":"2025","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b6","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.14733\/cadaps.2025.1007-1026","article-title":"Faster than fast: Efficient approximate boolean operations on dense triangular mesh models","author":"Xiao","year":"2025","journal-title":"Computer-Aided Des Appl"},{"key":"10.1016\/j.cad.2026.104081_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2025.103849","article-title":"Blending weight BSP tree for mesh Boolean operations","volume":"182","author":"Zhang","year":"2025","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b8","first-page":"1","article-title":"Exact and efficient intersection resolution for mesh arrangements","volume":"43","author":"Guo","year":"2024","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b9","series-title":"Special interest group on computer graphics and interactive techniques conference conference papers \u201924","first-page":"1","article-title":"A unified differentiable boolean operator with fuzzy logic","author":"Liu","year":"2024"},{"key":"10.1016\/j.cad.2026.104081_b10","series-title":"2023 IEEE 18th conference on industrial electronics and applications","first-page":"1662","article-title":"Exact boolean operation on triangulated meshes using accelerated BSPs","author":"Yanxi","year":"2023"},{"key":"10.1016\/j.cad.2026.104081_b11","doi-asserted-by":"crossref","first-page":"2713","DOI":"10.3390\/math11122713","article-title":"Simple and robust Boolean operations for triangulated surfaces","volume":"11","author":"Zhou","year":"2023","journal-title":"Mathematics"},{"key":"10.1016\/j.cad.2026.104081_b12","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2022.103436","article-title":"Finite algebras for solid modeling using Julia\u2019s sparse arrays","volume":"155","author":"Paoluzzi","year":"2023","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b13","series-title":"Parasolid 3D geometric modeling kernel","author":"Siemens Digital Industries Software","year":"2025"},{"key":"10.1016\/j.cad.2026.104081_b14","series-title":"ACIS Geometric Modeler","author":"Corp.","year":"2025"},{"key":"10.1016\/j.cad.2026.104081_b15","series-title":"Open CASCADE technology (OCCT)","author":"Open Cascade S.A.S.","year":"2025"},{"key":"10.1016\/j.cad.2026.104081_b16","first-page":"654","article-title":"Boolean operations on 3D selective Nef complexes: Data structure, algorithms, and implementation","volume":"vol. 2832","author":"Granados","year":"2003"},{"key":"10.1016\/j.cad.2026.104081_b17","series-title":"Proceedings of the 2005 ACM symposium on solid and physical modeling","first-page":"163","article-title":"Boolean operations on 3D selective Nef complexes: Optimized implementation and experiments","author":"Hachenberger","year":"2005"},{"key":"10.1016\/j.cad.2026.104081_b18","series-title":"Geometric and solid modeling: An introduction","author":"Hoffmann","year":"1989"},{"key":"10.1016\/j.cad.2026.104081_b19","series-title":"Boundary representation modelling techniques","author":"Stroud","year":"2006"},{"key":"10.1016\/j.cad.2026.104081_b20","series-title":"Constructive solid geometry","author":"Voelcker","year":"1977"},{"key":"10.1016\/j.cad.2026.104081_b21","series-title":"Designing with volumes","author":"Braid","year":"1973"},{"key":"10.1016\/j.cad.2026.104081_b22","series-title":"Polygon mesh processing","author":"Botsch","year":"2010"},{"key":"10.1016\/j.cad.2026.104081_b23","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/S0010-4485(84)80004-4","article-title":"Presque half-planes: Towards a general representation scheme","volume":"16","author":"Giraud","year":"1984","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b24","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF02464333","article-title":"Function representation in geometric modeling: Concepts, implementation and applications","volume":"11","author":"Pasko","year":"1995","journal-title":"Vis Comput"},{"key":"10.1016\/j.cad.2026.104081_b25","series-title":"Introduction to implicit surfaces","author":"Bloomenthal","year":"1997"},{"key":"10.1016\/j.cad.2026.104081_b26","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/0146-664X(82)90104-6","article-title":"Geometric modeling using octree encoding","volume":"19","author":"Meagher","year":"1982","journal-title":"Comput Graph Image Process"},{"key":"10.1016\/j.cad.2026.104081_b27","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.cagd.2018.03.021","article-title":"Accelerated robust Boolean operations based on hybrid representations","volume":"62","author":"Sheng","year":"2018","journal-title":"Comput Aided Geom Design"},{"key":"10.1016\/j.cad.2026.104081_b28","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1109\/PROC.1985.13108","article-title":"Boolean operations in solid modeling: Boundary evaluation and merging algorithms","volume":"73","author":"Requicha","year":"1985","journal-title":"Proc IEEE"},{"key":"10.1016\/j.cad.2026.104081_b29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/7529.7530","article-title":"Boolean operations of 2-manifolds through vertex neighborhood classification","volume":"5","author":"M\u00e4ntyl\u00e4","year":"1986","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b30","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1109\/MCG.1986.276741","article-title":"Boolean operations on n-Dimensional objects","volume":"6","author":"Putnam","year":"1986","journal-title":"IEEE Comput Graph Appl"},{"key":"10.1016\/j.cad.2026.104081_b31","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1147\/rd.313.0314","article-title":"Trimmed-surface algorithms for the evaluation and interrogation of solid boundary representations","volume":"31","author":"Farouki","year":"1987","journal-title":"IBM J Res Dev"},{"key":"10.1016\/j.cad.2026.104081_b32","series-title":"Computational geometry and its applications: CG\u201988, international workshop on computational geometry w\u00fcrzburg, FRG, March 24\u201325, 1988 proceedings","first-page":"97","article-title":"Elementary set operations with d-dimensional polyhedra","author":"Bieri","year":"1988"},{"key":"10.1016\/j.cad.2026.104081_b33","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-8396(89)90026-5","article-title":"A set operation algorithm for sculptured solids modeled with trimmed patches","volume":"6","author":"Casale","year":"1989","journal-title":"Comput Aided Geom Design"},{"key":"10.1016\/j.cad.2026.104081_b34","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1016\/0010-4485(89)90055-9","article-title":"Boolean algebra over linear polyhedra","volume":"21","author":"Paoluzzi","year":"1989","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b35","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/38.41469","article-title":"Robust set operations on polyhedral solids","volume":"9","author":"Hoffmann","year":"1989","journal-title":"IEEE Comput Graph Appl"},{"key":"10.1016\/j.cad.2026.104081_b36","series-title":"New advances in computer graphics: proceedings of CG international\u201989","first-page":"405","article-title":"Boolean operations of solids with free-from surfarces through polyhedral approximation","author":"Toriya","year":"1989"},{"key":"10.1016\/j.cad.2026.104081_b37","series-title":"Proceedings of the first ACM symposium on solid modeling foundations and CAD\/CAM applications - SMA \u201991","first-page":"119","article-title":"Boolean operations on sets using surface data","author":"Satoh","year":"1991"},{"key":"10.1016\/j.cad.2026.104081_b38","first-page":"33","article-title":"Boolean set operations on non-manifold boundary representation objects","volume":"23","author":"Gursoz","year":"1991","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b39","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0010-4485(93)90097-8","article-title":"Topological operators and Boolean operations for complex-based nonmanifold geometric models","volume":"25","author":"Masuda","year":"1993","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b40","article-title":"Boolean set operations with solid models","volume":"46","author":"Earnst","year":"1995","journal-title":"Hewlett Packard J"},{"key":"10.1016\/j.cad.2026.104081_b41","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1016\/0010-4485(95)00050-X","article-title":"An algorithm reducing 3D Boolean operations to a 2D problem: Concepts and results","volume":"28","author":"Gardan","year":"1996","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b42","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1016\/0010-4485(95)00073-9","article-title":"Distributed boundary representation and Boolean operations on a massively parallel computer","volume":"28","author":"Hui","year":"1996","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b43","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1142\/S0218195901000419","article-title":"Boole: A boundary evaluation system for boolean combinations of sculptured solids","volume":"11","author":"Krishnan","year":"2001","journal-title":"Internat J Comput Geom Appl"},{"key":"10.1016\/j.cad.2026.104081_b44","series-title":"Proceedings of the 28th annual conference on computer graphics and interactive techniques","first-page":"185","article-title":"Approximate Boolean operations on free-form solids","author":"Biermann","year":"2001"},{"key":"10.1016\/j.cad.2026.104081_b45","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/S0010-4485(01)00131-2","article-title":"Reasoning Boolean operation based modeling for heterogeneous objects","volume":"34","author":"Sun","year":"2002","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b46","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/S0010-4485(03)00060-5","article-title":"ESOLID\u2014a system for exact boundary evaluation","volume":"36","author":"Keyser","year":"2004","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b47","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s00371-011-0566-y","article-title":"Evaluation of boolean operations between free-form solids using extended simplicial chains and pn triangles","volume":"27","author":"Garc\u00eda","year":"2011","journal-title":"Vis Comput"},{"key":"10.1016\/j.cad.2026.104081_b48","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1016\/j.cad.2012.10.036","article-title":"Fast and robust Booleans on polyhedra","volume":"45","author":"Xu","year":"2013","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b49","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.cad.2019.05.034","article-title":"Watertight Boolean operations: A framework for creating CAD-compatible gap-free editable solid models","volume":"115","author":"Urick","year":"2019","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b50","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2025.103839","article-title":"Computational topology, Boolean algebras, and solid modeling","volume":"181","author":"Paoluzzi","year":"2025","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b51","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/MCG.1984.275959","article-title":"A unified algorithm for boolean shape operations","volume":"4","author":"Yamaguchi","year":"1984","journal-title":"IEEE Comput Graph Appl"},{"key":"10.1016\/j.cad.2026.104081_b52","series-title":"Gpu-based evaluation of boolean operations on triangulated solids","author":"Ogayar","year":"2006"},{"key":"10.1016\/j.cad.2026.104081_b53","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.cad.2006.11.003","article-title":"A topologically robust algorithm for Boolean operations on polyhedral shapes using approximate arithmetic","volume":"39","author":"Smith","year":"2007","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b54","series-title":"2009 international conference on environmental science and information application technology","first-page":"619","article-title":"Boolean operations on polygonal meshes using OBB trees","author":"Yongbin","year":"2009"},{"key":"10.1016\/j.cad.2026.104081_b55","series-title":"Proceedings of the 26th spring conference on computer graphics","first-page":"165","article-title":"Industrial application of exact Boolean operations for meshes","author":"Schifko","year":"2010"},{"key":"10.1016\/j.cad.2026.104081_b56","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1111\/j.1467-8659.2009.01609.x","article-title":"Exact and robust (self-)intersections for polygonal meshes","volume":"29","author":"Campen","year":"2010","journal-title":"Comput Graph Forum"},{"key":"10.1016\/j.cad.2026.104081_b57","unstructured":"Tayebi A, P\u00e9rez JG, Diego IG, C\u00e1tedra F. Boolean operations implementation over 3D parametric surfaces to be included in the geometrical module of an electromagnetic solver."},{"key":"10.1016\/j.cad.2026.104081_b58","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TVCG.2010.106","article-title":"Approximate Boolean operations on large polyhedral solids with partial mesh reconstruction","volume":"17","author":"Wang","year":"2011","journal-title":"IEEE Trans Vis Comput Graphics"},{"key":"10.1016\/j.cad.2026.104081_b59","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s00366-011-0228-8","article-title":"Boolean operations on multi-region solids for mesh generation","volume":"28","author":"Pereira","year":"2012","journal-title":"Eng Comput"},{"key":"10.1016\/j.cad.2026.104081_b60","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1016\/j.cad.2012.11.004","article-title":"Fast and accurate evaluation of regularized Boolean operations on triangulated solids","volume":"45","author":"Feito","year":"2013","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b61","doi-asserted-by":"crossref","first-page":"1235","DOI":"10.1016\/j.camwa.2015.06.016","article-title":"Exact, robust, and efficient regularized Booleans on general 3D meshes","volume":"70","author":"Barki","year":"2015","journal-title":"Comput Math Appl"},{"key":"10.1016\/j.cad.2026.104081_b62","series-title":"Boolean operations using generalized winding numbers","author":"Jacobson","year":"2016"},{"key":"10.1016\/j.cad.2026.104081_b63","doi-asserted-by":"crossref","DOI":"10.1016\/j.cag.2016.04.004","article-title":"Booleans of triangulated solids by a boundary conforming tetrahedral mesh generation approach","author":"Xiao","year":"2016","journal-title":"Comput Graph"},{"key":"10.1016\/j.cad.2026.104081_b64","series-title":"Adaptive mesh booleans","author":"Schmidt","year":"2016"},{"key":"10.1016\/j.cad.2026.104081_b65","first-page":"1","article-title":"Mesh arrangements for solid geometry","volume":"35","author":"Zhou","year":"2016","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b66","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/j.cad.2016.07.013","article-title":"Boolean operations on arbitrary polygonal and polyhedral meshes","volume":"85","author":"Landier","year":"2017","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b67","doi-asserted-by":"crossref","first-page":"1154","DOI":"10.1002\/ese3.335","article-title":"Research and application of Boolean operation for triangular mesh model of underground space engineering\u2014Boolean operation for triangular mesh model","volume":"7","author":"Qin","year":"2019","journal-title":"Energy Sci Eng"},{"key":"10.1016\/j.cad.2026.104081_b68","doi-asserted-by":"crossref","first-page":"5301","DOI":"10.1007\/s11042-018-6479-2","article-title":"Robust Boolean operations algorithm on regularized triangular mesh and implementation","volume":"79","author":"Wang","year":"2020","journal-title":"Multimedia Tools Appl"},{"key":"10.1016\/j.cad.2026.104081_b69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3414685.3417818","article-title":"Fast and robust mesh arrangements using floating-point arithmetic","volume":"39","author":"Cherchi","year":"2020","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b70","series-title":"Interactive and robust mesh booleans","author":"Cherchi","year":"2022"},{"key":"10.1016\/j.cad.2026.104081_b71","doi-asserted-by":"crossref","DOI":"10.1016\/j.cagd.2024.102324","article-title":"Feature-preserving quadrilateral mesh Boolean operation with cross-field guided layout blending","volume":"111","author":"Zheng","year":"2024","journal-title":"Comput Aided Geom Design"},{"key":"10.1016\/j.cad.2026.104081_b72","series-title":"Proceedings of the 14th annual conference on computer graphics and interactive techniques","first-page":"153","article-title":"Set operations on polyhedra using binary space partitioning trees","author":"Thibault","year":"1987"},{"key":"10.1016\/j.cad.2026.104081_b73","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/97880.97892","article-title":"Merging BSP trees yields polyhedral set operations","volume":"24","author":"Naylor","year":"1990","journal-title":"SIGGRAPH Comput Graph"},{"key":"10.1016\/j.cad.2026.104081_b74","doi-asserted-by":"crossref","first-page":"1269","DOI":"10.1111\/j.1467-8659.2009.01504.x","article-title":"Fast, exact, linear booleans","volume":"28","author":"Bernstein","year":"2009","journal-title":"Comput Graph Forum"},{"key":"10.1016\/j.cad.2026.104081_b75","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2021.103015","article-title":"Fast exact booleans for iterated CSG using octree-embedded bsps","volume":"135","author":"Nehring-Wirxel","year":"2021","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b76","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3528223.3530181","article-title":"EMBER: Exact mesh booleans via efficient & robust local arrangements","volume":"41","author":"Trettner","year":"2022","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b77","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/3973.3975","article-title":"Object representation by means of nonminimal division quadtrees and octrees","volume":"4","author":"Ayala","year":"1985","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b78","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1109\/MCG.1987.276987","article-title":"An algorithm for geometric set operations using cellular subdivision techniques","volume":"7","author":"Carlbom","year":"1987","journal-title":"IEEE Comput Graph Appl"},{"key":"10.1016\/j.cad.2026.104081_b79","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1016\/0010-4485(88)90003-6","article-title":"Boolean operations between solids and surfaces by octrees: Models and algorithm","volume":"20","author":"Ayala","year":"1988","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b80","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1145\/78956.78959","article-title":"Solid representation and operation using extended octrees","volume":"9","author":"Brunet","year":"1990","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b81","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/882262.882320","article-title":"Interactive boolean operations on surfel-bounded solids","volume":"22","author":"Adams","year":"2003","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b82","doi-asserted-by":"crossref","first-page":"836","DOI":"10.1109\/TVCG.2010.106","article-title":"Approximate boolean operations on large polyhedral solids with partial mesh reconstruction","volume":"17","author":"Wang","year":"2011","journal-title":"IEEE Trans Vis Comput Graphics"},{"key":"10.1016\/j.cad.2026.104081_b83","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1111\/1467-8659.00365","article-title":"Extending the CSG tree. Warping, blending and Boolean operations in an implicit surface modeling system","volume":"18","author":"Wyvill","year":"1999","journal-title":"Comput Graph Forum"},{"key":"10.1016\/j.cad.2026.104081_b84","first-page":"839","article-title":"Implicit surface Boolean operations based cut-and-paste algorithm for mesh models","volume":"vol. 4282","author":"Qin","year":"2006"},{"key":"10.1016\/j.cad.2026.104081_b85","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2451236.2451238","article-title":"A gradient-based implicit blend","volume":"32","author":"Gourmel","year":"2013","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b86","series-title":"Mind: Material interface generation from udfs for non-manifold surface reconstruction","author":"Chen","year":"2025"},{"key":"10.1016\/j.cad.2026.104081_b87","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0010-4485(86)90041-2","article-title":"Techniques for reducing Boolean evaluation time in CSG scan-line algorithms","volume":"18","author":"Bronsvoort","year":"1986","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b88","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1145\/1073204.1073306","article-title":"Blister: GPU-based rendering of Boolean combinations of free-form triangulated shapes","volume":"24","author":"Hable","year":"2005","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b89","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cad.2012.10.012","article-title":"Direct rendering of Boolean combinations of self-trimmed surfaces","volume":"45","author":"Rossignac","year":"2013","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b90","unstructured":"Douze M, Franco JS, Raffin B. QuickCSG: Fast arbitrary Boolean combinations of N solids, arXiv:1706.01558."},{"key":"10.1016\/j.cad.2026.104081_b91","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/TVCG.2005.72","article-title":"Boolean operations with implicit and parametric representation of primitives using R-functions","volume":"11","author":"Fougerolle","year":"2005","journal-title":"IEEE Trans Vis Comput Graphics"},{"key":"10.1016\/j.cad.2026.104081_b92","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/j.cad.2008.12.006","article-title":"Direct boolean intersection between acquired and designed geometry","volume":"41","author":"Yang","year":"2009","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b93","series-title":"Computer graphics forum","first-page":"75","article-title":"Hybrid booleans","author":"Pavi\u0107","year":"2010"},{"key":"10.1016\/j.cad.2026.104081_b94","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1016\/j.cad.2016.09.006","article-title":"Signed algebraic level sets on NURBS surfaces and implicit Boolean compositions for isogeometric CAD\u2013CAE integration","volume":"82","author":"Upreti","year":"2017","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b95","unstructured":"Okino N. Tips-1, technical information processing system for computer aided design, drawing and manufacturing. In: Proc. PROLAMAT\u201973. 1973."},{"key":"10.1016\/j.cad.2026.104081_b96","series-title":"Notes on a geometric modeller","author":"Braid","year":"1979"},{"key":"10.1016\/j.cad.2026.104081_b97","series-title":"Cgm core modeler: Convergence geometric modeler","author":"Spatial Corp.","year":"2026"},{"key":"10.1016\/j.cad.2026.104081_b98","series-title":"Ptc granite geometric kernel","author":"PTC Inc.","year":"2026"},{"key":"10.1016\/j.cad.2026.104081_b99","series-title":"Computer graphics forum","first-page":"641","article-title":"Neural fields in visual computing and beyond","author":"Xie","year":"2022"},{"key":"10.1016\/j.cad.2026.104081_b100","series-title":"Seminal graphics: pioneering efforts that shaped the field","first-page":"347","article-title":"Marching cubes: A high resolution 3d surface construction algorithm","author":"Lorensen","year":"1998"},{"key":"10.1016\/j.cad.2026.104081_b101","doi-asserted-by":"crossref","DOI":"10.1016\/j.cag.2006.07.021","article-title":"A survey of the marching cubes algorithm","author":"Newman","year":"2006","journal-title":"Comput Graph"},{"key":"10.1016\/j.cad.2026.104081_b102","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/356827.356833","article-title":"Representations for rigid solids: Theory, methods, and systems","volume":"12","author":"Requicha","year":"1980","journal-title":"ACM Comput Surv"},{"key":"10.1016\/j.cad.2026.104081_b103","series-title":"Comparing boolean operation methods on 3D solids","author":"Astarl\u0131o\u011flu","year":"2023"},{"key":"10.1016\/j.cad.2026.104081_b104","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1109\/TC.1980.1675470","article-title":"Set Membership Classification: A Unified Approach to Geometric Intersection Problems","volume":"C-29","author":"Tilove","year":"1980","journal-title":"IEEE Trans Comput"},{"key":"10.1016\/j.cad.2026.104081_b105","series-title":"A study of geometric set-membership classification","author":"Tilove","year":"1977"},{"key":"10.1016\/j.cad.2026.104081_b106","series-title":"Proceedings of 1993 IEEE research properties in virtual reality symposium","first-page":"24","article-title":"Interactive collision detection","author":"Hubbard","year":"1993"},{"key":"10.1016\/j.cad.2026.104081_b107","series-title":"2007 IEEE international conference on systems, man and cybernetics","first-page":"4046","article-title":"Collision detection: A survey","author":"Kockara","year":"2007"},{"key":"10.1016\/j.cad.2026.104081_b108","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1145\/360767.360802","article-title":"Reentrant polygon clipping","volume":"17","author":"Sutherland","year":"1974","journal-title":"Commun ACM"},{"key":"10.1016\/j.cad.2026.104081_b109","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1145\/965141.563896","article-title":"Hidden surface removal using polygon area sorting","volume":"11","author":"Weiler","year":"1977","journal-title":"ACM SIGGRAPH Comput Graph"},{"key":"10.1016\/j.cad.2026.104081_b110","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1080\/10867651.1997.10487472","article-title":"A Fast Triangle-Triangle Intersection Test","volume":"2","author":"M\u00f6ller","year":"1997","journal-title":"J Graph Tools"},{"key":"10.1016\/j.cad.2026.104081_b111","unstructured":"Guigue P, Devillers O. Fast and robust triangle-triangle overlap test using orientation predicates. J Graph Tools 8:25\u201332, URL http:\/\/www.philippe-guigue.de\/data\/triangle_triangle_intersection.html."},{"key":"10.1016\/j.cad.2026.104081_b112","series-title":"The NURBS book","author":"Piegl","year":"2012"},{"key":"10.1016\/j.cad.2026.104081_b113","volume":"vol. 15","author":"Patrikalakis","year":"2002"},{"key":"10.1016\/j.cad.2026.104081_b114","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1109\/38.180122","article-title":"Surface-to-surface intersections","volume":"13","author":"Patrikalakis","year":"2002","journal-title":"IEEE Comput Graph Appl"},{"key":"10.1016\/j.cad.2026.104081_b115","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3592452","article-title":"Topology driven approximation to rational surface-surface intersection via interval algebraic topology analysis","volume":"42","author":"Cheng","year":"2023","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b116","series-title":"Shape interrogation for computer aided design and manufacturing","first-page":"109","article-title":"Intersection problems","author":"Patrikalakis","year":"2009"},{"key":"10.1016\/j.cad.2026.104081_b117","doi-asserted-by":"crossref","DOI":"10.1016\/j.cagd.2025.102432","article-title":"Topology guaranteed and error controlled curve tracing for parametric surface-surface intersection","volume":"118","author":"Zhang","year":"2025","journal-title":"Comput Aided Geom Design"},{"key":"10.1016\/j.cad.2026.104081_b118","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2022.103236","article-title":"Robust algebraic curve intersections with tolerance control","volume":"147","author":"Shao","year":"2022","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b119","series-title":"International conference on computational visual media","first-page":"49","article-title":"An efficient and robust tracing method based on matrix representation for surface-surface intersection","author":"Chen","year":"2025"},{"key":"10.1016\/j.cad.2026.104081_b120","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1145\/174462.174617","article-title":"Algorithms for intersecting parametric and algebraic curves i: simple intersections","volume":"13","author":"Manocha","year":"1994","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b121","series-title":"Algebraic methods for geometric modeling","author":"Wintz","year":"2008"},{"key":"10.1016\/j.cad.2026.104081_b122","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0167-8396(87)90020-3","article-title":"Surface\/surface intersection","volume":"4","author":"Barnhill","year":"1987","journal-title":"Comput Aided Geom Design"},{"key":"10.1016\/j.cad.2026.104081_b123","doi-asserted-by":"crossref","first-page":"5172","DOI":"10.1109\/TVCG.2021.3070046","article-title":"Deterministic Linear Time Constrained Triangulation Using Simplified Earcut","volume":"28","author":"Livesu","year":"2022","journal-title":"IEEE Trans Vis Comput Graphics"},{"key":"10.1016\/j.cad.2026.104081_b124","doi-asserted-by":"crossref","DOI":"10.1016\/S0097-8493(96)00067-2","article-title":"Inclusion test for general polyhedra","author":"Feito","year":"1997","journal-title":"Comput Graph"},{"key":"10.1016\/j.cad.2026.104081_b125","doi-asserted-by":"crossref","DOI":"10.1016\/j.cag.2005.05.012","article-title":"Point in solid strategies","author":"Ogayar","year":"2005","journal-title":"Comput Graph"},{"key":"10.1016\/j.cad.2026.104081_b126","doi-asserted-by":"crossref","DOI":"10.1145\/3197517.3201337","article-title":"Fast winding numbers for soups and clouds","volume":"37","author":"Barill","year":"2018","journal-title":"ACM Trans Graph"},{"key":"10.1016\/j.cad.2026.104081_b127","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1038\/324446a0","article-title":"A hierarchical o (n log n) force-calculation algorithm","volume":"324","author":"Barnes","year":"1986","journal-title":"Nature"},{"key":"10.1016\/j.cad.2026.104081_b128","series-title":"Stochastic Barnes-Hut approximation for fast summation on the GPU","author":"Madan","year":"2025"},{"key":"10.1016\/j.cad.2026.104081_b129","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2431211.2431214","article-title":"Polygon mesh repairing: An application perspective","volume":"45","author":"Attene","year":"2013","journal-title":"ACM Comput Surv"},{"key":"10.1016\/j.cad.2026.104081_b130","series-title":"2010 18th international conference on geoinformatics","first-page":"1","article-title":"Three dimensional Boolean operation based on L-Rep model","author":"Zhou","year":"2010"},{"key":"10.1016\/j.cad.2026.104081_b131","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0166-3615(99)00010-X","article-title":"A new collision detection method for csg-represented objects in virtual manufacturing","volume":"40","author":"Su","year":"1999","journal-title":"Comput Ind"},{"key":"10.1016\/j.cad.2026.104081_b132","series-title":"DiffCSG: Differentiable CSG via rasterization","author":"Yuan","year":"2024"},{"key":"10.1016\/j.cad.2026.104081_b133","series-title":"Acm siggraph 2013 courses","article-title":"Openvdb: an open-source data structure and toolkit for high-resolution volumes","author":"Museth","year":"2013"},{"key":"10.1016\/j.cad.2026.104081_b134","doi-asserted-by":"crossref","unstructured":"Park JJ, Florence P, Straub J, Newcombe R, Lovegrove S. Deepsdf: Learning continuous signed distance functions for shape representation. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition. 2019, p. 165\u201374.","DOI":"10.1109\/CVPR.2019.00025"},{"key":"10.1016\/j.cad.2026.104081_b135","doi-asserted-by":"crossref","unstructured":"Mescheder L, Oechsle M, Niemeyer M, Nowozin S, Geiger A. Occupancy networks: Learning 3d reconstruction in function space. In: Proceedings of the IEEE\/CVF conference on computer vision and pattern recognition. 2019, p. 4460\u201370.","DOI":"10.1109\/CVPR.2019.00459"},{"key":"10.1016\/j.cad.2026.104081_b136","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1093\/comjnl\/16.2.157","article-title":"A constructive geometry for computer graphics","volume":"16","author":"Ricci","year":"1973","journal-title":"Comput J"},{"key":"10.1016\/j.cad.2026.104081_b137","series-title":"ntopology","author":"nTopology","year":"2026"},{"key":"10.1016\/j.cad.2026.104081_b138","series-title":"Adobe substance 3d","author":"Inc.","year":"2026"},{"key":"10.1016\/j.cad.2026.104081_b139","series-title":"Womp 3d creator","author":"Womp","year":"2026"},{"key":"10.1016\/j.cad.2026.104081_b140","series-title":"Magicacsg","author":"Community","year":"2026"},{"key":"10.1016\/j.cad.2026.104081_b141","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1007\/PL00009321","article-title":"Adaptive precision floating-point arithmetic and fast robust geometric predicates","volume":"18","author":"Richard Shewchuk","year":"1997","journal-title":"Discrete Comput Geom"},{"key":"10.1016\/j.cad.2026.104081_b142","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0010-4485(96)00041-3","article-title":"Polyhedral modelling with multiprecision integer arithmetic","volume":"29","author":"Fortune","year":"1997","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b143","series-title":"Computational science \u2014 ICCS 2001","first-page":"12","article-title":"Robust geometric computation based on topological consistency","author":"Sugihara","year":"2001"},{"key":"10.1016\/j.cad.2026.104081_b144","series-title":"GNU MP 6.0 Multiple precision arithmetic library","author":"Granlund","year":"2015"},{"key":"10.1016\/j.cad.2026.104081_b145","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/1236463.1236468","article-title":"Mpfr: A multiple-precision binary floating-point library with correct rounding","volume":"33","author":"Fousse","year":"2007","journal-title":"ACM Trans Math Softw (TOMS)"},{"key":"10.1016\/j.cad.2026.104081_b146","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/j.scico.2010.09.003","article-title":"A generic lazy evaluation scheme for exact geometric computations","volume":"76","author":"Pion","year":"2011","journal-title":"Sci Comput Program"},{"key":"10.1016\/j.cad.2026.104081_b147","series-title":"Handbook of discrete and computational geometry","first-page":"1189","article-title":"Robust geometric computation","author":"Sharma","year":"2017"},{"key":"10.1016\/j.cad.2026.104081_b148","first-page":"1167","article-title":"On the design of cgal a computational geometry algorithms library","volume":"30","author":"Fabri","year":"2000","journal-title":"Softw: Pr Exp"},{"key":"10.1016\/j.cad.2026.104081_b149","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1142\/S0218195901000493","article-title":"Exact geometric computation using cascading","volume":"11","author":"Burnikel","year":"2001","journal-title":"Internat J Comput Geom Appl"},{"key":"10.1016\/j.cad.2026.104081_b150","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/S0925-7721(99)00011-5","article-title":"Further results on arithmetic filters for geometric predicates","volume":"13","author":"Devillers","year":"1999","journal-title":"Comput Geom"},{"key":"10.1016\/j.cad.2026.104081_b151","article-title":"Accelerating the exact evaluation of geometric predicates with gpus","volume":"vol. 16","author":"de Matos Menezes","year":"2019"},{"key":"10.1016\/j.cad.2026.104081_b152","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s10543-023-00975-x","article-title":"Fast floating-point filters for robust predicates","volume":"63","author":"Bartels","year":"2023","journal-title":"BIT Numer Math"},{"key":"10.1016\/j.cad.2026.104081_b153","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2020.102856","article-title":"Indirect predicates for geometric constructions","volume":"126","author":"Attene","year":"2020","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b154","series-title":"Robustness and precision issues in geometric computation","author":"Schirra","year":"1998"},{"key":"10.1016\/j.cad.2026.104081_b155","doi-asserted-by":"crossref","first-page":"2425","DOI":"10.1080\/00207540210128242","article-title":"A comprehensive review of tolerancing research","volume":"40","author":"Hong","year":"2002","journal-title":"Int J Prod Res"},{"key":"10.1016\/j.cad.2026.104081_b156","doi-asserted-by":"crossref","unstructured":"Salesin D, Stolfi J, Guibas L. Epsilon geometry: building robust algorithms from imprecise computations. In: Proceedings of the fifth annual symposium on computational geometry. 1989, p. 208\u201317.","DOI":"10.1145\/73833.73857"},{"key":"10.1016\/j.cad.2026.104081_b157","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1016\/j.cad.2005.10.010","article-title":"Topological formulation of tolerant solid modeling","volume":"38","author":"Qi","year":"2006","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b158","series-title":"Proceedings of the thirteenth annual symposium on computational geometry","first-page":"284","article-title":"Snap rounding line segments efficiently in two and three dimensions","author":"Goodrich","year":"1997"},{"key":"10.1016\/j.cad.2026.104081_b159","series-title":"Introduction to interval analysis","author":"Moore","year":"2009"},{"key":"10.1016\/j.cad.2026.104081_b160","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2019.102801","article-title":"An efficient and exact parallel algorithm for intersecting large 3-D triangular meshes using arithmetic filters","volume":"120","author":"de Magalh\u00e3es","year":"2020","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b161","doi-asserted-by":"crossref","DOI":"10.1016\/j.cad.2022.103285","article-title":"Fast parallel evaluation of exact geometric predicates on gpus","volume":"150","author":"de Matos Menezes","year":"2022","journal-title":"Computer-Aided Des"},{"key":"10.1016\/j.cad.2026.104081_b162","series-title":"Solid modeling","article-title":"Progressive dimension-independent boolean operations","author":"Paoluzzi","year":"2004"},{"issue":"3","key":"10.1016\/j.cad.2026.104081_b163","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/S0010-4485(01)00219-6","article-title":"Design of heterogeneous turbine blade","volume":"35","author":"Qian","year":"2003","journal-title":"Computer-aided design"}],"container-title":["Computer-Aided Design"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448526000515?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0010448526000515?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,4]],"date-time":"2026-07-04T17:07:39Z","timestamp":1783184859000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0010448526000515"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":163,"alternative-id":["S0010448526000515"],"URL":"https:\/\/doi.org\/10.1016\/j.cad.2026.104081","relation":{},"ISSN":["0010-4485"],"issn-type":[{"value":"0010-4485","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A survey of Boolean operations in 3D geometric modeling","name":"articletitle","label":"Article Title"},{"value":"Computer-Aided Design","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cad.2026.104081","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Ltd. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"104081"}}