<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Programming and Computer Software</journal-id><journal-title-group><journal-title xml:lang="en">Programming and Computer Software</journal-title><trans-title-group xml:lang="ru"><trans-title>Программирование</trans-title></trans-title-group></journal-title-group><issn publication-format="print">0132-3474</issn><issn publication-format="electronic">3034-5847</issn><publisher><publisher-name xml:lang="en">The Russian Academy of Sciences</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">688100</article-id><article-id pub-id-type="doi">10.31857/S0132347425030027</article-id><article-id pub-id-type="edn">GQQQOR</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>COMPUTER GRAFICS AND VISUALIZATION</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>КОМПЬЮТЕРНАЯ ГРАФИКА И ВИЗУАЛИЗАЦИЯ</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">Study of surface representation methods based on signed distance functions</article-title><trans-title-group xml:lang="ru"><trans-title>Исследование методов представления поверхностей на основе функций расстояний со знаком</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-5385-4841</contrib-id><name-alternatives><name xml:lang="en"><surname>Garifullin</surname><given-names>A. R.</given-names></name><name xml:lang="ru"><surname>Гарифуллин</surname><given-names>А. Р.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><email>albert.garifullin@gin.keldysh.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-8829-9884</contrib-id><name-alternatives><name xml:lang="en"><surname>Frolov</surname><given-names>V. A.</given-names></name><name xml:lang="ru"><surname>Фролов</surname><given-names>В. А.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><email>vladimir.frolov@graphics.cs.msu.ru</email><xref ref-type="aff" rid="aff2"/><xref ref-type="aff" rid="aff1"/><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0005-6819-4184</contrib-id><name-alternatives><name xml:lang="en"><surname>Budak</surname><given-names>A. S.</given-names></name><name xml:lang="ru"><surname>Будак</surname><given-names>А. С.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><email>s02220347@gse.cs.msu.ru</email><xref ref-type="aff" rid="aff2"/><xref ref-type="aff" rid="aff3"/></contrib><contrib contrib-type="author"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0003-1252-8294</contrib-id><name-alternatives><name xml:lang="en"><surname>Galaktionov</surname><given-names>V. A.</given-names></name><name xml:lang="ru"><surname>Галактионов</surname><given-names>В. А.</given-names></name></name-alternatives><address><country country="RU">Russian Federation</country></address><email>vlgal@gin.keldysh.ru</email><xref ref-type="aff" rid="aff4"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Keldysh Institute of Applied Mathematics, Russian Academy of Sciences 4 Miusskaya Square</institution></aff><aff><institution xml:lang="ru">Институт прикладной математики им. М. В. Келдыша РАН</institution></aff></aff-alternatives><aff-alternatives id="aff2"><aff><institution xml:lang="en">Institute of Artificial Intelligence, Moscow State University Leninskie Gory</institution></aff><aff><institution xml:lang="ru">Институт искусственного интеллекта Московского государственного университета им. М. В. Ломоносова</institution></aff></aff-alternatives><aff-alternatives id="aff3"><aff><institution xml:lang="en">Moscow State University Leninskie Gory Faculty of Computational Mathematics and Cybernetics</institution></aff><aff><institution xml:lang="ru">Московский государственный университет им. М. В. Ломоносова, факультет высшей математики и кибернетики</institution></aff></aff-alternatives><aff-alternatives id="aff4"><aff><institution xml:lang="en">Keldysh Institute of Applied Mathematics, Russian Academy of Sciences</institution></aff><aff><institution xml:lang="ru">Институт прикладной математики им. М. В. Келдыша РАН</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2025-07-04" publication-format="electronic"><day>04</day><month>07</month><year>2025</year></pub-date><issue>3</issue><issue-title xml:lang="en"/><issue-title xml:lang="ru"/><fpage>15</fpage><lpage>26</lpage><history><date date-type="received" iso-8601-date="2025-07-22"><day>22</day><month>07</month><year>2025</year></date><date date-type="accepted" iso-8601-date="2025-07-22"><day>22</day><month>07</month><year>2025</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2025, Russian Academy of Sciences</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2025, Российская академия наук</copyright-statement><copyright-year>2025</copyright-year><copyright-holder xml:lang="en">Russian Academy of Sciences</copyright-holder><copyright-holder xml:lang="ru">Российская академия наук</copyright-holder></permissions><self-uri xlink:href="https://transsyst.ru/0132-3474/article/view/688100">https://transsyst.ru/0132-3474/article/view/688100</self-uri><abstract xml:lang="en"><p>The paper studies surface rendering methods based on ray tracing for representations based on signed distance functions. The main objects of interest were the rendering algorithm execution time, the amount of memory occupied, and the accuracy of the surface representation estimated by the render using the <italic>PSNR</italic> metric. Six different representations and four intersection search algorithms were analyzed. In all cases, a bounding volume hierarchy was used as an accelerating structure. The comparison revealed promising representations and algorithms and showed that distance functions in some cases are not inferior to polygonal models in speed, while they can win in terms of memory consumption and represent the surface with a good level of accuracy.</p></abstract><trans-abstract xml:lang="ru"><p>В работе проведено исследование методов рендеринга поверхностей на основе трассировки лучей для представлений на базе функций расстояний со знаком. В качестве основных объектов интереса были выбраны время работы алгоритма рендеринга, объем занимаемой памяти, точность представления поверхности, оцениваемая по рендеру с помощью метрики <italic>PSNR</italic>. Проанализировано 6 различных представлений и 4 алгоритма поиска пересечений. В качестве ускоряющей структуры во всех случаях использовалась иерархия ограничивающих объемов (BVH-деревья). Проведенное сравнение выявило перспективные представления и алгоритмы и показало, что функции расстояний в ряде случаев практически не уступают полигональным моделям по скорости, хотя при этом могут выигрывать по объему потребляемой памяти и представлять поверхность с хорошим уровнем точности.</p></trans-abstract><kwd-group xml:lang="en"><kwd>ray tracing rendering</kwd><kwd>3D model visualization</kwd><kwd>signed distance functions</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>рендеринг трассировки лучей</kwd><kwd>визуализация 3D-моделей</kwd><kwd>функции дистанции со знаком</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">Rogers D.F. An Introduction to NURBS: With Historical Perspective, Elsevier, 2000.</mixed-citation><mixed-citation xml:lang="ru">Rogers D.F. An introduction to NURBS: with historical perspective. Elsevier, 2000.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">Sitzmann V., Martel J., Bergman A., Lindell D., Wetzstein G. Implicit neural representations with periodic activation functions, Advances in Neural Information Processing Systems, Larochelle H., Ranzato M., Hadsell R., Balcan M.F., and Lin H., Eds., Curran Associates, 2020, vol. 33, pp. 7462–7473. https://proceedings.neurips.cc/paper_files/paper/2020/file/53c04118df112c13a8c34b38343b9c10-Paper.pdf</mixed-citation><mixed-citation xml:lang="ru">Sitzmann V. et al. Implicit neural representations with periodic activation functions // Advances in neural information processing systems. 2020. V. 33. P. 7462–7473.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">Takikawa T., Litalien J., Yin K., Kreis K., Loop Ch., Nowrouzezahrai D., Jacobson A., Mcguire M., Fidler S. Neural geometric level of detail: Real-time rendering with implicit 3d shapes, 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Nashville, TN, 2021, IEEE, 2021, pp. 11358–11367. https://doi.org/10.1109/cvpr46437.2021.01120</mixed-citation><mixed-citation xml:lang="ru">Takikawa T. et al. Neural geometric level of detail: Real-time rendering with implicit 3d shapes // Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2021. P. 11358–11367.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">Luan F., Zhao Sh., Bala K., Dong Zh. Unified shape and SVBRDF recovery using differentiable Monte Carlo rendering, Comput. Graphics Forum, 2021, vol. 40, no. 4, pp. 101–113. https://doi.org/10.1111/cgf.14344</mixed-citation><mixed-citation xml:lang="ru">Luan F. et al. Unified shape and svbrdf recovery using differentiable monte carlo rendering // Computer Graphics Forum. 2021. V. 40. № 4. P. 101–113.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">Nicolet B., Jacobson A., Jakob W. Large steps in inverse rendering of geometry, ACM Trans. Graphics, 2021, vol. 40, no. 6, p. 248. https://doi.org/10.1145/3478513.3480501</mixed-citation><mixed-citation xml:lang="ru">Nicolet B., Jacobson A., Jakob W. Large steps in inverse rendering of geometry // ACM Transactions on Graphics (TOG). 2021. V. 40. № 6. P. 1–13.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">Vicini D., Speierer S., Jakob W. Differentiable signed distance function rendering, ACM Trans. Graphics, 2022, vol. 41, no. 4, p. 125. https://doi.org/10.1145/3528223.3530139</mixed-citation><mixed-citation xml:lang="ru">Vicini D., Speierer S., Jakob W. Differentiable signed distance function rendering // ACM Transactions on Graphics (TOG). 2022. V. 41. № 4. P. 1–18.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">Cao Yu., Li H. DiffSDF: Learning implicit surface from noisy point clouds, 2023 International Conference on Digital Image Computing: Techniques and Applications (DICTA), Port Macquarie, Australia, 2023, IEEE, 2023, pp. 197–204. https://doi.org/10.1109/DICTA60407.2023.00035</mixed-citation><mixed-citation xml:lang="ru">Cao Y., Li H. DiffSDF: Learning Implicit Surface from Noisy Point Clouds // 2023 International Conference on Digital Image Computing: Techniques and Applications (DICTA). IEEE, 2023. P. 197–204.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">Hart J.C. Sphere tracing: A geometric method for the antialiased ray tracing of implicit surfaces, Visual Comput., 1996, vol. 12, no. 10, pp. 527–545. https://doi.org/10.1007/s003710050084</mixed-citation><mixed-citation xml:lang="ru">Hart J.C. Sphere tracing: A geometric method for the antialiased ray tracing of implicit surfaces // The Visual Computer. 1996. V. 12. № 10. P. 527–545.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">Quilez I. Distance functions. https://iquilezles.org/articles/distfunctions/ (сited June 12, 2024)</mixed-citation><mixed-citation xml:lang="ru">Inigo Quilez. Distance Functions // WEB publication. https://iquilezles.org/articles/distfunctions/ (accesed: 12.06.2024)</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">Quilez I. Raymarching terrain. https://iquilezles.org/articles/terrainmarching/ (сited June 12, 2024)</mixed-citation><mixed-citation xml:lang="ru">Ingo Quilez. Distance Functions // WEB publication. https://iquilezles.org/articles/terrainmarching/ (accesed: 12.06.2024)</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">Polkowski D. San Base: Forefront of computer graphics. https://www.youtube.com/@lashenko (сited June 12, 2024)</mixed-citation><mixed-citation xml:lang="ru">Polkowski D. San Base: Авангард компьютерной графики // WEB publication. https://www.youtube.com/@lashenko (accesed: 12.06.2024)</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">Frisken S.F., Perry R.N., Rockwood A.P., Jones T.R. Adaptively sampled distance fields: A general representation of shape for computer graphics, Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques, New Orleans, 2000, New York: ACM Press/Addison-Wesley, 2000, pp. 249–254. https://doi.org/10.1145/344779.344899</mixed-citation><mixed-citation xml:lang="ru">Frisken S.F. et al. Adaptively sampled distance fields: A general representation of shape for computer graphics // Proceedings of the 27th annual conference on Computer graphics and interactive techniques. 2000. P. 249–254.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">Sellers G., Kessenich J. Vulkan Programming Guide: The Official Guide to Learning Vulkan, Addison–Wesley, 2016.</mixed-citation><mixed-citation xml:lang="ru">Sellers G., Kessenich J. Vulkan programming guide: The official guide to learning vulkan // Addison–Wesley Professional, 2016.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">Koschier D., Deul C., Brand M., Bender J. An hp-adaptive discretization algorithm for signed distance field generation, IEEE Trans. Visualization Comput. Graphics, 2017, vol. 23, no. 10, pp. 2208–2221. https://doi.org/10.1109/tvcg.2017.2730202</mixed-citation><mixed-citation xml:lang="ru">Koschier D. et al. An hp-adaptive discretization algorithm for signed distance field generation // IEEE transactions on visualization and computer graphics. 2017. V. 23. № 10. P. 2208–2221.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">Söderlund H.H., Evans A., Akenine-Möller T. Ray tracing of signed distance function grids, Journal of Computer Graphics Techniques, 2022, vol. 11, no. 3, pp. 94–113.</mixed-citation><mixed-citation xml:lang="ru">Söderlund H.H., Evans A., Akenine-Möller T. Ray Tracing of Signed Distance Function Grids // Journal of Computer Graphics Techniques. 2022. V. 11. № 3. P. 94–113.</mixed-citation></citation-alternatives></ref><ref id="B16"><label>16.</label><citation-alternatives><mixed-citation xml:lang="en">Fujimoto A., Iwata K. Accelerated ray tracing, Computer Graphics, Kunii T.L., Ed., Tokyo: Springer, 1985, pp. 41–65. https://doi.org/10.1007/978-4-431-68030-7_4</mixed-citation><mixed-citation xml:lang="ru">Fujimoto A., Iwata K. Accelerated ray tracing // Computer Graphics: Visual Technology and Art Proceedings of Computer Graphics Tokyo′ 85. Tokyo: Springer Japan, 1985. P. 41–65.</mixed-citation></citation-alternatives></ref><ref id="B17"><label>17.</label><citation-alternatives><mixed-citation xml:lang="en">Weier P., Rath A., Michel É., Georgiev I., Slusallek P., Boubekeur T. N-BVH: Neural ray queries with bounding volume hierarchies, Special Interest Group on Computer Graphics and Interactive Techniques Conference Conference Papers’24, Denver, CO, 2024, Burbano A., Zorin D., and Jarosz W., Eds., New York: Association for Computing Machinery, 2024, p. 99. https://doi.org/10.1145/3641519.3657464</mixed-citation><mixed-citation xml:lang="ru">Weier Р., Rath А., Michel É., Georgiev I., Slusallek P., Boubekeur T. 2N-BVH: Neural ray queries with bounding volume hierarchies. In ACM SIGGRAPH 2024 Conference Papers (SIGGRAPH '24). 2024. Association for Computing Machinery, New York, NY, USA, Article 99. P. 1–11. https://doi.org/10.1145/3641519.3657464</mixed-citation></citation-alternatives></ref><ref id="B18"><label>18.</label><citation-alternatives><mixed-citation xml:lang="en">Fujieda S., Kao C.C., Harada T. Neural intersection function, High-Performance Graphics – Symposium Papers, Bikker J. and Gribble Ch., Eds., The Eurographics Association, 2023. https://doi.org/10.2312/hpg.20231135</mixed-citation><mixed-citation xml:lang="ru">Fujieda S., Kao C.C., Harada T. Neural Intersection Function // arXiv preprint arXiv:2306.07191.2023.</mixed-citation></citation-alternatives></ref><ref id="B19"><label>19.</label><citation-alternatives><mixed-citation xml:lang="en">Galin E., Guérin E., Paris A., Peytavie A. Segment tracing using local Lipschitz bounds, Comput. Graphics Forum, 2020, vol. 39, no. 2, pp. 545–554. https://doi.org/10.1111/cgf.13951</mixed-citation><mixed-citation xml:lang="ru">Galin E. et al. Segment tracing using local lipschitz bounds // Computer Graphics Forum. 2020. V. 39. № 2. P. 545–554.</mixed-citation></citation-alternatives></ref><ref id="B20"><label>20.</label><citation-alternatives><mixed-citation xml:lang="en">Marmitt G., Kleer A., Friedrich H., Wald I., Slusallek P. Fast and accurate ray-voxel intersection techniques for iso-surface ray tracing, Proceedings of the Vision, Modeling, and Visualization Conference (VMV 2004), Stanford, CA, 2004, vol. 4, pp. 429–435.</mixed-citation><mixed-citation xml:lang="ru">Marmitt G. et al. Fast and Accurate Ray-Voxel Intersection Techniques for Iso-Surface Ray Tracing // VMV. 2004. V. 4. P. 429–435.</mixed-citation></citation-alternatives></ref><ref id="B21"><label>21.</label><citation-alternatives><mixed-citation xml:lang="en">Stich M., Friedrich H., Dietrich A. Spatial splits in bounding volume hierarchies, Proceedings of the Conference on High Performance Graphics 2009, New Orleans, 2009, Spencer S.N., McAllister D., Pharr M., and Wald I., Eds., New York: Association for Computing Machinery, 2009, pp. 7–13. https://doi.org/10.1145/1572769.1572771</mixed-citation><mixed-citation xml:lang="ru">Stich M., Friedrich H., Dietrich A. Spatial splits in bounding volume hierarchies // In Proceedings of the Conference on High Performance Graphics 2009 (HPG '09). 2009. Association for Computing Machinery, New York, NY, USA. P. 7–13. https://doi.org/10.1145/1572769.1572771</mixed-citation></citation-alternatives></ref><ref id="B22"><label>22.</label><citation-alternatives><mixed-citation xml:lang="en">Wald I., Woop S., Benthin C., Johnson G.S., Ernst M. Embree: A kernel framework for efficient CPU ray tracing, ACM Trans. Graphics, 2014, vol. 33, no. 4, p. 143. https://doi.org/10.1145/2601097.2601199</mixed-citation><mixed-citation xml:lang="ru">Wald I. et al. Embree: a kernel framework for efficient CPU ray tracing // ACM Transactions on Graphics (TOG). 2014. V. 33. № 4. P. 1–8.</mixed-citation></citation-alternatives></ref><ref id="B23"><label>23.</label><citation-alternatives><mixed-citation xml:lang="en">Frolov V., Sanzharov V., Galaktionov V. Kernel_slicer: High-level approach on top of GPU programming API, 2022. Ivannikov Ispras Open Conference (ISPRAS), Moscow, 2022, IEEE, 2022, pp. 11–17. https://doi.org/10.1109/ispras57371.2022.10076850</mixed-citation><mixed-citation xml:lang="ru">Frolov V., Sanzharov V., Galaktionov V. Kernel_slicer: high-level approach on top of GPU programming API // 2022 Ivannikov Ispras Open Conference (ISPRAS). IEEE, 2022. P. 11–17.</mixed-citation></citation-alternatives></ref><ref id="B24"><label>24.</label><citation-alternatives><mixed-citation xml:lang="en">Zhdanov D.D., Potemin I.S., Zhdanov A.D. Embree technology for ray tracing in optical systems with free shape surfaces, Trudy 33-i Mezhdunarodnoi konferentsii po komp’yuternoi grafike i mashinnomu zreniyu GrafiKon 2023 (Proceedings of the 33rd International Conference on Computer Graphics and Machine Visiton GraphiCon2023), Moscow: Institut Prikladnoi Matematiki im. M.V. Keldysha Rossiiskoi Akademii Nauk, 2023, vol. 33, pp. 97–107. https://doi.org/10.20948/graphicon-2023-97-107</mixed-citation><mixed-citation xml:lang="ru">Жданов Д.Д., Потемин И.С., Жданов А.Д. Использование технологий Embree для трассировки лучей в оптических системах с поверхностями свободной формы // Труды 33-й Международной конференции по компьютерной графике и машинному зрению ГрафиКон 2023, ИПУ им. В.А. Трапезникова РАН, Москва, Россия, 2023. V. 33. P. 97–107.</mixed-citation></citation-alternatives></ref><ref id="B25"><label>25.</label><citation-alternatives><mixed-citation xml:lang="en">Jones M.W. Distance field compression, J. WSCG, 2004, vol. 12, no. 2, pp. 199–204.</mixed-citation><mixed-citation xml:lang="ru">Jones M.W. Distance field compression // Journal of WSCG. 2004. V. 12. № 2. P. 199–204.</mixed-citation></citation-alternatives></ref><ref id="B26"><label>26.</label><citation-alternatives><mixed-citation xml:lang="en">Nießner M., Zollhöfer M., Izadi Sh., Stamminger M. Real-time 3D reconstruction at scale using voxel hashing, ACM Trans. Graphics, 2013, vol. 32, no. 6, p. 169. https://doi.org/10.1145/2508363.2508374</mixed-citation><mixed-citation xml:lang="ru">Nießner M., Zollhöfer M., Izadi S., Stamminger M. Real-time 3D reconstruction at scale using voxel hashing // ACM Trans. Graph. 32, 6, Article 169 (November 2013), 11 p. https://doi.org/10.1145/2508363.2508374</mixed-citation></citation-alternatives></ref><ref id="B27"><label>27.</label><citation-alternatives><mixed-citation xml:lang="en">Boyko A.I., Matrosov M.P., Oseledets I.V., Tsetserukou D., Ferrer G. TT-TSDF: Memory-efficient TSDF with low-rank tensor train decomposition, 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), Las Vegas, 2020, IEEE, 2020, pp. 10116–10121. https://doi.org/10.1109/iros45743.2020.9341464</mixed-citation><mixed-citation xml:lang="ru">Boyko A.I., Matrosov M.P., Oseledets I.O., Tsetserukou D., Ferrer G. Tt-tsdf: Memory-efficient tsdf with low-rank tensor train decomposition // In 2020 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 10116–10121. IEEE, 2020.</mixed-citation></citation-alternatives></ref><ref id="B28"><label>28.</label><citation-alternatives><mixed-citation xml:lang="en">Garland M., Heckbert P.S. Surface simplification using quadric error metrics, Seminal Graphics Papers: Pushing the Boundaries, Volume 2, Whitton M.C., Ed., New York: Association for Computing Machinery, 2023, vol. 2, p. 15. https://doi.org/10.1145/3596711.3596727</mixed-citation><mixed-citation xml:lang="ru">Garland M., Heckbert P.S. Surface Simplification Using Quadric Error Metrics. Seminal Graphics Papers: Pushing the Boundaries. V. 2 (1st ed.). 2023. Association for Computing Machinery, New York, NY, USA, Article 15, P. 131–138. https://doi.org/10.1145/3596711.3596727</mixed-citation></citation-alternatives></ref></ref-list></back></article>
