Graphical Models最新文献

Topology-controlled Laplace–Beltrami operator on point clouds based on persistent homology

IF 2.5 4区计算机科学

Graphical Models Pub 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-04-02","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

Additive manufacturing toward 2D and 3D freeform lattices with conforming compliant bi-/multi-stable tiles

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-03-28 DOI: 10.1016/j.gmod.2025.101260

Gershon Elber

引用次数: 0

3DMeshNet: A three-dimensional differential neural network for structured mesh generation

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-03-25 DOI: 10.1016/j.gmod.2025.101257

Jiaming Peng, Xinhai Chen, Jie Liu

{"title":"3DMeshNet: A three-dimensional differential neural network for structured mesh generation","authors":"Jiaming Peng, Xinhai Chen, Jie Liu","doi":"10.1016/j.gmod.2025.101257","DOIUrl":"10.1016/j.gmod.2025.101257","url":null,"abstract":"<div><div>Mesh generation is a crucial step in numerical simulations, significantly impacting simulation accuracy and efficiency. However, generating meshes remains time-consuming and requires expensive computational resources. In this paper, we propose a novel method, 3DMeshNet, for three-dimensional structured mesh generation. The method embeds the meshing-related differential equations into the loss function of neural networks, formulating the meshing task as an unsupervised optimization problem. It takes geometric points as input to learn the potential mapping between parametric and computational spaces. After suitable offline training, 3DMeshNet can efficiently output a three-dimensional structured mesh with a user-defined number of quadrilateral/hexahedral cells through the feed-forward neural prediction. To enhance training stability and accelerate convergence, we integrate loss function reweighting through weight adjustments and gradient projection alongside applying finite difference methods to streamline derivative computations in the loss. Experiments on different cases show that 3DMeshNet is robust and fast. It outperforms neural network-based methods and yields superior meshes compared to traditional mesh partitioning methods. 3DMeshNet significantly reduces training times by up to 85% compared to other neural network-based approaches and lowers meshing overhead by 4 to 8 times relative to traditional meshing methods.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101257"},"PeriodicalIF":2.5,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683472","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

Efficient extraction of experimental data from line charts using advanced machine learning techniques

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-03-25 DOI: 10.1016/j.gmod.2025.101259

Wenjin Yang, Jie He, Xiaotong Zhang

{"title":"Efficient extraction of experimental data from line charts using advanced machine learning techniques","authors":"Wenjin Yang, Jie He, Xiaotong Zhang","doi":"10.1016/j.gmod.2025.101259","DOIUrl":"10.1016/j.gmod.2025.101259","url":null,"abstract":"<div><div>Line charts, as a common data visualization tool in scientific research and business analysis, encapsulate rich experimental data. However, existing data extraction tools face challenges such as low automation levels and difficulties in handling complex charts. This paper proposes a novel method for extracting data from line charts, reformulating the extraction problem as an instance segmentation task, and introducing the Mamba-enhanced Transformer mask query method along with a curve mask-guided training approach to address challenges such as long dependencies and intersections in curve detection. Additionally, YOLOv9 is utilized for the detection and classification of chart elements, and a text recognition dataset comprising approximately 100K charts is constructed. An LSTM-based attention mechanism is employed for precise scale value recognition. Lastly, we present a method for automatically converting image data into structured JSON data, significantly enhancing the efficiency and accuracy of data extraction. Experimental results demonstrate that this method exhibits high efficiency and accuracy in handling complex charts, achieving an average extraction accuracy of 93% on public datasets, significantly surpassing the current state-of-the-art methods. This research provides an efficient foundation for large-scale scientific data analysis and machine learning model development, advancing the field of automated data extraction technology.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"139 ","pages":"Article 101259"},"PeriodicalIF":2.5,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143683471","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

Computing medial axis of a simple polygon in linear time based on R-L sequence

IF 2.5 4区计算机科学

Graphical Models Pub 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-03-24","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

3D data augmentation and dual-branch model for robust face forgery detection

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-02-04 DOI: 10.1016/j.gmod.2025.101255

Changshuang Zhou , Frederick W.B. Li , Chao Song , Dong Zheng , Bailin Yang

引用次数: 0

Discrete variable 3D models in Computer extended Descriptive Geometry (CeDG): Building of polygonal sheet-metal elbows and comparison against CAD

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-02-01 DOI: 10.1016/j.gmod.2024.101253

Manuel Prado-Velasco, Laura García-Ruesgas

引用次数: 0

Efficient alternating and joint distance minimization methods for adaptive spline surface fitting

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-02-01 DOI: 10.1016/j.gmod.2024.101251

Carlotta Giannelli , Sofia Imperatore , Angelos Mantzaflaris , Dominik Mokriš

{"title":"Efficient alternating and joint distance minimization methods for adaptive spline surface fitting","authors":"Carlotta Giannelli , Sofia Imperatore , Angelos Mantzaflaris , Dominik Mokriš","doi":"10.1016/j.gmod.2024.101251","DOIUrl":"10.1016/j.gmod.2024.101251","url":null,"abstract":"<div><div>We propose a new paradigm for scattered data fitting with adaptive spline constructions based on the key interplay between parameterization and adaptivity. Specifically, we introduce two novel adaptive fitting schemes that combine moving parameterizations with adaptive spline refinement for highly accurate CAD models reconstruction from real-world scattered point clouds. The first scheme alternates surface fitting and data parameter optimization. The second scheme jointly optimizes the parameters and the surface control points. To combine the proposed fitting methods with adaptive spline constructions, we present a key treatment of boundary points. Industrial examples show that updating the parameterization, within an adaptive spline approximation framework, significantly reduces the number of degrees of freedom needed for a certain accuracy, especially if spline adaptivity is driven by suitably graded hierarchical meshes. The numerical experiments employ THB-splines, thus exploiting the existing CAD integration within the considered industrial setting, nevertheless, any adaptive spline construction can be chosen.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"137 ","pages":"Article 101251"},"PeriodicalIF":2.5,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143140780","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

Geometry of the visual cortex with applications to image inpainting and enhancement

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-02-01 DOI: 10.1016/j.gmod.2024.101239

Francesco Ballerin, Erlend Grong

引用次数: 0

Quasi-interpolation projectors for subdivision function spaces

IF 2.5 4区计算机科学

Graphical Models Pub Date : 2025-02-01 DOI: 10.1016/j.gmod.2024.101250

Hailun Xu, Zepeng Wen, Hongmei Kang

{"title":"Quasi-interpolation projectors for subdivision function spaces","authors":"Hailun Xu, Zepeng Wen, Hongmei Kang","doi":"10.1016/j.gmod.2024.101250","DOIUrl":"10.1016/j.gmod.2024.101250","url":null,"abstract":"<div><div>Subdivision surfaces as an extension of splines have become a promising technique for addressing PDEs on models with complex topologies in isogeometric analysis. This has sparked interest in exploring the approximation by subdivision function spaces. Quasi-interpolation serves as a significant tool in the field of approximation, offering benefits such as low computational expense and strong numerical stability. In this paper, we propose a straightforward approach for constructing the quasi-interpolation projectors of subdivision function spaces that features explicit formulations and achieves a highly desirable approximation order. The local interpolation problem is constructed based on the subdivision mask and the limit position mask, overcoming the cumbersome evaluation of the subdivision basis functions and the difficulty associated with deriving explicit solutions to the problem. Explicit quasi-interpolation formulas for the loop, modified loop, and Catmull–Clark subdivisions are provided. Numerical experiments demonstrate that these quasi-interpolation projectors achieve an expected approximate order and present promising prospects in isogeometric collocation.</div></div>","PeriodicalId":55083,"journal":{"name":"Graphical Models","volume":"137 ","pages":"Article 101250"},"PeriodicalIF":2.5,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143140779","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