Código QR

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

Descrición completa

Gardado en:
Detalles Bibliográficos
Principais autores: Tao Song, Huanyu Liao, Ganesh Subbarayan
Formato: Artigo
Idioma:Inglês
Publicado: MDPI AG 2022-07-01
Series:Algorithms
Assuntos:
Acceso en liña:https://www.mdpi.com/1999-4893/15/7/245
Tags: Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!