@Article{NMTMA-10-4,
author = {},
title = {Evaluation Algorithm of PHT-Spline Surfaces},
journal = {Numerical Mathematics: Theory, Methods and Applications},
year = {2017},
volume = {10},
number = {4},
pages = {760--774},
abstract = {<p style="text-align: justify;">PHT-splines are a type of polynomial splines over hierarchical T-meshes which posses perfect local refinement property. This property makes PHT-splines useful in geometric modeling and iso-geometric analysis. Current implementation of PHT-splines stores the basis functions in Bézier forms, which saves some computational costs but consumes a lot of memories. In this paper, we propose a de Boor like algorithm to evaluate PHT-splines provided that only the information about the control coefficients and the hierarchical mesh structure is given. The basic idea is to represent a PHT-spline locally in a tensor product B-spline, and then apply the de-Boor algorithm to evaluate the PHT-spline at a certain parameter pair. We perform analysis about computational complexity and memory costs. The results show that our algorithm takes about the same order of computational costs while requires much less amount of memory compared with the Bézier representations. We give an example to illustrate the effectiveness of our algorithm.</p>},
issn = {2079-7338},
doi = {https://doi.org/10.4208/nmtma.2017.0003},
url = {https://global-sci.com/article/90521/evaluation-algorithm-of-pht-spline-surfaces}
}