An official website of the United States government
Abstract Isogeometric analysis (IGA) is a computational technique that integrates computer-aided design (CAD) with finite element analysis (FEA) by employing the same basis functions for both geometry representation and solution approximation. While IGA offers numerous advantages, such as improved accuracy and efficiency, it also presents several challenges related to geometric modeling. Some of these challenges include accurately representing complex geometries with NURBS (Non-Uniform Rational B-Splines) or other basis functions used in IGA and generating high-quality meshes that conform to the complex geometry represented by NURBS curves/surfaces. This paper introduces an analytical framework to provide a more efficient and theoretically grounded method for generating curvilinear configurations and its analytical solution in IGA, bridging the gap between generated data and its physical representations. This innovative approach is distinguished by integrating the NURBS parameterization in curve generation and providing a corresponding framework to achieve a broader and more accurate explanation of meshes and properties, especially constructing new coordinates and calculating the physical displacements under these conditions. Our model enables the analytical understanding of complex curves from the UIUC airfoil and superformula datasets, demonstrating a deeper dive into simulations. This study signifies a pivotal juncture wherein machine-learning-based complex geometrical formulations are synergistically combined with actual isogeometric analysis.
more »
« less
This content will become publicly available on March 1, 2026
NURBS-OT: An Advanced Model for Generative Curve Modeling
Abstract This paper presents NURBS-OT (non-uniform rational B-splines—optimal transport), a new approach in the field of computer graphics and computer-aided design (CAD)/computer-aided manufacturing (CAM) for modeling complex free-form designs like aerodynamic and hydrodynamic structures, traditionally shaped by parametric curves such as Bézier, B-spline, and NURBS. Unlike prior models that used generative adversarial networks (GANs) involving large and complex parameter sets, our approach leverages a much lighter (0.37M versus 5.05M of BézierGAN), theoretically robust method by blending optimal transport with NURBS. This integration facilitates a more efficient generation of curvilinear designs. The efficacy of NURBS-OT has been validated through extensive testing on the University of Illinois Urbana-Champaign (UIUC) airfoil and superformula datasets, where it showed enhanced performance on various metrics. This demonstrates its ability to produce precise, realistic, and esthetically coherent designs, marking a significant advancement by merging classical geometrical techniques with modern deep learning.
more »
« less
- Award ID(s):
- 2245299
- PAR ID:
- 10593468
- Publisher / Repository:
- The American Society of Mechanical Engineers
- Date Published:
- Journal Name:
- Journal of Mechanical Design
- Volume:
- 147
- Issue:
- 3
- ISSN:
- 1050-0472
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Abstract Optimal transport (OT) methods seek a transformation map (or plan) between two probability measures, such that the transformation has the minimum transportation cost. Such a minimum transport cost, with a certain power transform, is called the Wasserstein distance. Recently, OT methods have drawn great attention in statistics, machine learning, and computer science, especially in deep generative neural networks. Despite its broad applications, the estimation of high‐dimensional Wasserstein distances is a well‐known challenging problem owing to the curse‐of‐dimensionality. There are some cutting‐edge projection‐based techniques that tackle high‐dimensional OT problems. Three major approaches of such techniques are introduced, respectively, the slicing approach, the iterative projection approach, and the projection robust OT approach. Open challenges are discussed at the end of the review. This article is categorized under:Statistical and Graphical Methods of Data Analysis > Dimension ReductionStatistical Learning and Exploratory Methods of the Data Sciences > Manifold Learningmore » « less
-
null (Ed.)In this paper, we present Super-OT, a novel approach to computational lineage tracing that combines a supervised learning framework with optimal transport based on Generative Adver-sarial Networks (GANs). Unlike previous ap-proaches to lineage tracing, Super-OT has the flexibility to integrate paired data. We bench-mark Super-OT based on single-cell RNA-seq data against Waddington-OT, a popular approach for lineage tracing that also employs optimal trans-port. We show that Super-OT achieves gains overWaddington-OT in predicting the class outcome of cells during differentiation, since it allows the inte-gration of additional information during training.more » « less
-
Distributional data have become increasingly prominent in modern signal processing, highlighting the necessity of computing optimal transport (OT) maps across multiple probability distributions. Nevertheless, recent studies on neural OT methods predominantly focused on the efficient computation of a single map between two distributions. To address this challenge, we introduce a novel approach to learning transport maps for new empirical distributions. Specifically, we employ the transformer architecture to produce embeddings from distributional data of varying length; these embeddings are then fed into a hypernetwork to generate neural OT maps. Various numerical experiments were conducted to validate the embeddings and the generated OT maps.more » « less
-
Abstract Optimal transport (OT) is a versatile framework for comparing probability measures, with many applications to statistics, machine learning and applied mathematics. However, OT distances suffer from computational and statistical scalability issues to high dimensions, which motivated the study of regularized OT methods like slicing, smoothing and entropic penalty. This work establishes a unified framework for deriving limit distributions of empirical regularized OT distances, semiparametric efficiency of the plug-in empirical estimator and bootstrap consistency. We apply the unified framework to provide a comprehensive statistical treatment of (i) average- and max-sliced $$p$$-Wasserstein distances, for which several gaps in existing literature are closed; (ii) smooth distances with compactly supported kernels, the analysis of which is motivated by computational considerations; and (iii) entropic OT, for which our method generalizes existing limit distribution results and establishes, for the first time, efficiency and bootstrap consistency. While our focus is on these three regularized OT distances as applications, the flexibility of the proposed framework renders it applicable to broad classes of functionals beyond these examples.more » « less
