Computer Graphics Forum最新文献_第10页

Towards a Better Evaluation of 3D CVML Algorithms: Immersive Debugging of a Localization Model 对3D CVML算法的更好评价：一个定位模型的沉浸式调试

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-23 DOI: 10.1111/cgf.70111

T. Lin, J. Yuan, K. Miao, T. Katolikyan, I. Walker, M. Cavallo

{"title":"Towards a Better Evaluation of 3D CVML Algorithms: Immersive Debugging of a Localization Model","authors":"T. Lin, J. Yuan, K. Miao, T. Katolikyan, I. Walker, M. Cavallo","doi":"10.1111/cgf.70111","DOIUrl":"https://doi.org/10.1111/cgf.70111","url":null,"abstract":"<div>\u0000 <p>As advancements in robotics, autonomous driving, and spatial computing continue to unfold, a growing number of Computer Vision and Machine Learning (CVML) algorithms are incorporating three-dimensional data into their frameworks. Debugging these 3D CVML models often requires going beyond traditional performance evaluation methods, necessitating a deeper understanding of an algorithm's behavior within its spatio-temporal context. However, the lack of appropriate visualization tools presents a significant obstacle to effectively exploring 3D data and spatial features in relation to key performance indicators (KPIs). To address this challenge, we explore the application of Immersive Analytics (IA) methodologies to enhance the debugging process of 3D CVML models. Through in-depth interviews with eight CVML engineers, we identify common tasks and challenges faced during the development of spatial algorithms, and establish a set of design principles for creating tools tailored to spatial model evaluation. Building on these insights, we propose a novel immersive analytics system for debugging an indoor localization algorithm. The system is built using web technologies and integrates WebXR to enable fluid transitions across the reality-virtuality continuum. We conduct a qualitative study with six CVML engineers using our system on Apple Vision Pro, observing their analytical workflow as they debug an indoor localization sequence. We discuss the advantages of employing immersive analytics in the model evaluation workflow, emphasizing the role of seamlessly integrating 2D and 3D visualizations across varying levels of immersion to facilitate more effective model assessment. Finally, we reflect on the implementation trade-offs and discuss the generalizability of our findings for future efforts in immersive 3D CVML model debugging.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70111","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Tasks and Visual Abstractions for 3D Chromatin Representation 三维染色质表示的任务和视觉抽象

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-23 DOI: 10.1111/cgf.70142

A. Rychlý, J. Byška, B. Kozlíková, K. Furmanová

{"title":"Tasks and Visual Abstractions for 3D Chromatin Representation","authors":"A. Rychlý, J. Byška, B. Kozlíková, K. Furmanová","doi":"10.1111/cgf.70142","DOIUrl":"https://doi.org/10.1111/cgf.70142","url":null,"abstract":"<div>\u0000 \u0000 <p>The spatial organization of chromatin fiber directly influences its function. However, the high visual complexity of chromatin spatial models makes the understanding of the structure extremely challenging. Therefore, genomic researchers still primarily rely on indirect analysis of chromatin through 2D views, missing the advantages that 3D visualization can offer. In this paper, we first analyze the task space of genomic research and identify biological domain tasks that can benefit from dedicated spatial representations. We organize these tasks into four categories: tasks related to structural features, additional meta-data, structural relationships, and comparative tasks. We analyze these tasks in terms of their complexity, co-dependence, and potential benefits of 3D-based solutions. Secondly, we present four newly designed visual representations of chromatin 3D structure, focused on enhancing the understanding of structural features and solving relationships tasks. These include the hierarchical nature of spatial chromatin sub-units, their visual abstractions, spatial interactions, and a cumulative representation of chromatin dynamic behavior. We also include feedback from four domain researchers and discuss future steps necessary to make spatial representations valid and valuable part of genomic research.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70142","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681408","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

HyperFLINT: Hypernetwork-based Flow Estimation and Temporal Interpolation for Scientific Ensemble Visualization HyperFLINT：用于科学集成可视化的基于超网络的流量估计和时间插值

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-23 DOI: 10.1111/cgf.70134

Hamid Gadirov, Qi Wu, David Bauer, Kwan-Liu Ma, Jos B.T.M. Roerdink, Steffen Frey

{"title":"HyperFLINT: Hypernetwork-based Flow Estimation and Temporal Interpolation for Scientific Ensemble Visualization","authors":"Hamid Gadirov, Qi Wu, David Bauer, Kwan-Liu Ma, Jos B.T.M. Roerdink, Steffen Frey","doi":"10.1111/cgf.70134","DOIUrl":"https://doi.org/10.1111/cgf.70134","url":null,"abstract":"<div>\u0000 \u0000 <p>We present HyperFLINT (Hypernetwork-based FLow estimation and temporal INTerpolation), a novel deep learning-based approach for estimating flow fields, temporally interpolating scalar fields, and facilitating parameter space exploration in spatio-temporal scientific ensemble data. This work addresses the critical need to explicitly incorporate ensemble parameters into the learning process, as traditional methods often neglect these, limiting their ability to adapt to diverse simulation settings and provide meaningful insights into the data dynamics. HyperFLINT introduces a hypernetwork to account for simulation parameters, enabling it to generate accurate interpolations and flow fields for each timestep by dynamically adapting to varying conditions, thereby outperforming existing parameter-agnostic approaches. The architecture features modular neural blocks with convolutional and deconvolutional layers, supported by a hypernetwork that generates weights for the main network, allowing the model to better capture intricate simulation dynamics. A series of experiments demonstrates HyperFLINT's significantly improved performance in flow field estimation and temporal interpolation, as well as its potential in enabling parameter space exploration, offering valuable insights into complex scientific ensembles.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70134","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681364","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

The Geometry of Color in the Light of a Non-Riemannian Space 非黎曼空间下的颜色几何

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-23 DOI: 10.1111/cgf.70136

Roxana Bujack, Emily N. Stark, Terece L. Turton, Jonah M. Miller, David H. Rogers

{"title":"The Geometry of Color in the Light of a Non-Riemannian Space","authors":"Roxana Bujack, Emily N. Stark, Terece L. Turton, Jonah M. Miller, David H. Rogers","doi":"10.1111/cgf.70136","DOIUrl":"https://doi.org/10.1111/cgf.70136","url":null,"abstract":"<div>\u0000 \u0000 <p>We formalize Schrödinger's definitions of hue, saturation, and lightness, building on the foundational idea from Helmholtz that these perceptual attributes can be derived solely from the perceptual metric. We identify three shortcomings in Schrödinger's approach and propose solutions to them. First, to encompass the Bezold-Brücke effect, we replace the straight-line definition of stimulus quality between a color and black with the geodesic path in perceptual color space. Second, to model diminishing returns in color perception, we employ a non-Riemannian perceptual metric, which introduces a potential ambiguity in defining lightness, but our experiments show that this ambiguity is inconsequential. Third, we provide a geometric definition of the neutral axis as the closest color to black within each equal-lightness surface—a definition feasible only in a non-Riemannian framework. Collectively, our solutions provide the first comprehensive realization of Helmholtz's vision: formal geometric definitions of hue, saturation, and lightness derived entirely from the metric of perceptual similarity, without reliance on external constructs.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70136","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681411","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Necessary but not Sufficient: Limitations of Projection Quality Metrics 必要但不充分：投影质量度量的局限性

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-21 DOI: 10.1111/cgf.70101

A. Machado, M. Behrisch, A. Telea

{"title":"Necessary but not Sufficient: Limitations of Projection Quality Metrics","authors":"A. Machado, M. Behrisch, A. Telea","doi":"10.1111/cgf.70101","DOIUrl":"https://doi.org/10.1111/cgf.70101","url":null,"abstract":"<div>\u0000 <p>High-dimensional data analysis often uses dimensionality reduction (DR, also called projection) to map data patterns to human-digestible visual patterns in a 2D scatterplot. Yet, DR methods may fail to show true data patterns and/or create visual patterns that do not represent any data patterns. Projection Quality Metrics (PQMs) are used as objective measures to gauge the above process: the higher a projection's scores in PQMs, the more it is deemed faithful to the data it represents. We show that, while PQMs can be used as exclusion criteria — low values usually mean poor projections — the converse does not always hold. For this, we develop a technique to automatically generate projections that score similar or even higher PQM values than projections created by well-known techniques, but show different, often confusing, visual patterns. Our results show that accepted PQMs cannot be used as an exclusive way to tell whether a projection yields accurate and interpretable visual patterns — in this sense, PQMs play a role akin to that of summary statistics in exploratory data analysis. We also show that not all studied metrics can befooled equally well, suggesting a ranking of metrics in their ability to reliably capture quality.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70101","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681106","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Mapping Mental Models of Uncertainty to Parallel Coordinates by Probabilistic Brushing 用概率刷法将不确定性心理模型映射到平行坐标

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-21 DOI: 10.1111/cgf.70103

Gabriel Borrelli, Till Ittermann, Lars Linsen

{"title":"Mapping Mental Models of Uncertainty to Parallel Coordinates by Probabilistic Brushing","authors":"Gabriel Borrelli, Till Ittermann, Lars Linsen","doi":"10.1111/cgf.70103","DOIUrl":"https://doi.org/10.1111/cgf.70103","url":null,"abstract":"<div>\u0000 <p>Through training and gathered experience, domain experts attain a mental model of the uncertainties inherent in the visual analytics processes for their respective domain. For an accurate data analysis and trustworthiness of the analysis results, it is essential to include this knowledge and consider this model of uncertainty during the analytical process. For multi-dimensional data analysis, Parallel Coordinates are a widely used approach due to their linear scalability with the number of dimensions and bijective (i.e., loss-less) data transformation. However, selections in Parallel Coordinates are typically achieved by a binary brushing operation on the axes, which does not allow the users to map their mental model of uncertainties to their selection. We, therefore, propose Probabilistic Parallel Coordinates as a natural extension of the classical Parallel Coordinates approach that integrates probabilistic brushing on the axes. It supports the interactive modeling of a probability distribution for each parallel coordinate. The selections on multiple axes are combined accordingly. An efficient rendering on a compute shader facilitates interactive frame rates. We evaluated our open-source tool with practitioners and compared it to classical Parallel Coordinates on multiple regression and uncertain selection tasks in user studies.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70103","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681109","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Visually Assessing 1-D Orderings of Contiguous Spatial Polygons 视觉评估连续空间多边形的一维排序

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-21 DOI: 10.1111/cgf.70100

Julius Rauscher, Frederik L. Dennig, Udo Schlegel, Daniel A. Keim, Johannes Fuchs

{"title":"Visually Assessing 1-D Orderings of Contiguous Spatial Polygons","authors":"Julius Rauscher, Frederik L. Dennig, Udo Schlegel, Daniel A. Keim, Johannes Fuchs","doi":"10.1111/cgf.70100","DOIUrl":"https://doi.org/10.1111/cgf.70100","url":null,"abstract":"<div>\u0000 <p>One-dimensional orderings of spatial entities have been researched in many contexts, e.g. spatial indexing structures or visualizations for spatiotemporal trend analysis. While plenty of studies have been conducted to evaluate orderings of point-based data, polygonal shapes, despite their different topological properties, have received less attention. Existing measures to quantify errors in projections or orderings suffer from generic neighborhood definitions and over-simplification of distances when applied to polygonal data. In this work, we address these shortcomings by introducing measures that adapt to a varying neighborhood size depending on the number of contiguous neighbors and thus, address the limitations of existing measures for polygonal shapes. To guide experts in determining a suitable ordering, we propose a user-steerable visual analytics prototype capable of locally and globally inspecting ordering errors, investigating the impact of geographic obstacles, and comparing ordering strategies using our measures. We demonstrate the effectiveness of our approach through a use case and conducted an expert study with 8 data scientists as a qualitative evaluation of our approach. Our results show that users are capable of identifying ordering errors, comparing ordering strategies on a global and local scale, as well as assessing the impact of semantically relevant geographic obstacles.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70100","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Modeling and Measuring the Chart Communication Recall Process 图表沟通回忆过程的建模与测量

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-21 DOI: 10.1111/cgf.70099

A. Arunkumar, L. Padilla, C. Bryan

{"title":"Modeling and Measuring the Chart Communication Recall Process","authors":"A. Arunkumar, L. Padilla, C. Bryan","doi":"10.1111/cgf.70099","DOIUrl":"https://doi.org/10.1111/cgf.70099","url":null,"abstract":"<div>\u0000 <p>Understanding memory in the context of data visualizations is paramount for effective design. While immediate clarity in a visualization is crucial, retention of its information determines its long-term impact. While extensive research has underscored the elements enhancing visualization memorability, a limited body of work has delved into modeling the recall process. This study investigates the temporal dynamics of visualization recall, focusing on factors influencing recollection, shifts in recall veracity, and the role of participant demographics. Using data from an empirical study (n = 104), we propose a novel approach combining temporal clustering and handcrafted features to model recall over time. A long short-term memory (LSTM) model with attention mechanisms predicts recall patterns, revealing alignment with informativeness scores and participant characteristics. Our findings show that perceived informativeness dictates recall focus, with more informative visualizations eliciting narrative-driven insights and less informative ones prompting aesthetic-driven responses. Recall accuracy diminishes over time, particularly for unfamiliar visualizations, with age and education significantly shaping recall emphases. These insights advance our understanding of visualization recall, offering practical guidance for designing visualizations that enhance retention and comprehension. All data and materials are available at: https://osf.io/ghe2j/.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70099","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681112","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

When Dimensionality Reduction Meets Graph (Drawing) Theory: Introducing a Common Framework, Challenges and Opportunities 当降维遇到图形（绘图）理论：引入一个共同的框架，挑战和机遇

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-21 DOI: 10.1111/cgf.70105

F. V. Paulovich, A. Arleo, S. van den Elzen

{"title":"When Dimensionality Reduction Meets Graph (Drawing) Theory: Introducing a Common Framework, Challenges and Opportunities","authors":"F. V. Paulovich, A. Arleo, S. van den Elzen","doi":"10.1111/cgf.70105","DOIUrl":"https://doi.org/10.1111/cgf.70105","url":null,"abstract":"<div>\u0000 <p>In the vast landscape of visualization research, Dimensionality Reduction (DR) and graph analysis are two popular subfields, often essential to most visual data analytics setups. DR aims to create representations to support neighborhood and similarity analysis on complex, large datasets. Graph analysis focuses on identifying the salient topological properties and key actors within network data, with specialized research investigating how such features could be presented to users to ease the comprehension of the underlying structure. Although these two disciplines are typically regarded as disjoint subfields, we argue that both fields share strong similarities and synergies that can potentially benefit both. Therefore, this paper discusses and introduces a unifying framework to help bridge the gap between DR and graph (drawing) theory. Our goal is to use the strongly math-grounded graph theory to improve the overall process of creating DR visual representations. We propose how to break the DR process into well-defined stages, discuss how to match some of the DR state-of-the-art techniques to this framework, and present ideas on how graph drawing, topology features, and some popular algorithms and strategies used in graph analysis can be employed to improve DR topology extraction, embedding generation, and result validation. We also discuss the challenges and identify opportunities for implementing and using our framework, opening directions for future visualization research.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70105","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681108","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Process-Oriented Approach to Analyze Analysts' Use of Visualizations: Revealing Insights into the What, When, and How 分析分析师使用可视化的面向过程的方法：揭示对“什么”、“何时”和“如何”的洞察

IF 2.7 4区计算机科学

Computer Graphics Forum Pub Date : 2025-05-21 DOI: 10.1111/cgf.70104

L. Zimmermann, F. Zerbato, K. Vrotsou, B. Weber

{"title":"A Process-Oriented Approach to Analyze Analysts' Use of Visualizations: Revealing Insights into the What, When, and How","authors":"L. Zimmermann, F. Zerbato, K. Vrotsou, B. Weber","doi":"10.1111/cgf.70104","DOIUrl":"https://doi.org/10.1111/cgf.70104","url":null,"abstract":"<div>\u0000 <p>Despite Visual Analytics (VA) tools being essential for supporting data analysis, evaluating their use in real-world analytical processes remains challenging. Traditional evaluation methods often overlook the nuanced and evolving nature of analysis processes and are not always suitable for investigating scenarios in which analysts combine multiple tools and visualization types. In this paper, we propose a flexible analysis approach for studying analysts' use of visualizations within and across VA tools. Our qualitative method allows researchers to extract user behavior and cognitive steps from screen recordings and think-aloud data and generate event sequences that capture analytic processes. This enables the analysis of usage patterns from multiple perspectives and levels of granularity and allows for the evaluation of effectiveness measures, such as efficiency and accuracy. We demonstrate our approach in the domain of process mining, where our findings provide insights into the use of existing visualizations, and we reflect on lessons learned from this application.</p>\u0000 </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"44 3","pages":""},"PeriodicalIF":2.7,"publicationDate":"2025-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.70104","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144681103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0