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”

Fast algorithms for intersection of non-matching grids using Plucker coordinates

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24220%2F17%3A00004144" target="_blank" >RIV/46747885:24220/17:00004144 - isvavai.cz</a>

  • Alternative codes found

    RIV/46747885:24620/17:00004144

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Fast algorithms for intersection of non-matching grids using Plucker coordinates

  • Original language description

    The XFEM and Mortar methods can be used in combination with non-matching or nonconforming grids to deal with problems on complex geometries. However the information about the mesh intersection must be provided. We present algorithms for intersections between 1d and 2d unstructured multi component simplicial meshes and their intersections with a background unstructured 3d mesh. A common algorithm based on the advancing front technique is used for the efficient selection of candidate pairs among simplicial elements. Bounding interval hierarchy (BIH) of axes aligned bounding boxes (AABB) of elements is used to initialize the front tracking algorithm. The family of element intersection algorithms is built upon a line-triangle intersection algorithm based on the Plucker coordinates. These algorithms combined with the advancing front technique can reuse the results of calculations performed on the neighboring elements and reduce the number of arithmetic operations. Barycentric coordinates on each of the intersecting elements are provided for every intersection point. Benchmarks of the element intersection algorithms are presented and three variants of the global intersection algorithm are compared on the meshes raising from hydrogeological applications.

  • 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/ED0005%2F01%2F01" target="_blank" >ED0005/01/01: Centre for nanomaterials, advanced technologies and innovation</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2017

  • 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

    Computers and Mathematics with Applications

  • ISSN

    0898-1221

  • e-ISSN

  • Volume of the periodical

    74

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    GB - UNITED KINGDOM

  • Number of pages

    14

  • Pages from-to

    174-187

  • UT code for WoS article

    000403633600014

  • EID of the result in the Scopus database

    2-s2.0-85013756271