Graphical Models最新文献_第5页

DC-APIC: A decomposed compatible affine particle in cell transfer scheme for non-sticky solid–fluid interactions in MPM DC-APIC：在MPM中非粘性固-液相互作用的细胞转移方案中分解的兼容仿射粒子

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-05-25 DOI: 10.1016/j.gmod.2025.101269

Chenhui Wang , Jianyang Zhang , Chen Li , Changbo Wang

{"title":"DC-APIC: A decomposed compatible affine particle in cell transfer scheme for non-sticky solid–fluid interactions in MPM","authors":"Chenhui Wang , Jianyang Zhang , Chen Li , Changbo Wang","doi":"10.1016/j.gmod.2025.101269","DOIUrl":"10.1016/j.gmod.2025.101269","url":null,"abstract":"<div><div>Despite the material point method (MPM) provides a unified particle simulation framework for coupling of different materials, MPM suffers from sticky numerical artifacts, which is inherently restricted to sticky and no-slip interactions. In this paper, we propose a novel transfer scheme called Decomposed Compatible Affine Particle in Cell (DC-APIC) within the MPM framework for simulating the two-way coupled interaction between elastic solids and incompressible fluids under free-slip boundary conditions on a unified background grid. Firstly, we adopt particle-grid compatibility to describe the relationship between grid nodes and particles at the fluid–solid interface, which serves as the guideline for subsequent particle–grid–particle transfers. Then we develop a phase-field gradient method to track the compatibility and normal directions at the interface. Secondly, to facilitate automatic MPM collision resolution during solid–fluid coupling, in the proposed DC-APIC integrator, the tangential component will not be transferred between incompatible grid nodes to prevent velocity smoothing in another phase, while the normal component is transferred without limitations. Finally, our comprehensive results confirm that our approach effectively reduces diffusion and unphysical viscosity compared to traditional MPM.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101269"},"PeriodicalIF":2.5,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144134591","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}

引用次数: 0

Design method of porous scaffold based on TPMS and KM growth function 基于TPMS和KM生长函数的多孔支架设计方法

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-05-02 DOI: 10.1016/j.gmod.2025.101265

Yi Zhang, Jiong Liu, Quan Qi

{"title":"Design method of porous scaffold based on TPMS and KM growth function","authors":"Yi Zhang, Jiong Liu, Quan Qi","doi":"10.1016/j.gmod.2025.101265","DOIUrl":"10.1016/j.gmod.2025.101265","url":null,"abstract":"<div><div>Additive manufacturing technology, as a cutting-edge manufacturing process, has shown great potential in the preparation of 3D tissue engineering scaffolds with complex pore structures. The multi-functional scaffolds produced by this technology can provide a combination of excellent mechanical and biological properties, such as high stiffness, strength, toughness and good fluid permeability. Among many stent design methods, pore shape design based on triply periodic minimal surface is favored because of its advantages in controlling design parameters such as aperture, pore shape and internal channel connectivity. In this paper, a new design method for multi-shape scaffolds is proposed, which combines KM growth function and shape conformal mixing technique to construct a complex pore structure consisting of multiple triply periodic minimal surfaces and arbitrary transition boundaries in a scaffold. The advantage of this method is that it can flexibly control the mixed form of the resulting scaffold, and then explore and optimize a variety of transition pore forms to achieve a combination of multi-functiona characteristics such as high strength and excellent fluid permeability.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101265"},"PeriodicalIF":2.5,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899399","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}

引用次数: 0

Semantics-aware human motion generation from audio instructions 从音频指令生成语义感知的人体运动

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-05-23 DOI: 10.1016/j.gmod.2025.101268

Zi-An Wang , Shihao Zou , Shiyao Yu , Mingyuan Zhang , Chao Dong

引用次数: 0

SEDFMNet: A Simple and Efficient Unsupervised Functional Map for Shape Correspondence Based on Deconstruction SEDFMNet：一种简单高效的基于解构的形状对应的无监督函数映射

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-06-04 DOI: 10.1016/j.gmod.2025.101270

Haojun Xu , Qinsong Li , Ling Hu , Shengjun Liu , Haibo Wang , Xinru Liu

{"title":"SEDFMNet: A Simple and Efficient Unsupervised Functional Map for Shape Correspondence Based on Deconstruction","authors":"Haojun Xu , Qinsong Li , Ling Hu , Shengjun Liu , Haibo Wang , Xinru Liu","doi":"10.1016/j.gmod.2025.101270","DOIUrl":"10.1016/j.gmod.2025.101270","url":null,"abstract":"<div><div>In recent years, deep functional maps (DFM) have emerged as a leading learning-based framework for non-rigid shape-matching problems, offering diverse network architectures for this domain. This richness also makes exploring better and novel design beliefs for existing powerful DFM components to promote performance meaningful and engaging. This paper delves into this problem and successfully produces the SEDFMNet, a simple yet highly efficient DFM pipeline. To achieve this, we systematically deconstruct the core modules of the general DFM framework and analyze key design choices in existing approaches to identify the most critical components through extensive experiments. By reassembling these crucial components, we culminate in developing our SEDFMNet, which features a simpler structure than conventional DFM pipelines while delivering superior performance. Our approach is rigorously validated through comprehensive experiments on diverse datasets, where the SEDFMNet consistently achieves state-of-the-art results, even in challenging scenarios such as non-isometric shape matching and shape matching with topological noise. Our work offers fresh insights into DFM research and opens new avenues for advancing this field.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101270"},"PeriodicalIF":2.5,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144203918","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}

引用次数: 0

Human perception faithful curve reconstruction based on persistent homology and principal curve 基于持久同调和主曲线的人类感知忠实曲线重建

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-05-24 DOI: 10.1016/j.gmod.2025.101267

Yu Chen, Hongwei Lin, Yifan Xing

引用次数: 0

RMAvatar: Photorealistic human avatar reconstruction from monocular video based on rectified mesh-embedded Gaussians RMAvatar：基于校正网格嵌入高斯函数的单目视频真人头像重建

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-05-24 DOI: 10.1016/j.gmod.2025.101266

Sen Peng , Weixing Xie , Zilong Wang , Xiaohu Guo , Zhonggui Chen , Baorong Yang , Xiao Dong

{"title":"RMAvatar: Photorealistic human avatar reconstruction from monocular video based on rectified mesh-embedded Gaussians","authors":"Sen Peng , Weixing Xie , Zilong Wang , Xiaohu Guo , Zhonggui Chen , Baorong Yang , Xiao Dong","doi":"10.1016/j.gmod.2025.101266","DOIUrl":"10.1016/j.gmod.2025.101266","url":null,"abstract":"<div><div>We introduce RMAvatar, a novel human avatar representation with Gaussian splatting embedded on mesh to learn clothed avatar from a monocular video. We utilize the explicit mesh geometry to represent motion and shape of a virtual human and implicit appearance rendering with Gaussian Splatting. Our method consists of two main modules: Gaussian initialization module and Gaussian rectification module. We embed Gaussians into triangular faces and control their motion through the mesh, which ensures low-frequency motion and surface deformation of the avatar. Due to the limitations of LBS formula, the human skeleton is hard to control complex non-rigid transformations. We then design a pose-related Gaussian rectification module to learn fine-detailed non-rigid deformations, further improving the realism and expressiveness of the avatar. We conduct extensive experiments on public datasets, and RMAvatar shows state-of-the-art performance on both rendering quality and quantitative evaluations. Please see our project page at <span><span>https://rm-avatar.github.io</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101266"},"PeriodicalIF":2.5,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144123954","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}

引用次数: 0

Computing medial axis of a simple polygon in linear time based on R-L sequence 基于R-L序列在线性时间内计算简单多边形的中轴线

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-03-24 DOI: 10.1016/j.gmod.2025.101258

Hongyu Chen, Xiaodiao Chen, Yizhao Xue

{"title":"Computing medial axis of a simple polygon in linear time based on R-L sequence","authors":"Hongyu Chen, Xiaodiao Chen, Yizhao Xue","doi":"10.1016/j.gmod.2025.101258","DOIUrl":"10.1016/j.gmod.2025.101258","url":null,"abstract":"<div><div>Medial axis computation has wide applications in pattern recognition, image processing, finite element mesh generation, and CNC tool path extraction. Aiming to explore intrinsic geometric attributes of the medial axis of a simple polygon which can be accurately represented and faces its challenge of computational efficiency, an R-L sequence-based algorithm of linear computational complexity is proposed for achieving much higher efficiency; especially, it enables the complexity of Delaunay triangulation to be linear. The algorithm is done by reconstructing the Voronoi diagram tree of the given simple polygon, which can be easily performed in a breadth-first manner with a higher computational efficiency. The branches of the medial axis are naturally divided into several panels, such that the branches in the same panel cause no interference with each other and decrease a lot of computational costs. Based on our experiments, the efficiency of the proposed R-L algorithm can be 6 to 17 times greater than that of the state-of-the-art method in TVCG, and up to 419 times greater than the CGAL algorithm. In principle, it can be directly applied to compute the medial axis of curvilinear polygons, which expands the scope of application compared to Chin’s method.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101258"},"PeriodicalIF":2.5,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683549","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

Topology-controlled Laplace–Beltrami operator on point clouds based on persistent homology 基于持久同调的点云拓扑控制拉普拉斯-贝尔特拉米算子

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-04-02 DOI: 10.1016/j.gmod.2025.101261

Ao Zhang, Qing Fang, Peng Zhou, Xiao-Ming Fu

{"title":"Topology-controlled Laplace–Beltrami operator on point clouds based on persistent homology","authors":"Ao Zhang, Qing Fang, Peng Zhou, Xiao-Ming Fu","doi":"10.1016/j.gmod.2025.101261","DOIUrl":"10.1016/j.gmod.2025.101261","url":null,"abstract":"<div><div>Computing the Laplace–Beltrami operator on point clouds is essential for tasks such as smoothing and shape analysis. Unlike meshes, determining the Laplace–Beltrami operator on point clouds requires establishing neighbors for each point. However, traditional <span><math><mi>k</mi></math></span>-nearest neighbors (k-NN) methods for estimating local neighborhoods often introduce spurious connectivities that distort the manifold topology. We propose a novel approach that leverages persistent homology to refine the neighborhood graph by identifying and removing erroneous edges. Starting with an initial k-NN graph, we assign weights based on local tangent plane estimations and construct a Vietoris–Rips complex. Persistent homology is then employed to detect and eliminate spurious edges through a topological optimization process. This iterative refinement results in a more accurate neighborhood graph that better represents the underlying manifold, enabling precise discretization of the Laplace–Beltrami operator. Experimental results on various point cloud datasets demonstrate that our method outperforms traditional k-NN approaches by more accurately capturing the manifold topology and enhancing downstream computations such as spectral analysis.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101261"},"PeriodicalIF":2.5,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143746699","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

FastClothGNN: Optimizing message passing in Graph Neural Networks for accelerating real-time cloth simulation FastClothGNN：优化图神经网络中的消息传递，加速实时布料模拟

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-06-08 DOI: 10.1016/j.gmod.2025.101273

Yang Zhang, Kailuo Yu, Xinyu Zhang

引用次数: 0

An efficient parametric modeling and path planning method for 3D printing of curved surface corrugated sandwich structures 曲面波纹夹层结构三维打印的高效参数化建模与路径规划方法

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-06-01 Epub Date: 2025-04-10 DOI: 10.1016/j.gmod.2025.101263

Tan Gui , Zhihong Li , Yongjun Cao , Jianghong Yang , Yingjun Wang

{"title":"An efficient parametric modeling and path planning method for 3D printing of curved surface corrugated sandwich structures","authors":"Tan Gui , Zhihong Li , Yongjun Cao , Jianghong Yang , Yingjun Wang","doi":"10.1016/j.gmod.2025.101263","DOIUrl":"10.1016/j.gmod.2025.101263","url":null,"abstract":"<div><div>This study proposes an efficient preprocessing method and parametric modeling technique for the path planning of corrugated curved surface sandwich structures. Focusing on the characteristics of Fused Deposition Modeling (FDM), the model undergoes preprocessing for two types of path planning, segmenting the sandwich structure for Eulerian Path Printing (EPP) and Eulerian Circuit Printing (ECP). Algorithms were developed using the SolidWorks API for secondary development, resulting in a standalone plugin module. This plugin streamlines adaptive modeling of corrugated sandwich structures on curved surfaces, showcasing strong versatility. Additionally, a comparison of the printing time between preprocessed models and standard models reveals a significant reduction in nozzle idle time. Moreover, as the infill density increases, the reduction in printing time becomes more pronounced. Finally, compression tests confirmed that printed parts obtained using the EPP and ECP methods maintained comparable mechanical properties to those printed using conventional methods.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101263"},"PeriodicalIF":2.5,"publicationDate":"2025-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143808721","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}

引用次数: 0