Isogeometric analysis has brought a paradigm shift in integrating computational simulations with geometric designs across engineering disciplines. This technique necessitates analysis-suitable parameterization of physical domains to fully harness the synergy between Computer-Aided Design and Computer-Aided Engineering analyses. Existing methods often fix boundary parameters, leading to challenges in elongated geometries such as fluid channels and tubular reactors. This paper presents an innovative solution for the boundary parameter matching problem, specifically designed for analysis-suitable parameterizations. We employ a sophisticated Schwarz–Christoffel mapping technique, which is instrumental in computing boundary correspondences. A refined boundary curve reparameterization process complements this. Our dual-strategy approach maintains the geometric exactness and continuity of input physical domains, overcoming limitations often encountered with the existing reparameterization techniques. By employing our proposed boundary parameter matching method, we show that even a simple linear interpolation approach can effectively construct a satisfactory analysis-suitable parameterization. Our methodology offers significant improvements over traditional practices, enabling the generation of analysis-suitable and geometrically precise models, which is crucial for ensuring accurate simulation results. Numerical experiments show the capacity of the proposed method to enhance the quality and reliability of isogeometric analysis workflows.

@en

Isogeometric analysis is an innovative numerical paradigm with the potential to bridge the gap between Computer-Aided Design and Computer-Aided Engineering. However, constructing analysis-suitable parameterizations from a given boundary representation remains a critical challenge in the isogeometric design-through-analysis pipeline, particularly for computational domains with complex geometries, such as high-genus cases. To tackle this issue, we propose a multi-patch parameterization method for computational domains grounded in the singular structure of cross-fields. Initially, the vector field functions over the computational domain are solved using the boundary element method. The cross-field is then obtained through the one-to-one mapping between the vector field and the cross-field. Subsequently, we acquire the position information and topological connection relations of singularities and streamlines by analyzing the singular structure of the cross-field. Moreover, we introduce a simple and effective method for computing streamlines. We propose a novel segmentation strategy to divide the computational domain into several quadrilateral NURBS sub-patches. Once the multi-patch structure is established, we develop two methods to construct analysis-suitable multi-patch parameterizations. The first method is a direct generalization of the barrier function-based approach, while the second method yields smoother parameterizations by incorporating the interface control points of sub-patches into the optimization model. Numerical experiments demonstrate the effectiveness and robustness of the proposed method.@en

Cubic Bézier curves are widely used in computer graphics and geometric modeling, favored for their intuitive design and ease of implementation. However, self-intersections within these curves can pose significant challenges in both geometric modeling and analysis. This paper presents a comprehensive approach to detecting and computing self-intersections of cubic Bézier curves. We introduce an efficient algorithm that leverages both the geometric properties of Bézier curves and numerical methods to accurately identify intersection points. The self-intersection problem of cubic Bézier curves is firstly transformed into a quadratic problem by eliminating trivial solutions. Subsequently, this quadratic system is converted into a linear system that may be easily analyzed and solved. Finally, the parameter values corresponding to the self-intersection points are computed through the solution of the linear system. The proposed method is designed to be robust and computationally efficient, making it suitable for real-time applications.@en

Bézier and B-spline curves are foundational tools for curve representation in computer graphics and computer-aided geometric design, with their intersection computation presenting a fundamental challenge in geometric modeling. This study introduces an innovative algorithm that quickly and effectively resolves intersections between Bézier and B-spline curves. The number of intersections between the two input curves within a specified region is initially determined by applying the resultant of a polynomial system and Sturm’s theorem. Subsequently, the potential region of the intersection is established through the utilization of the pseudo-curvature-based subdivision scheme and the bounding box detection technique. The projected Gauss-Newton method is ultimately employed to efficiently converge to the intersection. The robustness and efficiency of the proposed algorithm are demonstrated through numerical experiments, demonstrating a speedup of 3 to 150 times over traditional methods@en

The Geometry-Independent Field approximaTion (GIFT) technique, an extension of isogeometric analysis (IGA), allows for separate spaces to parameterize the computational domain and approximate solution field. Based on the GIFT approach, this paper proposes a novel IGA methodology that incorporates toric surface patches for multi-sided geometry representation, while utilizing B-spline or truncated hierarchical B-spline (THB-spline) basis for analysis. By creating an appropriate bijection between the parametric domains of distinct bases for modeling and approximation, our method ensures smoothness within the computational domain and combines the compact support of B-splines or the local refinement potential of THB-splines, resulting in more efficient and precise solutions. To enhance the quality of parameterization and consequently boost the accuracy of downstream analysis, we suggest optimizing the composite toric parameterization. Numerical examples validate the effectiveness and superiority of our suggested approach.

@en

Constructing an analysis-suitable parameterization for the computational domain from its boundary representation plays a crucial role in the isogeometric design-through-analysis pipeline. PDE-based elliptic grid generation is an effective method for generating high-quality parameterizations with rapid convergence properties for the planar case. However, it may generate non-uniform grid lines, especially near the concave/convex parts of the boundary. In the present work, we introduce a novel scaled discretization of harmonic mappings in the Sobolev space H¹ to remit it. Analytical Jacobian matrices for the involved nonlinear equations are derived to accelerate the computation. To enhance the numerical stability and the speed of convergence, we propose a simple and yet effective preconditioned Anderson acceleration framework instead of using computationally expensive Newton-type iteration. Three preconditioning strategies are suggested, namely diagonal Jacobian, block-diagonal Jacobian, and full Jacobian. Furthermore, we discuss a delayed update strategy of the preconditioner, i.e., the preconditioner is updated every few steps to reduce the computational cost per iteration. Numerical experiments demonstrate the effectiveness and efficiency of our improved parameterization approach and the computational efficiency of our preconditioned Anderson acceleration scheme.

@en

NURBS method is the standard mathematical method for describing the shapes of curves/surfaces/volumes, and it is extensively used in computer-aided design, computer-aided manufacturing, and computer graphics. The injectivity of NURBS volumes means that they do not have self-intersections. Since the injectivity of parameterizations depend on the signs of their Jacobian functions, and the Jacobian of a NURBS volume is determined by the determinant of its tangent vectors in three directions, we first propose a method to compute the bounding vectors of the tangent cones of NURBS volume in this paper. Then the sufficient condition for the injectivity of NURBS volume is proposed. A checking algorithm is also presented. Some examples are given to verify the effectiveness of the algorithm.

@en

Toric surface patches are a class of multi-sided surface patches that can represent multi-sided domains without mesh degeneration. In this paper, we propose an improved subdivision algorithm for toric surface patches, which subdivides an N-sided toric surface patch into N rational tensor product Bézier surface patches. By the proposed subdivision algorithm, a C ^k-continuous spline surface composed of piecewise toric surface patches is subdivided into a set of rational tensor product Bézier surface patches with G ^k-continuity. Additionally, after subdivision, toric surface patches are compatible with CAD systems. Combining the subdivision algorithm with the classical knot insertion algorithm of non-uniform rational B-splines, we develop a novel h-refinement scheme for isogeometric analysis with planar toric parameterizations. Several numerical examples are given to demonstrate the effectiveness and numerical stability of the presented method.

@en

In isogeometric analysis, constructing bijective and low-distorted parameterizations is a fundamental task. Compared with the planar problem, the volumetric case is more challenging in both robustness and efficiency. In this paper, we present a robust and efficient volumetric parameterization method based on the idea of penalty functions and the Jacobian regularization technique. The proposed method does not require an already bijective initialization and thus avoids an extra foldover elimination step. The main contributions of this work lie in three aspects. First, a new objective function that characterizes the volume distortion is established using the Divergence Theorem. Second, we employ a novel penalty function for the Jacobian regularization. The full analytical gradient of the objective function is also deduced to enhance the numerical stability in gradient-based optimization. Third, we develop a reduced numerical integration strategy to accelerate the new algorithm. Several numerical examples demonstrate that our method significantly outperforms the current competitive approaches both in terms of robustness and efficiency.

@en

Localized and anisotropic features extensively exist in various physical phenomena. The present work focuses on the r-adaptive parameterization technique for isogeometric analysis (IGA), which aims to acquire higher numerical accuracy while keeping the degrees of freedom constant. The principal feature is utilizing the so-called absolute principal curvature of the IGA solution surfaces to characterize numerical errors instead of posteriori error estimations, which establishes the relation between analysis results and geometric quantity. The bijectivity is a fundamental requirement for analysis-suitable parameterization. With the cooperation of a minor regularization and common line search criteria, the proposed method guarantees the bijectivity of the resulting parameterizations. The bi-level approach with two refinement levels of the same geometry is employed: a coarse level (design model) to update the parameterization and a fine level (analysis model) to perform the isogeometric simulation. Moreover, we develop several detailed algorithms for explaining the sensitivity propagation from the design model to the analysis model and analytically computing the sensitivity, which allows accurate calculation of sensitivity and enhances the robustness during a gradient-based optimization. Several examples and comparisons are presented to demonstrate the effectiveness and efficiency of the proposed method. As an application, we apply the proposed method to a two-dimensional linear heat transfer problem with a moving Gaussian heat source, which is a simplified model for the additive manufacturing application. The proposed r-adaptive technique effectively captures the thermal history of the problem.

@en