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

Detail-preserving shape completion of point cloud models with articulated structure 具有关节结构的点云模型的保细节形状补全

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-05-20 DOI: 10.1016/j.cagd.2025.102456

Yi Quan , Chen Li , Yang Li , Changbo Wang , Hong Qin

{"title":"Detail-preserving shape completion of point cloud models with articulated structure","authors":"Yi Quan , Chen Li , Yang Li , Changbo Wang , Hong Qin","doi":"10.1016/j.cagd.2025.102456","DOIUrl":"10.1016/j.cagd.2025.102456","url":null,"abstract":"<div><div>This paper advocates a novel deep-learning-based method for point cloud completion of multi-categorical articulated objects sharing the same topology. One popular approach for point cloud completion is to rely on a generic encoder-decoder architecture, where the feature maps of input are extracted with the critical set, which essentially consists of a set of points that play critical roles in the max-pooled features. But this pipeline has difficulties in retaining the local details, especially for arbitrary deformable, articulated objects of various categories, bringing category confused completion. In this paper, we propose a detail-preserving point cloud completion method for the complex articulated models by extracting features guided by their articulation topology with a fixed-order scheme, so as to accommodate both fine-grained categorical appearance and non-rigid deformation. First, we construct key subsets, which preserve both local, category-aware and global, non-rigid deformation features simultaneously for input sharing similar point densities, guided by a set of regressed key points approximating articulations. Second, we organize the key subsets with a fixed-order scheme during feature extraction to combat the possible interference due to diverse data component permutations during feature extraction, while upholding the algorithmic efficiency. Finally, we confirm in our evaluations that the new method completes general articulated point clouds with detailed categorical characteristics in high quality. We also show that after training on synthetic data, our method can be applied to real scan or web downloaded point clouds with similar point densities. Meanwhile, we built an Quadruped Point Cloud Completion (QPCC) dataset upon which new research topics could be further explored in geometry modeling and computer graphics.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"120 ","pages":"Article 102456"},"PeriodicalIF":1.3,"publicationDate":"2025-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"144116509","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 analysis via multi-modal contrastive learning 基于多模态对比学习的三维形状分析

IF 1.3 4区计算机科学

Computer Aided Geometric Design Pub Date : 2025-05-02 DOI: 10.1016/j.cagd.2025.102454

Zhenyu Shu , Xufei Sun , Chaoyi Pang

引用次数: 0

A dynamic arrangement framework for automatic tooth alignment based on orthodontic rules 基于正畸规则的牙齿自动对齐动态排列框架

IF 1.3 4区计算机科学

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

Yeying Fan , Guangshun Wei , Weijie Liu , Chuanxiang Yang , Chuanyun Fu , Wenping Wang , Yuanfeng Zhou

{"title":"A dynamic arrangement framework for automatic tooth alignment based on orthodontic rules","authors":"Yeying Fan , Guangshun Wei , Weijie Liu , Chuanxiang Yang , Chuanyun Fu , Wenping Wang , Yuanfeng Zhou","doi":"10.1016/j.cagd.2025.102436","DOIUrl":"10.1016/j.cagd.2025.102436","url":null,"abstract":"<div><div>Automatically achieving functionally and aesthetically aligned teeth is a critical task in computer-aided orthodontic treatment. However, existing expert rule-based approaches still require manual intervention and focus solely on occlusion functionality. Meanwhile, data-driven methods rely on large paired datasets of pre- and post-treatment cases, making it challenging to address issues such as missing teeth or collisions effectively. To alleviate these problems, this paper proposes a novel framework <em>DyOrthoAlign</em> that translates the automatic tooth alignment into a dynamic arrangement process based on orthodontic rules. Our <em>DyOrthoAlign</em> consists of two stages. We first construct the ideal dental occlusion curve based on tooth anatomical features. Then, we arrange each tooth along the ideal occlusion curve in a specific order and a series of decisions. The dynamic arrangement process continues until all the teeth are arranged, resulting in the final ideal tooth arrangement. Extensive qualitative and quantitative experiments validate our framework can produce ideal tooth alignment and offer significant practical value for personalized and efficient orthodontic treatment.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102436"},"PeriodicalIF":1.3,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899298","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

Projection-driven grid-BSP tree for real-time trimming on GPU 投影驱动的网格- bsp树在GPU上的实时修剪

IF 1.3 4区计算机科学

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

Jiaming Zhu , Yang Lu , Ruicheng Xiong , Cong Chen , Ligang Liu

{"title":"Projection-driven grid-BSP tree for real-time trimming on GPU","authors":"Jiaming Zhu , Yang Lu , Ruicheng Xiong , Cong Chen , Ligang Liu","doi":"10.1016/j.cagd.2025.102451","DOIUrl":"10.1016/j.cagd.2025.102451","url":null,"abstract":"<div><div>In Computer Aided Design (CAD), trimmed non-uniform rational B-spline (NURBS) is the industrial standard to represent the shapes of models. Trimming, the process of removing unnecessary portions of a surface, remains a major performance bottleneck in the recent CAD model rendering methods based on real-time surface tessellation. In this paper, we identify the core reasons for the inefficiency in existing real-time trimming methods, and present a new trimming method that incurs nearly no cost in the state-of-the-art NURBS surface rendering pipeline. Our approach begins with building a projection-driven grid-bsp-tree with a fixed depth of two and leaf nodes containing only one single curve segment, effectively minimizing the overall cost of tree traversal and ray-curve intersections. Additionally, we reduce the cost of trimming tests by approximating trimming curves into poly-lines while keeping the storage consumption at a minimum, where the quality of the approximation is measured by a novel on-surface error metric. Compared with existing works, our method achieves consistent error control for across the entire model using a more reasonable error metric while requiring less memory. Compared to the previous kd-tree-based method, our method achieves a 70% speedup, reducing the trimming process to just 5% of the total rendering time, effectively eliminating it as a major performance bottleneck. Due to its superior performance, our method provides significant advantages for rendering large-scale CAD models.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102451"},"PeriodicalIF":1.3,"publicationDate":"2025-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143899299","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 the intersection of two ellipsoids based on a fast algebraic topology determination strategy 基于快速代数拓扑确定策略的两个椭球相交计算

IF 1.3 4区计算机科学

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

Xiao Chu , Kai Li , Xiaohong Jia , Jieyin Yang , Jiarui Kang

{"title":"Computing the intersection of two ellipsoids based on a fast algebraic topology determination strategy","authors":"Xiao Chu , Kai Li , Xiaohong Jia , Jieyin Yang , Jiarui Kang","doi":"10.1016/j.cagd.2025.102442","DOIUrl":"10.1016/j.cagd.2025.102442","url":null,"abstract":"<div><div>Ellipsoids serve as the most commonly used geometric primitives and bounding volumes in computer-aided design and computer graphics, where an efficient and topologically stable intersection algorithm between two ellipsoids is highly required. Although there has been extensive research on intersections of two general quadrics, ellipsoids have their own specialty in both algebra and geometry which guides to new possibilities to break the bottleneck in intersection computation. In this paper, we use a topology-determination-based strategy in computing the intersection of ellipsoids. Firstly, the topology of the intersection curve is quickly determined using some algebraic discriminants without computing any point on the intersection curve; then an octree strategy is applied to efficiently compute at least one point on each intersection branch; finally, by tracing the branch, we get the complete intersection loci. Plenty of examples show that our algorithm is topologically stable when facing challenging cases including multi-branches, small loops, singular or tangent intersections, and is more efficient compared with existing algorithms.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102442"},"PeriodicalIF":1.3,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143904465","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

Physics and geometry-augmented neural implicit surfaces for rigid bodies 刚体的物理和几何增强神经隐式曲面

IF 1.3 4区计算机科学

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

Yuanmu Xu , Guanli Hou , Jiangbei Hu , Tenglong Ren , Xiaokun Wang , Yalan Zhang , Xiaojuan Ban , Chen Qian , Fei Hou , Ying He

{"title":"Physics and geometry-augmented neural implicit surfaces for rigid bodies","authors":"Yuanmu Xu , Guanli Hou , Jiangbei Hu , Tenglong Ren , Xiaokun Wang , Yalan Zhang , Xiaojuan Ban , Chen Qian , Fei Hou , Ying He","doi":"10.1016/j.cagd.2025.102437","DOIUrl":"10.1016/j.cagd.2025.102437","url":null,"abstract":"<div><div>This paper tackles the challenges of physics-based simulation of rigid bodies in neural rendering, with a focus on 3D model representation and collision handling. We propose Physics and Geometry-Augmented Neural Implicit Surfaces (PGA-NeuS), a novel approach that combines neural implicit surfaces with a differentiable physics solver. In the pre-processing stage, PGA-NeuS reconstructs static scene and object geometry from multi-view images using signed distance fields (SDFs). For dynamic scenes captured in monocular videos, these SDFs, along with the initial position and orientation of moving rigid bodies, are fed into a differentiable rigid body solver to optimize physical parameters, such as initial velocity and friction coefficients. Subsequently, PGA-NeuS leverages color loss, physics loss, and object mask supervision to iteratively refine the neural implicit surface, ensuring the target object's alignment with the predicted motion sequence. We evaluate PGA-NeuS on five real-world scenes, demonstrating its ability to accurately reconstruct realistic motion sequences and estimate physical parameters such as position and velocity. Dataset and source code are available at <span><span>https://github.com/Raining00/PGA-NeuS</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":55226,"journal":{"name":"Computer Aided Geometric Design","volume":"119 ","pages":"Article 102437"},"PeriodicalIF":1.3,"publicationDate":"2025-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143916611","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

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