Yunting Song

Yunting Song

Auto-generated profile, based on publicly available information

Yunting Song

Department of Geographical Sciences, University of Maryland, College Park, MD, USA

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
27 August 2022 in GeoInformatica
Verified
Journal Article
Closed access
PDF file
RFRiccardo Fellegara
Riccardo Fellegara
FIFederico Iuricich
Federico Iuricich
YSYunting Song
Yunting Song
LFLeila De Floriani
Leila De Floriani

21 May 2024 in ACM Transactions on Spatial Algorithms and Systems
Verified
Journal Article
Open access
YSYunting Song
Yunting Song
RFRiccardo Fellegara
Riccardo Fellegara
FIFederico Iuricich
Federico Iuricich
LFLeila De Floriani
Leila De Floriani
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× 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.

29 October 2024
Verified
Conference Paper
Open access
HFHaoan Feng
Haoan Feng
YSYunting Song
Yunting Song
LFLeila De Floriani
Leila De Floriani
The scale-space method is a well-established framework that constructs a hierarchical representation of an input signal and facilitates coarse-to-fine visual reasoning. Considering the terrain elevation function as the input signal, the scale-space method can identify and track significant topographic features across different scales. The number of scales a feature persists, called its life span, indicates the importance of that feature. In this way, important topographic features of a landscape can be selected, which are useful for many applications, including cartography, nautical charting, and land-use planning. The scale-space methods developed for terrain data use gridded Digital Elevation Models (DEMs) to represent the terrain. However, gridded DEMs lack the flexibility to adapt to the irregular distribution of input data and the varied topological complexity of different regions. Instead, Triangulated Irregular Networks (TINs) can be directly generated from irregularly distributed point clouds and accurately preserve important features. In this work, we introduce a novel scale-space analysis pipeline for TINs, addressing the multiple challenges in extending grid-based scale-space methods to TINs. Our pipeline can efficiently identify and track topologically important features on TINs. Moreover, it is capable of analyzing terrains with irregular boundaries, which poses challenges for grid-based methods. Comprehensive experiments show that, compared to grid-based methods, our TIN-based pipeline is more efficient, accurate, and has better resolution robustness.

29 April 2026 in ACM Transactions on Spatial Algorithms and Systems
Verified
Journal Article
Open access
HFHaoan Feng
Haoan Feng
YSYunting Song
Yunting Song
LFLeila De Floriani
Leila De Floriani
The scale-space method is a well-established framework that constructs a hierarchical representation of an input signal and facilitates coarse-to-fine reasoning about its features. Considering the terrain elevation function as the input signal, the scale-space method can identify and track significant topographic features across different scales. The persistence of a feature, called its life span , indicates its importance and enables the automatic selection of critical features for applications such as cartography, nautical charting, and land-use planning. Traditional scale-space methods rely on gridded Digital Elevation Models (DEMs), which lack the flexibility to adapt to irregular input distributions and varied terrain complexity. In contrast, Triangulated Irregular Networks (TINs) can be directly generated from irregular point clouds and naturally preserve key features. In this work, we introduce a novel scale-space analysis pipeline for TINs, addressing the challenges in extending grid-based scale-space methods to irregular meshes. Building on our prior conference version, we further extend the pipeline in several directions: (i) a scale-aware, seam-free sampling strategy (S3) for high-quality TIN construction, (ii) an improved TIN smoothing method that combines virtual neighbors and angle re-weighting with a quantitative evaluation of geometric and gradient fidelity, and (iii) a fully parallel critical point tracking algorithm that eliminates global sorting and achieves substantial GPU speedups. Comprehensive experiments demonstrate that our TIN-based pipeline achieves superior geometric and topological fidelity, improved efficiency, and stronger resolution robustness than grid-based methods, making it a scalable and accurate framework for multi-scale terrain analysis.

5 May 2026 in IEEE Transactions on Geoscience and Remote Sensing
Verified
Journal Article
Closed access
YSYunting Song
Yunting Song
LFLeila De Floriani
Leila De Floriani
KDKyle Duncan
Kyle Duncan
SFSinéad Louise Farrell
Sinéad Louise Farrell
Pressure ridges are the dominant topographic features of sea ice, playing a critical role in momentum transfer between the atmosphere and ocean. However, characterizing their three-dimensional morphology remains a challenge. Traditional methods, applied to linear profile data from laser altimeters, cannot extract two-dimensional features, specifically the horizontal orientation, extent, and connectivity of deformed ice. To address this gap, this paper introduces a novel strategy to extract pressure ridges directly from altimeter swath data by utilizing Triangulated Irregular Networks (TINs) and surface topology. Unlike raster grid-based models, TIN-based surface models do not require interpolation, thereby preserving the original point dataset and effectively retaining line features, which are essential for ridge extraction. Our algorithm integrates discrete Morse theory with surface roughness constraints to identify ridge structure lines from level sea ice. Additionally, we discuss how to address data dropout issues in the generation of TIN-based surface model, which prevents the correct extraction of ridge structures. The point cloud used in this study is high-resolution swath data from the NASA Operation IceBridge (OIB) Airborne Topographic Mapper (ATM). The validation against two independent datasets, the linear profile data collected by Ice, Cloud, and land Elevation Satellite (ICESat-2) and optical imagery captured during the OIB campaign, demonstrates that the proposed ridge extraction method can effectively detect ridge lines from TIN-based models. Such ridge features can provide more information of sea ice ridges, such as length, average height, and orientation, which are not possible when using linear profiles or gridded surface models.

15 January 2022 in ESS Open Archive
Verified
Preprint
Open access
YSYunting Song
Yunting Song
FRFellegara Riccardo
Fellegara Riccardo
FIFederico Iuricich
Federico Iuricich
LFLeila De Floriani
Leila De Floriani
In light of the increased availability of massive point cloud data, acquired by advanced remote sensing techniques, software tools for their efficient representation and processing are needed. Triangulated Irregular Networks (TINs) are an effective way to represent point clouds without the need to interpolate them into raster-based terrain models. However, GISs tools have limited support for TINs due to large storage costs. For this reason, we present the Terrain Trees Library (TTL), a library for terrain analysis based on a new scalable data structure named Terrain trees. A Terrain tree relies on a hierarchical spatial index where each leaf block encodes the minimum amount of connectivity information for the TIN. Connectivity relations among the elements of the TIN are extracted locally within each leaf block at run-time and discarded when no longer needed. Moreover, the hierarchical domain decomposition makes the library well-suited for parallel processing. TTL contains a kernel for connectivity and spatial queries, and modules for extracting morphological features, including edge and triangle slopes, roughness, curvature. It also contains modules for extracting topological structures, like critical point, critical net, watershed segmentation, based on the discrete Morse gradient, and a technique for multivariate data visualization, which enables the analysis of multiple scalar fields defined on the same terrain. To evaluate the effectiveness and scalability of TTL, we compared it against the most compact state-of-the-art data structure for TINs, the IA data structure. When encoded by Terrain trees, a TIN requires 36% less storage than when encoded by the IA data structure. Beyond this storage reduction, Terrain trees also show better performance than the IA data structure in most terrain analysis operations. This speedup is obtained since Terrain trees enable 57% to 72% faster extraction of the triangles incident in a vertex. Extracting the triangles incident in vertices as well as the adjacent vertices on the mesh is a key task in most terrain feature extraction operations on a TIN. Using Terrain trees, we achieved 36% to 55% less time consumption computing morphological features and 20% less time consumption computing the discrete Morse gradient than using the IA data structure.