{"title":"Geometric Modeling of Umbrella Surfaces","authors":"Takuya Terahara, Soma Nishikawa, Ayame Suzuki, Kenji Takizawa, Takashi Maekawa","doi":"10.1016/j.cad.2024.103750","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103750","url":null,"abstract":"<div><p>In this study, we present a novel method for modeling the canopy surface of an umbrella. Our approach involves representing the area between the ribs on the canopy as a trimmed bilinear patch. Furthermore, we conduct an in-depth exploration of various differential geometric properties of the umbrella surface. We introduce a method for unfolding the canopy surface onto a plane, which serves as a valuable technique for fabricating a cardboard template to accurately cut canopy fabrics. To validate the effectiveness of our geometric modeling method, we apply it to several umbrella models, showcasing its practical application and benefits.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010448524000770/pdfft?md5=4f2bf7c788fd927b1bf2816ac001742b&pid=1-s2.0-S0010448524000770-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141485948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Diverse part synthesis for 3D shape creation","authors":"Yanran Guan, Oliver van Kaick","doi":"10.1016/j.cad.2024.103746","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103746","url":null,"abstract":"<div><p>Methods that use neural networks for synthesizing 3D shapes in the form of a part-based representation have been introduced over the last few years. These methods represent shapes as a graph or hierarchy of parts and enable a variety of applications such as shape sampling and reconstruction. However, current methods do not allow easily regenerating individual shape parts according to user preferences. In this paper, we investigate techniques that allow the user to generate multiple, diverse suggestions for individual parts. Specifically, we experiment with multimodal deep generative models that allow sampling diverse suggestions for shape parts and focus on models which have not been considered in previous work on shape synthesis. To provide a comparative study of these techniques, we introduce a method for synthesizing 3D shapes in a part-based representation and evaluate all the part suggestion techniques within this synthesis method. In our method, which is inspired by previous work, shapes are represented as a set of parts in the form of implicit functions which are then positioned in space to form the final shape. Synthesis in this representation is enabled by a neural network architecture based on an implicit decoder and a spatial transformer. We compare the various multimodal generative models by evaluating their performance in generating part suggestions. Our contribution is to show with qualitative and quantitative evaluations which of the new techniques for multimodal part generation perform the best and that a synthesis method based on the top-performing techniques allows the user to more finely control the parts that are generated in the 3D shapes while maintaining high shape fidelity when reconstructing shapes.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0010448524000733/pdfft?md5=a1e183fb452ad690557cdc8b0a32b007&pid=1-s2.0-S0010448524000733-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141485951","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Coupling Physics Model for Real-Time 4D Simulation of Cardiac Electromechanics","authors":"Rui Chen, Jiahao Cui, Shuai Li, Aimin Hao","doi":"10.1016/j.cad.2024.103747","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103747","url":null,"abstract":"<div><p>Cardiac simulators can assist in the diagnosis of heart disease and enhance human understanding of this leading cause of mortality. The coupling of multiphysics, such as electrophysiology and active–passive mechanics, in the simulation of the heart poses challenges in utilizing existing methodologies for real-time applications. The low efficiency of physically-based simulation is mostly caused by the need for electrical-stress conduction to use tiny time steps in order to prevent numerical instability. Additionally, the mechanical simulation experiences sluggish convergence when dealing with significant deformation and stiffness, and there are also concerns regarding volume inversion. We provide a coupling physics model that transforms the active–passive dynamics into multiphysics solving constraints, aiming at boosting the real-time efficiency of the cardiac electromechanical simulation. The multiphysics processes are initially divided into two levels: cell-level electrical stimulation and organ-level electrical-stress diffusion/conduction. This separation is achieved by employing operator splitting in combination with the quasi-steady-state method, which simplifies the system equations. Next, utilizing spatial discretization, we employ the matrix-free conjugate gradient approach to solve the electromechanical model, therefore improving the efficiency of the simulation. The experimental results illustrate that our simulation model is capable of replicating intricate cardiac physiological phenomena, including 3D spiral waves and rhythmic contractions. Moreover, our model achieves a significant advancement in real-time computation while maintaining a comparable level of accuracy to current methods. This improvement is advantageous for interactive medical applications.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141485950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Learning Topological Operations on Meshes with Application to Block Decomposition of Polygons","authors":"A. Narayanan , Y. Pan , P.-O. Persson","doi":"10.1016/j.cad.2024.103744","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103744","url":null,"abstract":"<div><p>We present a learning based framework for mesh quality improvement on unstructured triangular and quadrilateral meshes. Our model learns to improve mesh quality according to a prescribed objective function purely via self-play reinforcement learning with no prior heuristics. The actions performed on the mesh are standard local and global element operations. The goal is to minimize the deviation of the node degrees from their ideal values, which in the case of interior vertices leads to a minimization of irregular nodes.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S001044852400071X/pdfft?md5=e8e3f2e334d413856691a3d4408592ca&pid=1-s2.0-S001044852400071X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141434643","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Topology Optimization of Self-supporting Structures for Additive Manufacturing via Implicit B-spline Representations","authors":"Nan Zheng , Xiaoya Zhai , Jingchao Jiang , Falai Chen","doi":"10.1016/j.cad.2024.103745","DOIUrl":"10.1016/j.cad.2024.103745","url":null,"abstract":"<div><p>Owing to the rapid development in additive manufacturing, the potential to fabricate intricate structures has become a reality, emphasizing the importance of designing structures conducive to additive manufacturing processes. A crucial consideration is the ability to design structures requiring no additional support during manufacturing. This paper employs implicit B-spline representations for self-supporting structure design by integrating a topology optimization model with self-supporting constraints derived analytically from the implicit representation. This analytical derivation for detecting overhang regions enables accurate and efficient calculation of constraints, outperforming other B-spline-based methods. Compared to the traditional voxel-based methods, the implicit B-spline representation significantly expedites the optimization process by reducing the number of design variables. Additionally, several acceleration techniques are implemented to enhance the efficiency of our method, allowing simulations of 3D models with millions of finite elements to be completed within one and half an hour, excelling other B-spline-based methods and voxel-based methods. Various numerical experiments validate its excellent performance, confirming the effectiveness and efficiency of the proposed algorithm.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-06-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141389789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Qiong Pan , Xiaoya Zhai , Hongmei Kang , Xiaoxiao Du , Falai Chen
{"title":"Isogeometric Topology Optimization of Multi-patch Shell Structures","authors":"Qiong Pan , Xiaoya Zhai , Hongmei Kang , Xiaoxiao Du , Falai Chen","doi":"10.1016/j.cad.2024.103733","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103733","url":null,"abstract":"<div><p>Shell structures refer to structural elements that derive strength and load-bearing capacity from their thin and curved geometry. In practical applications, shell structures are commonly composed of multiple patches to represent intricate and diverse architectural configurations faithfully. Nevertheless, the design of multi-patch shell structures holds considerable promise. However, most of the previous work is devoted to the numerical analysis of multi-patch shell structures without further optimization design. The work proposes an inverse design framework, specifically focusing on multi-patch configurations based on Reissner–Mindlin theory. First, reparameterization and global refinement operations are employed on the provided multi-patch shell structures. Renumbering the indices of control points with shared degrees of freedom at the interface naturally ensures <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>0</mn></mrow></msup></math></span>-<strong>continuity</strong> between patches. Subsequently, this study investigates the amalgamation of Isogeometric Analysis (IGA) and the Solid Isotropic Material with Penalization (SIMP) method for topology optimization of shell structures. The proposed approach is validated through numerical examples, emphasizing its capacity to enhance multi-patch shell structure design, showcasing robustness and efficiency.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141314312","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Novel Polynomial-Time Algorithm for Automatic Layout of Branching Cables in a Fixed Topology","authors":"Liyun Xiao , Tian-Ming Bu , Jiangtao Wang","doi":"10.1016/j.cad.2024.103736","DOIUrl":"10.1016/j.cad.2024.103736","url":null,"abstract":"<div><p>Designing the layout for complex electromechanical products involves the challenging task of automatically laying out cables. This challenge is particularly pronounced in the case of branch cables, which are more intricate due to their multiple connection terminals and branches. This paper presents a polynomial-time wiring algorithm based on dynamic programming to determine branching point locations in the layout design of cables, given the electrical definition of the wire harness. The method considers various engineering constraints, including obstacle avoidance, wall adherence, minimum bend radius, and gray areas. To validate our method, we implemented a branch cable auto-layout system through secondary development based on the UG platform. The experimental results indicate the effectiveness of our approach, demonstrating promising performance in terms of time and high-quality layouts. This showcases its potential for practical application in cable layout design for complex electromechanical systems.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-06-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141409361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Synchronous integration method of mechatronic system design, geometric design, and simulation based on SysML","authors":"Chu Changyong , Zhang Chunjia , Yin Chengfang","doi":"10.1016/j.cad.2024.103735","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103735","url":null,"abstract":"<div><p>The benefits of integrated design using the Model Based System Engineering (MBSE) approach in the design process of mechatronic systems have gradually become apparent. The automatic generation of simulation models and geometric models based on System Modeling Languages (SysML) models enables system engineers to swiftly analyze and simulate system performance, visually depict design outcomes, and expedite the product development process. Due to the current system modeling's lack of model integration and geometric design functions, this paper proposes an integrated design and simulation method for mechatronic systems that can carry out complete model synchronization and verification, rapid geometric solution generation, and visual representation. Furthermore, a corresponding model synchronization integration framework is established. This framework primarily encompasses system de-sign, system simulation, and geometric design, with its model integration method being model transformation and model synchronization. The paper concludes with an example of the design process of a quadruped robot to validate the framework and its supported methods, providing a reference for other system design and integration endeavors.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141290455","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Meta-Meshing and Triangulating Lattice Structures at a Large Scale","authors":"Qiang Zou, Yunzhu Gao, Guoyue Luo, Sifan Chen","doi":"10.1016/j.cad.2024.103732","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103732","url":null,"abstract":"<div><p>Lattice structures have been widely used in applications due to their superior mechanical properties. To fabricate such structures, a geometric processing step called triangulation is often employed to transform them into the STL format before sending them to 3D printers. Because lattice structures tend to have high geometric complexity, this step usually generates a large amount of triangles, a memory and compute-intensive task. This problem manifests itself clearly through large-scale lattice structures that have millions or billions of struts. To address this problem, this paper proposes to transform a lattice structure into an intermediate model called meta-mesh before undergoing real triangulation. Compared to triangular meshes, meta-meshes are very lightweight and much less compute-demanding. The meta-mesh can also work as a base mesh reusable for conveniently and efficiently triangulating lattice structures with arbitrary resolutions. A CPU+GPU asynchronous meta-meshing pipeline has been developed to efficiently generate meta-meshes from lattice structures. It shifts from the thread-centric GPU algorithm design paradigm commonly used in CAD to the recent warp-centric design paradigm to achieve high performance. This is achieved by a new data compression method, a GPU cache-aware data structure, and a workload-balanced scheduling method that can significantly reduce memory divergence and branch divergence. Experimenting with various billion-scale lattice structures, the proposed method is seen to be two orders of magnitude faster than previously achievable.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141263840","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xingyu Ni , Xuwen Chen , Cheng yu , Bin Wang , Baoquan Chen
{"title":"Simulating Thin Shells by Bicubic Hermite Elements","authors":"Xingyu Ni , Xuwen Chen , Cheng yu , Bin Wang , Baoquan Chen","doi":"10.1016/j.cad.2024.103734","DOIUrl":"https://doi.org/10.1016/j.cad.2024.103734","url":null,"abstract":"<div><p>In this study, we present the bicubic Hermite element method (BHEM), a new computational framework devised for the elastodynamic simulation of thin-shell structures. The BHEM is constructed based on quadrilateral Hermite patches, which serve as a unified representation for shell geometry, simulation, collision avoidance, as well as rendering. Compared with the commonly utilized linear FEM, the BHEM offers higher-order solution spaces, enabling the capture of more intricate and smoother geometries while employing significantly fewer finite elements. In comparison to other high-order methods, the BHEM achieves conforming <span><math><msup><mrow><mi>C</mi></mrow><mrow><mn>1</mn></mrow></msup></math></span> continuity for Kirchhoff–Love (KL) shells with minimal complexity. Furthermore, by leveraging the subdivision and convex hull properties of Hermite patches, we develop an efficient algorithm for ray-patch intersections, facilitating collision handling in simulations and ray tracing in rendering. This eliminates the need for laborious remodeling of the pre-existing surface as the conventional approaches do. We substantiate our claims with comprehensive experiments, which demonstrate the high accuracy and versatility of the proposed method.</p></div>","PeriodicalId":50632,"journal":{"name":"Computer-Aided Design","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141263839","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}