\(h\)-refinement method for toric parameterization of planar multi-sided computational domain in isogeometric analysis (Q2127695)

This article is devoted to multi-sided surface patches, particularly to toric surface patches, which constitute a generalization of the classical rational Bézier surface, and were introduced in [\textit{R. Krasauskas}, Adv. Comput. Math. 17, No. 1--2, 89--113 (2002; Zbl 0997.65027)]. Toric surface patches are defined over arbitrary polygonal domains which are the convex hull of a set of integer lattice points. Thus, they enjoy a nature-endowed advantage in geometric modeling of polygonal regions. In this article, the authors present a subdivision algorithm for toric surface patches. Since rational Bézier surface patches are compatible with computer-aided design (CAD) systems, after subdivision, a computational domain parameterized by toric surface patches can be compatible with CAD systems. The latter is convenient to perform analysis and processing, and so it yields a new path to the refinement of toric surface patches in isogeometric analysis (IGA). This refinement procedure follows two steps: first, subdivide the given toric surface patch (which is the parameterization of a planar multi-sided computational domain) into several rational tensor product Bézier surface patches. Then the classical non-uniform rational B-spline (NURBS) knot insertion algorithm is used on each rational Bézier surface patch. The main contributions of the paper are summarized in the following: \begin{itemize} \item[--] An improved subdivision algorithm of toric surface patches which is convenient for application in geometric modeling is proposed. \item[--] The improved subdivision algorithm is introduced into the partition of the planar multi-sided computational domain in IGA. \item[--] A new refinement scheme of IGA with planar multi-sided toric surface patches is proposed by combining the new computational domain partition method and the classical NURBS knot insertion algorithm. \end{itemize}