Computer Aided Geometric Design最新文献_第6页

A new stable method to compute mean value coordinates 计算平均值坐标的新稳定方法

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-29 DOI: 10.1016/j.cagd.2024.102310

Chiara Fuda, Kai Hormann

{"title":"A new stable method to compute mean value coordinates","authors":"Chiara Fuda, Kai Hormann","doi":"10.1016/j.cagd.2024.102310","DOIUrl":"https://doi.org/10.1016/j.cagd.2024.102310","url":null,"abstract":"<div><p>The generalization of barycentric coordinates to arbitrary simple polygons with more than three vertices has been a subject of study for a long time. Among the different constructions proposed, mean value coordinates have emerged as a popular choice, particularly due to their suitability for the non-convex setting. Since their introduction, they have found applications in numerous fields, and several equivalent formulas for their evaluation have been presented in the literature. However, so far, there has been no study regarding their numerical stability. In this paper, we aim to investigate the numerical stability of the algorithms that compute mean value coordinates. We show that all the known methods exhibit instability in some regions of the domain. To address this problem, we introduce a new formula for computing mean value coordinates, explain how to implement it, and formally prove that our new algorithm provides a stable evaluation of mean value coordinates. We validate our results through numerical experiments.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102310"},"PeriodicalIF":1.5,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S016783962400044X/pdfft?md5=153410286c615fea62e2d69c27e8fedf&pid=1-s2.0-S016783962400044X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140824642","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

Voronoi-based splinegon decomposition and shortest-path tree computation 基于 Voronoi 的 Splinegon 分解和最短路径树计算

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102316

Xiyu Bao , Meng Qi , Chenglei Yang , Wei Gai

{"title":"Voronoi-based splinegon decomposition and shortest-path tree computation","authors":"Xiyu Bao , Meng Qi , Chenglei Yang , Wei Gai","doi":"10.1016/j.cagd.2024.102316","DOIUrl":"10.1016/j.cagd.2024.102316","url":null,"abstract":"<div><p>In motion planning, two-dimensional (2D) splinegons are typically used to represent the contours of 2D objects. In general, a 2D splinegon must be pre-decomposed to support rapid queries of the shortest paths or visibility. Herein, we propose a new region decomposition strategy, known as the Voronoi-based decomposition (VBD), based on the Voronoi diagram of curved boundary-segment generators (either convex or concave). The number of regions in the VBD is O(<em>n</em>+<span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>). Compared with the well-established horizontal visibility decomposition (HVD), whose complexity is O(<em>n</em>+<span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>), the VBD decomposition generally contains less regions because <span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span>≤<span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span>, where <em>n</em> is the number of the vertices of the input splinegon, and <span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>1</mn></mrow></msub></math></span> and <span><math><msub><mrow><mi>c</mi></mrow><mrow><mn>2</mn></mrow></msub></math></span> are the number of inserted vertices at the boundary. We systematically discuss the usage of VBD. Based on the VBD, the shortest path tree (SPT) can be computed in linear time. Statistics show that the VBD performs faster than HVD in SPT computations. Additionally, based on the SPT, we design algorithms that can rapidly compute the visibility between two points, the visible area of a point/line-segment, and the shortest path between two points.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102316"},"PeriodicalIF":1.5,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140758403","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

3D shape descriptor design based on HKS and persistent homology with stability analysis 基于 HKS 和持久同源性及稳定性分析的三维形状描述符设计

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102326

Zitong He , Peisheng Zhuo , Hongwei Lin , Junfei Dai

引用次数: 0

Flipping-based iterative surface reconstruction for unoriented points 基于翻转的无方向点迭代曲面重构

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102315

Yueji Ma , Yanzun Meng , Dong Xiao , Zuoqiang Shi , Bin Wang

{"title":"Flipping-based iterative surface reconstruction for unoriented points","authors":"Yueji Ma , Yanzun Meng , Dong Xiao , Zuoqiang Shi , Bin Wang","doi":"10.1016/j.cagd.2024.102315","DOIUrl":"10.1016/j.cagd.2024.102315","url":null,"abstract":"<div><p>In this paper, we propose a novel surface reconstruction method for unoriented points by establishing and solving a nonlinear equation system. By treating normals as unknown parameters and imposing the conditions that the implicit field is constant and its gradients parallel to the normals on the input point cloud, we establish a nonlinear equation system involving the oriented normals. To simplify the system, we transform it into a 0-1 integer programming problem solely focusing on orientation by incorporating inconsistent oriented normal information through PCA. We solve the simplified problem using flipping-based iterative algorithms and propose two novel criteria for flipping based on theoretical analysis.</p><p>Extensive experiments on renowned datasets demonstrate that our flipping-based method with wavelet surface reconstruction achieves state-of-the-art results in orientation and reconstruction. Furthermore, it exhibits linear computational and storage complexity by leveraging the orthogonality and compact support properties of wavelet bases. The source code is available at <span>https://github.com/mayueji/FISR_code</span><svg><path></path></svg>.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102315"},"PeriodicalIF":1.5,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140775858","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

Feature-preserving quadrilateral mesh Boolean operation with cross-field guided layout blending 通过跨场引导布局混合实现保全特征的四边形网格布尔运算

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102324

Weiwei Zheng, Haiyan Wu, Gang Xu, Ran Ling, Renshu Gu

引用次数: 0

Fast parameterization of planar domains for isogeometric analysis via generalization of deep neural network 通过深度神经网络的泛化实现等距测量分析中平面域的快速参数化

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102313

Zheng Zhan , Wenping Wang , Falai Chen

{"title":"Fast parameterization of planar domains for isogeometric analysis via generalization of deep neural network","authors":"Zheng Zhan , Wenping Wang , Falai Chen","doi":"10.1016/j.cagd.2024.102313","DOIUrl":"https://doi.org/10.1016/j.cagd.2024.102313","url":null,"abstract":"<div><p>One prominent step in isogeometric analysis (IGA) is known as domain parameterization, that is, finding a parametric spline representation for a computational domain. Typically, domain parameterization is divided into two separate steps: identifying an appropriate boundary correspondence and then parameterizing the interior region. However, this separation significantly degrades the quality of the parameterization. To attain high-quality parameterization, it is necessary to optimize both the boundary correspondence and the interior mapping simultaneously, referred to as integral parameterization. In a prior research, an integral parameterization approach for planar domains based on neural networks was introduced. One limitation of this approach is that the neural network has no ability of generalization, that is, a network has to be trained to obtain a parameterization for each specific computational domain. In this article, we propose an efficient enhancement over this work, and we train a network which has the capacity of generalization—once the network is trained, a parameterization can be immediately obtained for each specific computational via evaluating the network. The new network greatly speeds up the parameterization process by two orders of magnitudes. We evaluate the performance of the new network on the MPEG data set and a self-design data set, and experimental results demonstrate the superiority of our algorithm compared to state-of-the-art parameterization methods.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102313"},"PeriodicalIF":1.5,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140649957","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

Evolutionary multi-objective high-order tetrahedral mesh optimization 进化多目标高阶四面体网格优化

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102302

Yang Ji , Shibo Liu , Jia-Peng Guo , Jian-Ping Su , Xiao-Ming Fu

引用次数: 0

Feature-preserving shrink wrapping with adaptive alpha 利用自适应阿尔法进行特征保留收缩包装

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102321

Jiayi Dai , Yiqun Wang , Dong-Ming Yan

{"title":"Feature-preserving shrink wrapping with adaptive alpha","authors":"Jiayi Dai , Yiqun Wang , Dong-Ming Yan","doi":"10.1016/j.cagd.2024.102321","DOIUrl":"10.1016/j.cagd.2024.102321","url":null,"abstract":"<div><p>Recent advancements in shrink-wrapping-based mesh approximation have shown tremendous advantages for non-manifold defective meshes. However, these methods perform unsatisfactorily when maintaining the regions with sharp features and rich details of the input mesh. We propose an adaptive shrink-wrapping method based on the recent Alpha Wrapping technique, offering improved feature preservation while handling defective inputs. The proposed approach comprises three main steps. First, we compute a new sizing field with the capability to assess the discretization density of non-manifold defective meshes. Then, we generate a mesh feature skeleton by projecting input feature lines onto the offset surface, ensuring the preservation of sharp features. Finally, an adaptive wrapping approach based on normal projection is applied to preserve the regions with sharp features and rich details simultaneously. By conducting experimental tests on various datasets including Thingi10k, ABC, and GrabCAD, we demonstrate that our method exhibits significant improvements in mesh fidelity compared to the Alpha Wrapping method, while maintaining the advantage of manifold property inherited from shrink-wrapping methods.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102321"},"PeriodicalIF":1.5,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140769915","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

Generated realistic noise and rotation-equivariant models for data-driven mesh denoising 为数据驱动的网格去噪生成真实噪声和旋转变量模型

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102306

Sipeng Yang , Wenhui Ren , Xiwen Zeng , Qingchuan Zhu , Hongbo Fu , Kaijun Fan , Lei Yang , Jingping Yu , Qilong Kou , Xiaogang Jin

{"title":"Generated realistic noise and rotation-equivariant models for data-driven mesh denoising","authors":"Sipeng Yang , Wenhui Ren , Xiwen Zeng , Qingchuan Zhu , Hongbo Fu , Kaijun Fan , Lei Yang , Jingping Yu , Qilong Kou , Xiaogang Jin","doi":"10.1016/j.cagd.2024.102306","DOIUrl":"10.1016/j.cagd.2024.102306","url":null,"abstract":"<div><p>3D mesh denoising is a crucial pre-processing step in many graphics applications. However, existing data-driven mesh denoising models, primarily trained on synthetic white noise, are less effective when applied to real-world meshes with the noise of complex intensities and distributions. Moreover, how to comprehensively capture information from input meshes and apply suitable denoising models for feature-preserving mesh denoising remains a critical and unresolved challenge. This paper presents a rotation-Equivariant model-based Mesh Denoising (EMD) model and a Realistic Mesh Noise Generation (RMNG) model to address these issues. Our EMD model leverages rotation-equivariant features and self-attention weights of geodesic patches for more effective feature extraction, thereby achieving SOTA denoising results. The RMNG model, based on the Generative Adversarial Networks (GANs) architecture, generates massive amounts of realistic noisy and noiseless mesh pairs data for data-driven mesh denoising model training, significantly benefiting real-world denoising tasks. To address the smooth degradation and loss of sharp edges commonly observed in captured meshes, we further introduce varying levels of Laplacian smoothing to input meshes during the paired training data generation, endowing the trained denoising model with feature recovery capabilities. Experimental results demonstrate the superior performance of our proposed method in preserving fine-grained features while removing noise on real-world captured meshes.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102306"},"PeriodicalIF":1.5,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140787282","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

Unpaired high-quality image-guided infrared and visible image fusion via generative adversarial network 通过生成式对抗网络实现非配对高质量图像引导的红外和可见光图像融合

IF 1.5 4区计算机科学

Computer Aided Geometric Design Pub Date : 2024-04-25 DOI: 10.1016/j.cagd.2024.102325

Hang Li, Zheng Guan, Xue Wang, Qiuhan Shao

{"title":"Unpaired high-quality image-guided infrared and visible image fusion via generative adversarial network","authors":"Hang Li, Zheng Guan, Xue Wang, Qiuhan Shao","doi":"10.1016/j.cagd.2024.102325","DOIUrl":"10.1016/j.cagd.2024.102325","url":null,"abstract":"<div><p>Current infrared and visible image fusion (IVIF) methods lack ground truth and require prior knowledge to guide the feature fusion process. However, in the fusion process, these features have not been placed in an equal and well-defined position, which causes the degradation of image quality. To address this challenge, this study develops a new end-to-end model, termed unpaired high-quality image-guided generative adversarial network (UHG-GAN). Specifically, we introduce the high-quality image as the reference standard of the fused image and employ a global discriminator and a local discriminator to identify the distribution difference between the high-quality image and the fused image. Through adversarial learning, the generator can generate images that are more consistent with high-quality expression. In addition, we also designed the laplacian pyramid augmentation (LPA) module in the generator, which integrates multi-scale features of source images across domains so that the generator can more fully extract the structure and texture information. Extensive experiments demonstrate that our method can effectively preserve the target information in the infrared image and the scene information in the visible image and significantly improve the image quality.</p></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"111 ","pages":"Article 102325"},"PeriodicalIF":1.5,"publicationDate":"2024-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140797052","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