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
Онлайн хандалт:	https://www.mdpi.com/1999-4893/15/7/245
Шошгууд:	Шошго нэмэх Шошго байхгүй, Энэхүү баримтыг шошголох эхний хүн болох!