Efficient Local Refinement near Parametric Boundaries Using kd-Tree Data Structure and Algebraic Level Sets

In analysis of problems with parametric spline boundaries that are immersed or inserted into an underlying domain, the discretization on the underlying domain usually does not conform to the inserted boundaries. While the fixed underlying discretization is of great convenience as the immersed bounda...

Полное описание

Библиографические подробности

Главные авторы:	Tao Song, Huanyu Liao, Ganesh Subbarayan
Формат:	Artigo
Язык:	Inglês
Опубликовано:	MDPI AG 2022-07-01
Серии:	Algorithms
Предметы:	immersed boundary analysis Non-Uniform Rational B-splines kd-tree data structure adaptive quadrature algebraic level sets
Online-ссылка:	https://www.mdpi.com/1999-4893/15/7/245
Метки:	Добавить метку Нет меток, Требуется 1-ая метка записи!