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

Weingarten surface approximation by curvature diagram transformation 曲率图变换的维因加滕曲面近似

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-04-28 DOI: 10.1016/j.cagd.2025.102438

Fei Huang , Caigui Jiang , Yong-Liang Yang

{"title":"Weingarten surface approximation by curvature diagram transformation","authors":"Fei Huang , Caigui Jiang , Yong-Liang Yang","doi":"10.1016/j.cagd.2025.102438","DOIUrl":"10.1016/j.cagd.2025.102438","url":null,"abstract":"<div><div>Weingarten surfaces are characterized by a functional relation between their principal curvatures. Such a specialty makes them suitable for building surface paneling in architectural applications, as the curvature relation implies approximate local congruence on the surface thus the molds for paneling can be largely reused. In this work, we aim at a novel task of Weingarten surface approximation. Given a surface mesh with arbitrary topology, we optimize its shape to make it as Weingarten as possible. We devise a curvature-based optimization approach based on the fact that the 2D principal curvature plots of a Weingarten surface comprise a group of 1D curves that encode the curvature relations. Our approach alternatively performs two steps. The first step transforms the principal curvature plots from a 2D region to 1D curves in order to explore the curvature relations. The second step deforms the shape such that its curvatures conform to the corresponding transformed curvature plots. We demonstrate the effectiveness of our work on a variety of shapes with different topologies. Hopefully our work would bring inspiration on the study of general Weingarten surfaces with arbitrary topology and curvature relation.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102438"},"PeriodicalIF":1.3,"publicationDate":"2025-04-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143886734","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

Efficient neural RGB-D indoor scene reconstruction based on normal features 基于正常特征的高效神经RGB-D室内场景重建

IF 1.3 4区计算机科学

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

Xiaoqun Wu, Xin Liu, Yumeng Cao, Haisheng Li

{"title":"Efficient neural RGB-D indoor scene reconstruction based on normal features","authors":"Xiaoqun Wu, Xin Liu, Yumeng Cao, Haisheng Li","doi":"10.1016/j.cagd.2025.102452","DOIUrl":"10.1016/j.cagd.2025.102452","url":null,"abstract":"<div><div>Reconstructing large-scale indoor scenes from 2D images to 3D models presents substantial challenges, particularly in handling texture-less regions and extensive scene sizes with both accuracy and efficiency. This paper introduces a novel method for efficient and high-quality geometric reconstruction of indoor scenes using RGB-D images. Our approach integrates normal features as prior information into the RGB-D data and employs a truncated signed distance function (TSDF) to represent scene surfaces. Combined with multi-resolution hash encoding, the proposed method achieves both high reconstruction quality and computational efficiency. Specifically, we estimate normal vectors from RGB images as feature priors to guide surface fitting. To address the inaccuracies of normal estimation in regions with small objects or complex geometric details, we incorporate depth information to better constrain the surface fitting process. Additionally, multi-resolution hash encoding is used to stratify sampling points, enabling rapid feature lookups via hash functions. Experimental results demonstrate that the proposed method significantly outperforms existing approaches in terms of both reconstruction quality and computational efficiency.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102452"},"PeriodicalIF":1.3,"publicationDate":"2025-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143882631","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

What smooth surfaces can be constructed from total degree 2 splines? 2次样条曲线可以构造出什么样的光滑曲面？

IF 1.3 4区计算机科学

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

Jörg Peters, Kȩstutis Karčiauskas

引用次数: 0

Feature-preserving point cloud filtering via mixture family manifold 基于混合族流形的特征保持点云滤波

IF 1.3 4区计算机科学

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

Peng Du, Xingce Wang, Yaohui Fang, Xudong Ru, Haichuan Zhao, Zhongke Wu

引用次数: 0

Transfinite barycentric coordinates for arbitrary planar domains 任意平面域的超有限质心坐标

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-04-23 DOI: 10.1016/j.cagd.2025.102433

Qingjun Chang, Kai Hormann

{"title":"Transfinite barycentric coordinates for arbitrary planar domains","authors":"Qingjun Chang, Kai Hormann","doi":"10.1016/j.cagd.2025.102433","DOIUrl":"10.1016/j.cagd.2025.102433","url":null,"abstract":"<div><div>Generalized barycentric coordinates provide a simple way of interpolating data given at the vertices of a polygon or polyhedron, with widespread applications in computer graphics, geometry processing, and other fields. Transfinite barycentric coordinates, also known as barycentric kernels, extend this idea to curved domains and can be used to interpolate continuous data given on the boundary of such domains. We present a novel framework for defining non-negative barycentric kernels over arbitrary bounded planar domains. This framework is inspired by the construction of a transfinite version of maximum likelihood coordinates and can be used to define a variety of barycentric kernels, including a simple pseudo-harmonic kernel and a non-negative variant of the mean value kernel. Moreover, we propose a novel barycentric kernel which yields transfinite interpolants that are similar to harmonic interpolants. We tested our new kernel for domains and boundary data described by closed uniform quadratic splines and in particular for image deformation. The results indicate that our method has several advantages over alternative approaches.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102433"},"PeriodicalIF":1.3,"publicationDate":"2025-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143868337","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

MTSegNet: Manifold Transformer for 3D shape segmentation MTSegNet：用于3D形状分割的歧管变压器

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-04-22 DOI: 10.1016/j.cagd.2025.102440

Zhenyu Shu , Zhichao Zhang , Yiming Zhao , Teng Wu

{"title":"MTSegNet: Manifold Transformer for 3D shape segmentation","authors":"Zhenyu Shu , Zhichao Zhang , Yiming Zhao , Teng Wu","doi":"10.1016/j.cagd.2025.102440","DOIUrl":"10.1016/j.cagd.2025.102440","url":null,"abstract":"<div><div>The semantic segmentation of 3D meshes is a critical component of 3D shape analysis, which involves assigning semantic labels to each face of a 3D mesh. Despite its significance, current methods often struggle to capture manifold information in 3D meshes, a fundamental characteristic distinguishing them from other representation forms of 3D data, like 3D point clouds or 3D voxels, resulting in suboptimal segmentation outcomes. In this paper, we propose a novel Transformer-based approach, Manifold Transformer (MTSegNet), for 3D mesh semantic segmentation, which effectively learns manifold information. By using hierarchical Transformers, MTSegNet can capture both local and global features of 3D meshes, while reducing the computational complexity and memory consumption. To further improve the performance of our method, we design an effective input-generating algorithm that serializes input data into multiple sequences of tokens that represent the geometry and topology of 3D meshes. This algorithm preserves the structural information and spatial relations of 3D meshes, while enabling the use of standard Transformer architectures. The proposed method is evaluated on four benchmark datasets: PSB, COSEG, ShapeNetCore, and HumanBody, and it achieves state-of-the-art results on all datasets, outperforming the previous methods.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102440"},"PeriodicalIF":1.3,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143894411","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

Efficient worst-case topology optimization of self-supporting structures for additive manufacturing 增材制造自支撑结构的高效最坏情况拓扑优化

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-04-22 DOI: 10.1016/j.cagd.2025.102441

Nan Zheng, Xiaoya Zhai, Falai Chen

{"title":"Efficient worst-case topology optimization of self-supporting structures for additive manufacturing","authors":"Nan Zheng, Xiaoya Zhai, Falai Chen","doi":"10.1016/j.cagd.2025.102441","DOIUrl":"10.1016/j.cagd.2025.102441","url":null,"abstract":"<div><div>In worst-case topology optimization, uncertain loads can result in complex internal structures and intricate printed details that challenge manufacturability. However, the impact of these features on manufacturing performance is often overlooked, potentially compromising the printability and quality of the final product in additive manufacturing (AM). This paper introduces a novel approach for generating 3D self-supporting structures under worst-case topology optimization. The proposed framework utilizes an implicit tensor-product B-spline (ITPBS) representation, directly adopting its coefficients as design variables to minimize compliance while enforcing self-supporting constraints and minimal length scale. By reformulating AM constraints, we analytically derive a single geometric fabrication constraint that simultaneously addresses both overhang regions and the dripping effect. The solid-void boundary representation provided by ITPBS enables seamless integration of fabrication constraints into the worst-case optimization process. Worst-case compliance is evaluated by solving an eigenvalue problem, and sensitivity analysis is conducted using the adjoint variable method. Numerical experiments demonstrate that the proposed approach effectively produces self-supporting structures across various models.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102441"},"PeriodicalIF":1.3,"publicationDate":"2025-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143868338","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

On the triple-parameter least squares progressive iterative approximation and its convergence analysis 三参数最小二乘渐进迭代逼近及其收敛性分析

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-04-17 DOI: 10.1016/j.cagd.2025.102439

Nian-Ci Wu , Chengzhi Liu , Juncheng Li

{"title":"On the triple-parameter least squares progressive iterative approximation and its convergence analysis","authors":"Nian-Ci Wu , Chengzhi Liu , Juncheng Li","doi":"10.1016/j.cagd.2025.102439","DOIUrl":"10.1016/j.cagd.2025.102439","url":null,"abstract":"<div><div>In the domain of large-scale data fitting, the least squares progressive iterative approximation (LSPIA) method, introduced by <span><span>Deng and Lin (2014)</span></span>, stands as a prominent figure in geometric iterative techniques due to its simplicity and effectiveness. Herein, we incorporate a triple-parameter modification to fine-tune the control points, hereby denoted as the TLSPIA method. Opting for a suitable parameter within the TLSPIA framework reverts it to the traditional LSPIA and its variant, such as PmLSPIA proposed by <span><span>Liu et al. (2024)</span></span>. Through singular value decomposition of the collocation matrix, we derive closed forms for the error sequences generated by the LSPIA, PmLSPIA, and TLSPIA methods, demonstrating that these sequences exhibit linear decrease and diverge in their convergence rates across different subspaces corresponding to any right singular vector of the collocation matrix. Empirical numerical examples are provided to substantiate our theoretical claims, highlighting the practical viability and efficacy of the proposed algorithm.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102439"},"PeriodicalIF":1.3,"publicationDate":"2025-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143860258","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

ESA-GS: Elongation splitting and assimilation in Gaussian splatting for accurate surface reconstruction ESA-GS：用于精确表面重建的高斯溅射中的伸长分裂和同化

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-04-17 DOI: 10.1016/j.cagd.2025.102434

Yuyang Chen, Wenming Wu, Yusheng Peng, Yue Fei, Liping Zheng

引用次数: 0

Topology guaranteed and error controlled curve tracing for parametric surface-surface intersection 参数曲面相交的拓扑保证和误差控制曲线跟踪

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-04-11 DOI: 10.1016/j.cagd.2025.102432

Bingwei Zhang , Jin-San Cheng , Yu-Shen Liu , Zhaoqi Zhang

引用次数: 0