All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Planar multi-patch domain parameterization for isogeometric analysis based on evolution of fat skeleton

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F21%3A43962278" target="_blank" >RIV/49777513:23520/21:43962278 - isvavai.cz</a>

  • Result on the web

    <a href="https://www.sciencedirect.com/science/article/pii/S0045782521003765" target="_blank" >https://www.sciencedirect.com/science/article/pii/S0045782521003765</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.cma.2021.114045" target="_blank" >10.1016/j.cma.2021.114045</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Planar multi-patch domain parameterization for isogeometric analysis based on evolution of fat skeleton

  • Original language description

    In this paper, we propose a new algorithm for computing planar multi-patch domain parameterizations which are suitable for consequent numerical computations based on isogeometric analysis. Firstly, a so-called fat skeleton of the given domain, represented by a multi-patch NURBS parameterization, is constructed, which determines the topology of a multi-patch NURBS parameterization suitable for the given domain. Then, we formulate an evolution process which successively transforms the initial shape represented by the fat skeleton to the target shape represented by the given domain. Moreover, a multi-patch optimization is applied in every time iteration to make the multi-patch NURBS parameterization as uniform and orthogonal as possible. The method is constructed such that it is fully automatic and it solves the biggest problems of the domain parameterization problem, i.e., it automatically determines a suitable topology of a multi-patch NURBS parameterization for the given domain and it also automatically solves the boundary correspondence problem. The functionality of the proposed method is demonstrated on several examples.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10102 - Applied mathematics

Result continuities

  • Project

    <a href="/en/project/GA19-04006S" target="_blank" >GA19-04006S: Modern geometric-numerical methods in simulation of incompressible turbulent flow for large-scale real-world problems</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    Computer Methods in Applied Mechanics and Engineering

  • ISSN

    0045-7825

  • e-ISSN

  • Volume of the periodical

    385

  • Issue of the periodical within the volume

    November 2021

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    31

  • Pages from-to

  • UT code for WoS article

    000691789700009

  • EID of the result in the Scopus database

    2-s2.0-85111283441