{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T00:23:27Z","timestamp":1773102207963,"version":"3.50.1"},"reference-count":74,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,5,21]],"date-time":"2024-05-21T00:00:00Z","timestamp":1716249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"crossref","award":["IIS-1910766"],"award-info":[{"award-number":["IIS-1910766"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002946","name":"German Aerospace Center","doi-asserted-by":"crossref","award":["DLR-SC-2712024 (VisPlore)"],"award-info":[{"award-number":["DLR-SC-2712024 (VisPlore)"]}],"id":[{"id":"10.13039\/501100002946","id-type":"DOI","asserted-by":"crossref"}]},{"name":"National Science Foundation under NSF","award":["1948997, 1948994 & 1948857"],"award-info":[{"award-number":["1948997, 1948994 & 1948857"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2024,6,30]]},"abstract":"<jats:p>We address the problem of performing a topology-aware simplification algorithm on a compact and distributed data structure for triangle meshes, the Terrain trees. Topology-aware operators have been defined to coarsen a Triangulated Irregular Network (TIN) without affecting the topology of its underlying terrain, i.e., without modifying critical features of the terrain, such as pits, saddles, peaks, and their connectivity. However, their scalability is limited for large-scale meshes. Our proposed algorithm uses a batched processing strategy to reduce both the memory and time requirements of the simplification process, and thanks to the spatial decomposition on the basis of Terrain trees, it can be easily parallelized. Also, since a Terrain tree after the simplification process becomes less compact and efficient, we propose an efficient post-processing step for updating hierarchical spatial decomposition. Our experiments on real-world TINs, derived from topographic and bathymetric LiDAR data, demonstrate the scalability and efficiency of our approach. Specifically, topology-aware simplification on Terrain trees uses 40% less memory and half the time compared to the most compact and efficient connectivity-based data structure for TINs. Furthermore, the parallel simplification algorithm on the Terrain trees exhibits a 12\u00d7 speedup with an OpenMP implementation. The quality of the output mesh is not significantly affected by the distributed and parallel simplification strategy of Terrain trees, and we obtain similar quality levels compared to the global baseline method.<\/jats:p>","DOI":"10.1145\/3652602","type":"journal-article","created":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:53:11Z","timestamp":1710330791000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Parallel Topology-aware Mesh Simplification on Terrain Trees"],"prefix":"10.1145","volume":"10","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3053-1748","authenticated-orcid":false,"given":"Yunting","family":"Song","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8758-2802","authenticated-orcid":false,"given":"Riccardo","family":"Fellegara","sequence":"additional","affiliation":[{"name":"German Aerospace Center (DLR), Institute for Software Technology, Braunschweig, Germany"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6605-9131","authenticated-orcid":false,"given":"Federico","family":"Iuricich","sequence":"additional","affiliation":[{"name":"Clemson University, Clemson, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1361-2888","authenticated-orcid":false,"given":"Leila","family":"De Floriani","sequence":"additional","affiliation":[{"name":"University of Maryland, College Park, USA"}]}],"member":"320","published-online":{"date-parts":[[2024,5,21]]},"reference":[{"key":"e_1_3_4_2_2","doi-asserted-by":"crossref","first-page":"705","DOI":"10.1109\/ICME.2002.1035879","volume-title":"Proceedings of the IEEE International Conference on Multimedia and Expo (ICME \u201902)","volume":"1","author":"Aspert Nicolas","year":"2002","unstructured":"Nicolas Aspert, Diego Santa-Cruz, and Touradj Ebrahimi. 2002. MESH: Measuring errors between surfaces using the Hausdorff distance. In Proceedings of the IEEE International Conference on Multimedia and Expo (ICME \u201902), Vol. 1. 705\u2013708. DOI:10.1109\/ICME.2002.1035879"},{"key":"e_1_3_4_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-8493(97)00079-4"},{"issue":"5","key":"e_1_3_4_4_2","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/00029890.1970.11992523","article-title":"Critical points and curvature for embedded polyhedral surfaces","volume":"77","author":"Banchoff Thomas F.","year":"1970","unstructured":"Thomas F. Banchoff. 1970. Critical points and curvature for embedded polyhedral surfaces. Am. Math. Monthly 77, 5 (1970), 475\u2013485.","journal-title":"Am. Math. Monthly"},{"key":"e_1_3_4_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.coastaleng.2019.103622"},{"issue":"1","key":"e_1_3_4_6_2","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1007\/s10851-014-0506-3","article-title":"Sliced and radon wasserstein barycenters of measures","volume":"51","author":"Bonneel Nicolas","year":"2015","unstructured":"Nicolas Bonneel, Julien Rabin, Gabriel Peyr\u00e9, and Hanspeter Pfister. 2015. Sliced and radon wasserstein barycenters of measures. J. Math. Imag. Vis. 51, 1 (2015), 22\u201345.","journal-title":"J. Math. Imag. Vis."},{"key":"e_1_3_4_7_2","doi-asserted-by":"publisher","DOI":"10.1007\/b106657_1"},{"key":"e_1_3_4_8_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2015.05.015"},{"key":"e_1_3_4_9_2","unstructured":"CGAL 2021. Computational Geometry Algorithms Library (CGAL). Retrieved April 2021 from https:\/\/www.cgal.org\/"},{"key":"e_1_3_4_10_2","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02207695","article-title":"Does contraction preserve triangular meshes?","volume":"13","author":"Ciarlet Patrick","year":"1996","unstructured":"Patrick Ciarlet and Fran\u00e7oise Lamour. 1996. Does contraction preserve triangular meshes? Numer. Algor. 13, 2 (1996), 201\u2013223.","journal-title":"Numer. Algor."},{"issue":"3","key":"e_1_3_4_11_2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1111\/1467-8659.00698","article-title":"BDAM \u2013 batched dynamic adaptive meshes for high performance terrain visualization","volume":"22","author":"Cignoni Paolo","year":"2003","unstructured":"Paolo Cignoni, Fabio Ganovelli, Enrico Gobbetti, Fabio Marton, Federico Ponchio, and Roberto Scopigno. 2003. BDAM \u2013 batched dynamic adaptive meshes for high performance terrain visualization. Comput. Graph. Forum 22, 3 (2003), 505\u2013514.","journal-title":"Comput. Graph. Forum"},{"key":"e_1_3_4_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-8493(97)00082-4"},{"issue":"2","key":"e_1_3_4_13_2","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1111\/1467-8659.00236","article-title":"Metro: Measuring error on simplified surfaces","volume":"17","author":"Cignoni Paolo","year":"1998","unstructured":"Paolo Cignoni, Claudio Rocchini, and Roberto Scopigno. 1998. Metro: Measuring error on simplified surfaces. Comput. Graph. Forum 17, 2 (1998), 167\u2013174.","journal-title":"Comput. Graph. Forum"},{"key":"e_1_3_4_14_2","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/978-3-0348-8534-8_21","volume-title":"Programming Environments for Massively Parallel Distributed Systems","author":"Clarke Lyndon","year":"1994","unstructured":"Lyndon Clarke, Ian Glendinning, and Rolf Hempel. 1994. The MPI message passing interface standard. In Programming Environments for Massively Parallel Distributed Systems. Birkh\u00e4user Basel, Basel, 213\u2013218."},{"key":"e_1_3_4_15_2","first-page":"263","volume-title":"Proceedings of the 21st Annual Symposium on Computational Geometry (SCG \u201905)","author":"Cohen-Steiner David","year":"2005","unstructured":"David Cohen-Steiner, Herbert Edelsbrunner, and John Harer. 2005. Stability of persistence diagrams. In Proceedings of the 21st Annual Symposium on Computational Geometry (SCG \u201905). Association for Computing Machinery, New York, NY, 263\u2013271. DOI:10.1145\/1064092.1064133"},{"issue":"2","key":"e_1_3_4_16_2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10208-010-9060-6","article-title":"Lipschitz functions have L p-stable persistence","volume":"10","author":"Cohen-Steiner David","year":"2010","unstructured":"David Cohen-Steiner, Herbert Edelsbrunner, John Harer, and Yuriy Mileyko. 2010. Lipschitz functions have L p-stable persistence. Found. Comput. Math. 10, 2 (2010), 127\u2013139.","journal-title":"Found. Comput. Math."},{"key":"e_1_3_4_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2012.03.010"},{"issue":"1","key":"e_1_3_4_18_2","first-page":"46","article-title":"OpenMP: An industry standard API for shared-memory programming","volume":"5","author":"Dagum Leonardo","year":"1998","unstructured":"Leonardo Dagum and Ramesh Menon. 1998. OpenMP: An industry standard API for shared-memory programming. Comput. Sci. Eng. 5, 1 (1998), 46\u201355.","journal-title":"Comput. Sci. Eng."},{"key":"e_1_3_4_19_2","first-page":"63","volume-title":"Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems (GIS \u201903)","author":"Danovaro Emanuele","year":"2003","unstructured":"Emanuele Danovaro, Leila De Floriani, Paola Magillo, Mohammed Mostefa Mesmoudi, and Enrico Puppo. 2003. Morphology-driven simplification and multiresolution modeling of terrains. In Proceedings of the 11th ACM International Symposium on Advances in Geographic Information Systems (GIS \u201903). Association for Computing Machinery, New York, NY, 63\u201370. DOI:10.1145\/956676.956685"},{"key":"e_1_3_4_20_2","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12596"},{"key":"e_1_3_4_21_2","first-page":"119","volume-title":"Proceedings of the 3rd Eurographics Symposium on Geometry Processing (SGP \u201905)","author":"Floriani Leila De","year":"2005","unstructured":"Leila De Floriani and Annie Hui. 2005. Data structures for simplicial complexes: An analysis and a comparison. In Proceedings of the 3rd Eurographics Symposium on Geometry Processing (SGP \u201905). Eurographics Association, Eindhoven, The Netherlands, 119\u2013128."},{"key":"e_1_3_4_22_2","first-page":"161","volume-title":"Proceedings of the Symposium on Interactive 3D Graphics and Games","author":"DeCoro Christopher","year":"2007","unstructured":"Christopher DeCoro and Natalya Tatarchuk. 2007. Real-time mesh simplification using the GPU. In Proceedings of the Symposium on Interactive 3D Graphics and Games. 161\u2013166."},{"key":"e_1_3_4_23_2","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1142\/9789812792037_0025","volume-title":"Algorithms and Architectures for Parallel Processing (ICA3PP \u201900)","author":"Dehne Frank","year":"2000","unstructured":"Frank Dehne, Chiristian Langis, and Gerhard Roth. 2000. Mesh simplification in parallel. In Algorithms and Architectures for Parallel Processing (ICA3PP \u201900). World Scientific, Singapore, 281\u2013290."},{"key":"e_1_3_4_24_2","first-page":"23","article-title":"Topology preserving edge contraction","volume":"66","author":"Dey Tamal K.","year":"1998","unstructured":"Tamal K. Dey, Herbert Edelsbrunner, Sumanta Guha, and Dmitry V. Nekhayev. 1998. Topology preserving edge contraction. Publ. l\u2019Inst. Math. 66, 80 (1998), 23\u201345.","journal-title":"Publ. l\u2019Inst. Math."},{"key":"e_1_3_4_25_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2018.05.002"},{"key":"e_1_3_4_26_2","first-page":"1","volume-title":"Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","author":"Dey Tamal K.","year":"2017","unstructured":"Tamal K. Dey, Jiayuan Wang, and Yusu Wang. 2017. Improved road network reconstruction using discrete morse theory. In Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 1\u20134. DOI:10.1145\/3139958.3140031"},{"key":"e_1_3_4_27_2","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1090\/conm\/453\/08802","article-title":"Persistent homology-a survey","volume":"453","author":"Edelsbrunner Herbert","year":"2008","unstructured":"Herbert Edelsbrunner and John Harer. 2008. Persistent homology-a survey. Contemp. Math. 453, 26 (2008), 257\u2013282.","journal-title":"Contemp. Math."},{"key":"e_1_3_4_28_2","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-022-00472-3"},{"key":"e_1_3_4_29_2","unstructured":"Riccardo Fellegara and Yunting Song. 2022. Terrain Analysis on the IA Data Structure. Retrieved February 2024 from https:\/\/github.com\/UMDGeoVis\/Terrain_Analysis_on_IA [Online; accessed February-2024]."},{"key":"e_1_3_4_30_2","unstructured":"Riccardo Fellegara and Yunting Song. 2023. Terrain Trees Library. https:\/\/zenodo.org\/records\/10714553"},{"key":"e_1_3_4_31_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2021.05.002"},{"key":"e_1_3_4_32_2","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1006\/aima.1997.1650","article-title":"Morse theory for cell complexes","volume":"134","author":"Forman Robin","year":"1998","unstructured":"Robin Forman. 1998. Morse theory for cell complexes. Adv. Math. 134, 1 (1998), 90\u2013145.","journal-title":"Adv. Math."},{"key":"e_1_3_4_33_2","first-page":"357","volume-title":"Proceedings of Scientific Computing (ALGORITMY \u201900)","author":"Franc Martin","year":"2000","unstructured":"Martin Franc and V\u00e1clav Skala. 2000. Parallel triangular mesh reduction. In Proceedings of Scientific Computing (ALGORITMY \u201900). 357\u2013367."},{"key":"e_1_3_4_34_2","doi-asserted-by":"publisher","DOI":"10.1145\/965105.807481"},{"key":"e_1_3_4_35_2","first-page":"36","volume-title":"Proceedings of the 28th International Conference on Advances in Geographic Information Systems (SIGSPATIAL \u201920)","author":"Fugacci Ulderico","year":"2020","unstructured":"Ulderico Fugacci, Michael Kerber, and Hugo Manet. 2020. Topology-preserving terrain simplification. In Proceedings of the 28th International Conference on Advances in Geographic Information Systems (SIGSPATIAL \u201920). ACM, New York, NY, 36\u201347. DOI:10.1145\/3397536.3422237"},{"key":"e_1_3_4_36_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2020.05.020"},{"key":"e_1_3_4_37_2","first-page":"209","volume-title":"Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH \u201997)","author":"Garland Michael","year":"1997","unstructured":"Michael Garland and Paul S. Heckbert. 1997. Surface simplification using quadric error metrics. In Proceedings of the 24th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH \u201997). ACM Press\/Addison-Wesley, 209\u2013216. DOI:10.1145\/258734.258849"},{"key":"e_1_3_4_38_2","doi-asserted-by":"publisher","DOI":"10.2312\/PE\/VMV\/VMV11\/293-299"},{"issue":"2","key":"e_1_3_4_39_2","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1109\/2945.773810","article-title":"Locally toleranced surface simplification","volume":"5","author":"Gu\u00e9ziec Andr\u00e9","year":"1999","unstructured":"Andr\u00e9 Gu\u00e9ziec. 1999. Locally toleranced surface simplification. IEEE Trans. Vis. Comput. Graph. 5, 2 (1999), 168\u2013189.","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"e_1_3_4_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/282918.282923"},{"key":"e_1_3_4_41_2","first-page":"79","volume-title":"Proceedings SIAM\/ACM Geometric and Physical Modeling (SPM \u201909)","author":"Gurung Topraj","year":"2009","unstructured":"Topraj Gurung and Jarek Rossignac. 2009. SOT: A compact representation for tetrahedral meshes. In Proceedings SIAM\/ACM Geometric and Physical Modeling (SPM \u201909). ACM, New York, 79\u201388. DOI:10.1145\/1629255.1629266"},{"key":"e_1_3_4_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2007.70603"},{"key":"e_1_3_4_43_2","volume-title":"Survey of Polygonal Surface Simplification Algorithms","author":"Heckbert Paul S.","year":"1997","unstructured":"Paul S. Heckbert and Michael Garland. 1997. Survey of Polygonal Surface Simplification Algorithms. Carnegie Mellon University Technical Report. Carnegie-Mellon Univ Pittsburgh PA School of Computer Science, Pittsburgh, PA."},{"key":"e_1_3_4_44_2","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/166117.166119","volume-title":"Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH \u201993)","author":"Hoppe Hugues","year":"1993","unstructured":"Hugues Hoppe, Tony DeRose, Tom Duchamp, John McDonald, and Werner Stuetzle. 1993. Mesh optimization. In Proceedings of the 20th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH \u201993). ACM, New York, NY, 19\u201326. DOI:10.1145\/166117.166119"},{"key":"e_1_3_4_45_2","first-page":"11","volume-title":"Proceedings of the ACM Symposium on Virtual Reality Software and Technology (VRST \u201996)","author":"\u0130\u015fler Veysi","year":"1996","unstructured":"Veysi \u0130\u015fler, Rynson W. H. Lau, and Mark Green. 1996. Real-time multi-resolution modeling for complex virtual environments. In Proceedings of the ACM Symposium on Virtual Reality Software and Technology (VRST \u201996). Association for Computing Machinery, New York, NY, 11\u201319. DOI:10.1145\/3304181.3304186"},{"issue":"12","key":"e_1_3_4_46_2","doi-asserted-by":"crossref","first-page":"4966","DOI":"10.1109\/TVCG.2021.3110663","article-title":"Persistence cycles for visual exploration of persistent homology","volume":"28","author":"Iuricich Federico","year":"2021","unstructured":"Federico Iuricich. 2021. Persistence cycles for visual exploration of persistent homology. IEEE Trans. Vis. Comput. Graph. 28, 12 (2021), 4966\u20134979.","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"e_1_3_4_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cag.2017.05.015"},{"key":"e_1_3_4_48_2","first-page":"311","volume-title":"Proceedings of the 7th Conference on Visualization \u201996 (VIS \u201996)","author":"Klein Reinhard","year":"1996","unstructured":"Reinhard Klein, Gunther Liebich, and Wolfgang Stra\u00dfer. 1996. Mesh reduction with error control. In Proceedings of the 7th Conference on Visualization \u201996 (VIS \u201996). IEEE Computer Society Press, Washington, DC, 311\u2013318."},{"key":"e_1_3_4_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2010.2060475"},{"issue":"6","key":"e_1_3_4_50_2","first-page":"967","article-title":"Parallel mesh simplification using embedded tree collapsing","volume":"32","author":"Lee Hyunho","year":"2016","unstructured":"Hyunho Lee and Min-Ho Kyung. 2016. Parallel mesh simplification using embedded tree collapsing. Vis. Comput. 32, 6 (2016), 967\u2013976.","journal-title":"Vis. Comput."},{"key":"e_1_3_4_51_2","first-page":"259","volume-title":"Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques","author":"Lindstrom Peter","year":"2000","unstructured":"Peter Lindstrom. 2000. Out-of-core simplification of large polygonal models. In Proceedings of the 27th Annual Conference on Computer Graphics and Interactive Techniques. 259\u2013262."},{"issue":"3","key":"e_1_3_4_52_2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1109\/TVCG.2002.1021577","article-title":"Terrain simplification simplified: A general framework for view-dependent out-of-core visualization","volume":"8","author":"Lindstrom Peter","year":"2002","unstructured":"Peter Lindstrom and Valerio Pascucci. 2002. Terrain simplification simplified: A general framework for view-dependent out-of-core visualization. IEEE Trans. Vis. Comput. Graph. 8, 3 (2002), 239\u2013254.","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"e_1_3_4_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2020.3030353"},{"key":"e_1_3_4_54_2","volume-title":"An Introduction to Morse Theory","author":"Matsumoto Yukio","year":"2002","unstructured":"Yukio Matsumoto. 2002. An Introduction to Morse Theory. Vol. 208. American Mathematical Soc."},{"issue":"8","key":"e_1_3_4_55_2","doi-asserted-by":"crossref","first-page":"e0255832","DOI":"10.1371\/journal.pone.0255832","article-title":"High-performance simplification of triangular surfaces using a GPU","volume":"16","author":"Mousa Mohamed H.","year":"2021","unstructured":"Mohamed H. Mousa and Mohamed K. Hussein. 2021. High-performance simplification of triangular surfaces using a GPU. PLos One 16, 8 (2021), e0255832.","journal-title":"PLos One"},{"key":"e_1_3_4_56_2","unstructured":"OCM Partners. 2021. 2013 USACE NCMP Topobathy Lidar: Molokai (HI). (2021). NOAA National Centers for Environmental Information. Retrieved April 2021 from https:\/\/www.fisheries.noaa.gov\/inport\/item\/49753"},{"key":"e_1_3_4_57_2","doi-asserted-by":"publisher","DOI":"10.1002\/qua.26133"},{"key":"e_1_3_4_58_2","unstructured":"OpenTopography 2020. OpenTopography\u2014High-Resolution Topography Data and Tools. Retrieved Janauary 2020 from http:\/\/www.opentopography.org\/"},{"issue":"1","key":"e_1_3_4_59_2","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1145\/169728.169719","article-title":"Dimension-independent modeling with simplicial complexes","volume":"12","author":"Paoluzzi Alberto","year":"1993","unstructured":"Alberto Paoluzzi, Fausto Bernardini, Carlo Cattani, and Vincenzo Ferrucci. 1993. Dimension-independent modeling with simplicial complexes. ACM Trans. Graph. 12, 1 (1993), 56\u2013102.","journal-title":"ACM Trans. Graph."},{"key":"e_1_3_4_60_2","doi-asserted-by":"publisher","DOI":"10.1007\/s00371-014-1039-x"},{"key":"e_1_3_4_61_2","unstructured":"Persim 2022. Persim 0.3.1 Documentation. Retrieved June 2022 from https:\/\/persim.scikit-tda.org\/en\/latest\/index.html"},{"key":"e_1_3_4_62_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.95"},{"key":"e_1_3_4_63_2","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/978-3-642-78114-8_29","volume-title":"Modeling in Computer Graphics","author":"Rossignac Jarek","year":"1993","unstructured":"Jarek Rossignac and Paul Borrel. 1993. Multi-resolution 3D approximations for rendering complex scenes. In Modeling in Computer Graphics. Springer, Berlin, 455\u2013465."},{"key":"e_1_3_4_64_2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-642-55787-3_3","volume-title":"Hierarchical and Geometrical Methods in Scientific Visualization","author":"Rossignac Jarek","year":"2003","unstructured":"Jarek Rossignac, Alla Safonova, and Andrzej Szymczak. 2003. Edgebreaker on a corner table: A simple technique for representing and compressing triangulated surfaces. In Hierarchical and Geometrical Methods in Scientific Visualization. Springer, 41\u201350."},{"key":"e_1_3_4_65_2","volume-title":"Foundations of Multidimensional and Metric Data Structures","author":"Samet Hanan","year":"2006","unstructured":"Hanan Samet. 2006. Foundations of Multidimensional and Metric Data Structures. Morgan Kaufmann."},{"key":"e_1_3_4_66_2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1145\/133994.134010","volume-title":"Proceedings of the 19th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH \u201992)","author":"Schroeder William J.","year":"1992","unstructured":"William J. Schroeder, Jonathan A. Zarge, and William E. Lorensen. 1992. Decimation of triangle meshes. In Proceedings of the 19th Annual Conference on Computer Graphics and Interactive Techniques (SIGGRAPH \u201992). ACM, New York, NY, 65\u201370. DOI:10.1145\/133994.134010"},{"issue":"11","key":"e_1_3_4_67_2","doi-asserted-by":"crossref","first-page":"693","DOI":"10.3390\/ijgi9110693","article-title":"Generalization of soundings across scales: From DTM to harbour and approach nautical charts","volume":"9","author":"Skopeliti Andriani","year":"2020","unstructured":"Andriani Skopeliti, Leda Stamou, Lysandros Tsoulos, and Shachak Pe\u2019eri. 2020. Generalization of soundings across scales: From DTM to harbour and approach nautical charts. ISPRS Int. J. Geo-Inf. 9, 11 (2020), 693.","journal-title":"ISPRS Int. J. Geo-Inf."},{"key":"e_1_3_4_68_2","doi-asserted-by":"crossref","unstructured":"Yunting Song and Riccardo Fellegara. 2023. Topology-aware Simplification on Terrain Trees. https:\/\/zenodo.org\/records\/10723706","DOI":"10.1145\/3652602"},{"key":"e_1_3_4_69_2","first-page":"576","volume-title":"Proceedings of the 29th International Conference on Advances in Geographic Information Systems (SIGSPATIAL \u201921)","author":"Song Yunting","year":"2021","unstructured":"Yunting Song, Riccardo Fellegara, Federico Iuricich, and Leila De Floriani. 2021. Efficient topology-aware simplification of large triangulated terrains. In Proceedings of the 29th International Conference on Advances in Geographic Information Systems (SIGSPATIAL \u201921). 576\u2013587. DOI:10.1145\/3474717.3484261"},{"key":"e_1_3_4_70_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVCG.2018.2810068"},{"key":"e_1_3_4_71_2","doi-asserted-by":"publisher","DOI":"10.1111\/cgf.12123"},{"key":"e_1_3_4_72_2","doi-asserted-by":"publisher","DOI":"10.1109\/visual.1996.568126"},{"key":"e_1_3_4_73_2","first-page":"191","volume-title":"Proceedings of the 28th International Conference on Advances in Geographic Information Systems","author":"Xu Xin","year":"2020","unstructured":"Xin Xu, Federico Iuricich, and Leila De Floriani. 2020. A persistence-based approach for individual tree mapping. In Proceedings of the 28th International Conference on Advances in Geographic Information Systems. ACM, 191\u2013194. DOI:10.1145\/3397536.3422231"},{"issue":"8","key":"e_1_3_4_74_2","doi-asserted-by":"crossref","first-page":"917","DOI":"10.14358\/PERS.71.8.917","article-title":"A dynamic method for generating multi-resolution TIN models","volume":"71","author":"Yang Bisheng","year":"2005","unstructured":"Bisheng Yang, Wenzhong Shi, and Qingquan Li. 2005. A dynamic method for generating multi-resolution TIN models. Photogram. Eng. Remote Sens. 71, 8 (2005), 917\u2013926.","journal-title":"Photogram. Eng. Remote Sens."},{"key":"e_1_3_4_75_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.isprsjprs.2017.04.013"}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652602","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3652602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:30Z","timestamp":1750291410000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3652602"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,21]]},"references-count":74,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,6,30]]}},"alternative-id":["10.1145\/3652602"],"URL":"https:\/\/doi.org\/10.1145\/3652602","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"value":"2374-0353","type":"print"},{"value":"2374-0361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,5,21]]},"assertion":[{"value":"2023-05-17","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-03-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}