Efficient Local Refinement near Parametric Boundaries Using kd-Tree Data Structure and Algebraic Level Sets
Sign Up to like & getrecommendations! Published in 2022 at "Algorithms"
DOI: 10.3390/a15070245
Abstract: 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… read more here.
Keywords: tree data; refinement; local refinement; refinement near ... See more keywords