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

Kód výsledku v 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>

Nalezeny alternativní kódy

RIV/46747885:24620/17:00004144

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10102 - Applied mathematics

Projekt

<a href="/cs/project/ED0005%2F01%2F01" target="_blank" >ED0005/01/01: Centrum pro nanomateriály, pokrocilé technologie a inovace</a><br>

Návaznosti

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

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název periodika

Computers and Mathematics with Applications

ISSN

0898-1221

e-ISSN

—

Svazek periodika

74

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

GB - Spojené království Velké Británie a Severního Irska

Počet stran výsledku

14

Strana od-do

174-187

Kód UT WoS článku

000403633600014

EID výsledku v databázi Scopus

2-s2.0-85013756271