Graphical ModelsPub Date : 2026-09-01Epub Date: 2026-09-12DOI: 10.1016/j.gmod.2026.101342
Elena Carmona Vallecillo, David Jurado-Rodríguez, J.R. Jiménez Pérez, Juan M. Jurado
{"title":"Geometric CBCT reconstruction and scanbody pose estimation for automated dental implant planning","authors":"Elena Carmona Vallecillo, David Jurado-Rodríguez, J.R. Jiménez Pérez, Juan M. Jurado","doi":"10.1016/j.gmod.2026.101342","DOIUrl":"10.1016/j.gmod.2026.101342","url":null,"abstract":"<div><div>Cone Beam Computed Tomography (CBCT) is a key imaging modality in dental implantology; however, its automated processing remains challenging due to noise, limited contrast, anatomical variability, and metal artifacts. This work presents a fully automated computational pipeline for three-dimensional reconstruction, geometric dental implant detection, and scanbody pose estimation directly from real clinical CBCT data. In contrast to learning-based approaches, the proposed method relies on geometric and structural analysis, improving interpretability and reducing the dependence on annotated training data. The methodology was evaluated on 26 real CBCT studies acquired under routine clinical conditions, comprising 203 annotated implants. The proposed pipeline achieved a precision of 1.000, a recall of 0.941, and an F1-score of 0.970 for implant detection. For scanbody pose estimation, valid alignments were obtained in 22 out of 26 cases, with a mean alignment error of <span><math><mrow><mn>116.9</mn><mo>±</mo><mn>41.2</mn><mspace></mspace><mi>μ</mi><mi>m</mi></mrow></math></span>. The total processing time per CBCT study remained below two minutes, demonstrating computational feasibility without specialized hardware. These results suggest that the proposed approach is a robust and efficient alternative for automated CBCT processing and may support its integration into computer-assisted implant planning workflows.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"147 ","pages":"Article 101342"},"PeriodicalIF":1.8,"publicationDate":"2026-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148958909","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}
Graphical ModelsPub Date : 2026-06-01Epub Date: 2026-05-26DOI: 10.1016/j.gmod.2026.101331
Ting Zhang , Junxiao Wang , Heng Yu , Qunyi Xie , Jingdong Wang , Hua Huang
{"title":"MagicGeo: Training-free text-guided geometric diagram generation","authors":"Ting Zhang , Junxiao Wang , Heng Yu , Qunyi Xie , Jingdong Wang , Hua Huang","doi":"10.1016/j.gmod.2026.101331","DOIUrl":"10.1016/j.gmod.2026.101331","url":null,"abstract":"<div><div>While text-to-image generation has made strides in photorealistic imagery, creating accurate geometric diagrams remains a challenge due to the need for precise spatial relationships and the scarcity of geometry-specific datasets. This paper presents MagicGeo, a training-free framework for generating geometric diagrams from textual descriptions. MagicGeo formulates the diagram generation process as a coordinate optimization problem, ensuring geometric correctness through a formal language solver, and then employs coordinate-aware generation. The framework leverages the strong language translation capability of large language models, while formal mathematical solving ensures geometric correctness. We further introduce MagicGeoBench, a benchmark dataset of 220 geometric diagram descriptions, and demonstrate that MagicGeo outperforms current methods in both qualitative and quantitative evaluations. This work provides a scalable, accurate solution for automated diagram generation, with significant implications for educational and academic applications.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"145 ","pages":"Article 101331"},"PeriodicalIF":2.2,"publicationDate":"2026-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148184608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2026-03-01Epub Date: 2026-03-13DOI: 10.1016/j.gmod.2026.101322
E. Kato , T. Ophelders , A. Telea , J. Kosinka
{"title":"Simplification of locally refined gradient meshes","authors":"E. Kato , T. Ophelders , A. Telea , J. Kosinka","doi":"10.1016/j.gmod.2026.101322","DOIUrl":"10.1016/j.gmod.2026.101322","url":null,"abstract":"<div><div>Gradient meshes are powerful vector graphic primitives known for producing smooth and detailed color transitions. However, their fixed rectangular topology complicates editing, as adding detail in one region introduces control points across the entire mesh. To improve editability and better support artist workflows, we propose a simplification method for gradient meshes based on local refinement. Our method transforms a traditional, globally-refined mesh into a locally-refined one by iteratively merging adjacent faces and eliminating redundant data while preserving visual quality. We achieve this by rasterizing the mesh and applying established visual quality metrics to ensure consistency with the original. Additionally, we offer artists control over the simplification process by introducing an error threshold, allowing them to balance the level of simplification with visual fidelity. Finally, we conduct a thorough comparison of various mesh simplification strategies to analyze the trade-offs between simplification quality and speed so as to inform users to the optimal one that they can use to obtain the desired trade-off.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"144 ","pages":"Article 101322"},"PeriodicalIF":2.2,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147429007","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2026-01-01Epub Date: 2026-01-09DOI: 10.1016/j.gmod.2026.101320
K. He, J.B.T.M. Roerdink, J. Kosinka
{"title":"Monte Carlo optimization for gradient meshes","authors":"K. He, J.B.T.M. Roerdink, J. Kosinka","doi":"10.1016/j.gmod.2026.101320","DOIUrl":"10.1016/j.gmod.2026.101320","url":null,"abstract":"<div><div>Vector graphics provide continuous and often even smooth geometric representations of images. While recent approaches to automatically vectorize images lead to relatively good results, they typically leave ample room for improvement: the geometry and color of the vector graphics primitives can be further (automatically) optimized. We propose a novel method that generates high-quality vectorizations based on optimizing input curved triangle meshes (optionally with mesh colors). To overcome the key challenge of establishing a differentiable mapping between the input parameters, i.e., geometry and (mesh) colors of the gradient mesh, and the difference between the vectorized and input image, we treat the input image as a continuous bilinear interpolatory spline and employ Monte Carlo integration. We test our algorithm on various images and show that it can effectively and efficiently improve the quality of an initial vectorization.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"143 ","pages":"Article 101320"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145924846","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2026-01-01Epub Date: 2025-11-22DOI: 10.1016/j.gmod.2025.101309
Yixin Xu , Shiguang Liu
{"title":"Visual simulation of fruit chilling injury","authors":"Yixin Xu , Shiguang Liu","doi":"10.1016/j.gmod.2025.101309","DOIUrl":"10.1016/j.gmod.2025.101309","url":null,"abstract":"<div><div>Chilling injury (CI) is a major postharvest physiological disorder in fruits, causing quality degradation and economic losses during low-temperature storage. While physically-based methods exist for simulating plant deformation, they are computationally intensive and not optimized for capturing the subtle, spatially distributed symptoms of CI, such as browning, pitting, and wrinkling. In this paper, we propose a biologically-informed, texture-based framework for dynamic CI simulation that links biological symptom progression to visual representation. Browning and pitting are modeled using a texture-based de-chilling technique driven by a Logistic model of the chilling injury index (CII), with a histogram-matching-based algorithm ensuring alignment between simulated symptoms and CII values. Wrinkling is simulated by combining kinetic models of water loss with bump maps generated using Worley noise, which approximate the quasi-random yet locally continuous surface deformations caused by epidermal shrinkage. The proposed framework efficiently integrates biologically-driven modeling, dynamic texture evolution, and water-loss-induced surface deformation, producing realistic CI simulations without high-resolution meshes. It applies to multiple fruit types — including tropical climacteric (banana), Solanaceous (tomato), Cucurbit (cucumber), and Citrus (orange, lemon) — offering an effective approach for visualizing CI progression.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"143 ","pages":"Article 101309"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145571882","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2026-01-01Epub Date: 2025-12-23DOI: 10.1016/j.gmod.2025.101319
Rengan Xie , Kai Huang , Xiaoliang Luo , Yizheng Chen , Lvchun Wang , Qi Wang , Qi Ye , Wei Chen , Wenting Zheng , Yuchi Huo
{"title":"Corrigendum to “LDM: Large tensorial SDF model for textured mesh generation” [Graphical Models, Volume 140, August 2025, 101271]","authors":"Rengan Xie , Kai Huang , Xiaoliang Luo , Yizheng Chen , Lvchun Wang , Qi Wang , Qi Ye , Wei Chen , Wenting Zheng , Yuchi Huo","doi":"10.1016/j.gmod.2025.101319","DOIUrl":"10.1016/j.gmod.2025.101319","url":null,"abstract":"","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"143 ","pages":"Article 101319"},"PeriodicalIF":2.2,"publicationDate":"2026-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146022960","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2025-12-01Epub Date: 2025-09-23DOI: 10.1016/j.gmod.2025.101298
Hao-Xuan Song , Yue Qian , Xiaohang Zhan , Tai-Jiang Mu
{"title":"EasyAnim: 3D facial animation from in-the-wild videos for avatars with customized riggings","authors":"Hao-Xuan Song , Yue Qian , Xiaohang Zhan , Tai-Jiang Mu","doi":"10.1016/j.gmod.2025.101298","DOIUrl":"10.1016/j.gmod.2025.101298","url":null,"abstract":"<div><div>3D facial animation of digital avatars driven by RGB videos has extensive applications. However, the practical implementation encounters a significant challenge due to the various identities and environments of in-the-wild videos and varying rigging designs. The traditional industry pipeline necessitates a labor-intensive alignment process to ensure compatibility, while the recent novel methods are constrained to a specific rigging standard or require additional labor on actor videos, making them difficult to apply to customized riggings and in-the-wild videos. To make the task easy and convenient, we introduce <strong>EasyAnim</strong>, which utilizes abundant 2D videos to learn an aligned implicit motion flow unsupervisedly and maps it to various rigging parameters in a generalized manner. A novel framework with self- and cross- reconstruction constraints is proposed to ensure the alignment of avatar and human actor domains. Extensive experiments demonstrate that EasyAnim generates comparable or even better results with no additional constraints and labor.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"142 ","pages":"Article 101298"},"PeriodicalIF":2.2,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145121305","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2025-12-01Epub Date: 2025-11-04DOI: 10.1016/j.gmod.2025.101306
Ruixi Ran, Wenlu Yang
{"title":"FD-GCN: Feedback Directed Graph Convolutional Network for skeleton-based action recognition","authors":"Ruixi Ran, Wenlu Yang","doi":"10.1016/j.gmod.2025.101306","DOIUrl":"10.1016/j.gmod.2025.101306","url":null,"abstract":"<div><div>Graph Convolutional Network (GCN) has achieved remarkable result in skeleton-based action recognition. In GCNs, multi-order information has shown notable improvement for recognition and the graph topology, which is the key to fusing and extracting representative features. However, the GCN-based methods still face the following problems: (1) Nodes will have over-smooth problems in deep and complex networks. (2) Lack of efficient methods to fuse data streams of different modalities. In this paper, we proposed a novel data-fusing method, Feedback Directed Graph Convolution (FD-GC), to dynamically construct diverse correlation matrices and effectively aggregate both joint and bone features in different hierarchical update state and utilize them as feedback loops to participate in aggregation respectively for both streams. Our methods significantly reduce the difficulty of modeling multi-streams features at a small parameter cost. Furthermore, the experimental results indicate FD-GC alleviates the over-smooth effect via the feedback mechanism, constructing stronger representation capabilities of fine-grained actions, and performs as well as most skeletal motion recognition algorithms on two large public datasets NTU RGB+D 60, NTU RGB+D 120 and Northwestern-UCLA.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"142 ","pages":"Article 101306"},"PeriodicalIF":2.2,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145474233","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2025-12-01Epub Date: 2025-11-14DOI: 10.1016/j.gmod.2025.101308
Chiara Sorgentone
{"title":"Optimal representation of time-dependent spherical geometries","authors":"Chiara Sorgentone","doi":"10.1016/j.gmod.2025.101308","DOIUrl":"10.1016/j.gmod.2025.101308","url":null,"abstract":"<div><div>Applications in fields such as fluid mechanics, video games and image processing frequently involve the simulation of 3D objects with spherical topology, with a surface quantity that varies with the geometry and/or according to some surface partial differential equation. However, when the geometry undergoes continuous deformations, significant distortions in the surface point distribution may arise. This can lead to aliasing effects and numerical instability, reducing the overall accuracy of the simulation.</div><div>To address this issue, we introduce a novel tool to improve the efficiency of a spectral reparametrization procedure able to ensure the optimal representation of such 3D objects and surface quantities, even when dealing with long time simulations. This new strategy makes the reparametrization technique fully adaptive, selecting only the frequencies that are needed to represent a given surface, improving the efficiency of the algorithm, preventing degradation in the quality of the simulation and enhancing the overall stability.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"142 ","pages":"Article 101308"},"PeriodicalIF":2.2,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145528886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Graphical ModelsPub Date : 2025-12-01Epub Date: 2025-10-13DOI: 10.1016/j.gmod.2025.101305
Xiang Gao, Qingyang Zhang, Chunye Gong, Chao Li, Xiaowei Guo, Jie Liu
{"title":"Efficient adaptive Cartesian mesh generation for complex boundary representation models","authors":"Xiang Gao, Qingyang Zhang, Chunye Gong, Chao Li, Xiaowei Guo, Jie Liu","doi":"10.1016/j.gmod.2025.101305","DOIUrl":"10.1016/j.gmod.2025.101305","url":null,"abstract":"<div><div>Cartesian mesh-based fluid simulation methods are gaining popularity due to their fully automated mesh generation capabilities for geometries without repair. The performance and flexibility of Cartesian mesh generation significantly influence their application across various fields. This study introduces an efficient adaptive Cartesian mesh generation framework directly for arbitrary geometries. Initially, we propose a robust, high-quality build-in tessellation method and compute proximity. Subsequently, we design a hierarchical storage method combined with binary search for efficient intersection determination. To enhance flexibility, a fully unstructured data type and compressed data representation are established. Finally, we develop a four-step refinement mechanism to achieve geometric adaptation and smooth transitions effectively. The robustness and efficiency of the approach were validated through typical case studies, demonstrating that the mesh generation process for complex models can reach speeds of up to <span><math><mrow><mn>1</mn><msup><mrow><mn>0</mn></mrow><mrow><mn>5</mn></mrow></msup></mrow></math></span> cells per second, which presents significant potential to address the challenges of real-time simulations.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"142 ","pages":"Article 101305"},"PeriodicalIF":2.2,"publicationDate":"2025-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145333525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}