Skip to main content
    • Aa
    • Aa

Evaluation Algorithm of PHT-Spline Surfaces

  • Zhihua Wang (a1) (a2), Falai Chen (a1) and Jiansong Deng (a1)

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.

Corresponding author
*Corresponding author. Email address: (F. L. Chen)
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

Numerical Mathematics: Theory, Methods and Applications
  • ISSN: 1004-8979
  • EISSN: 2079-7338
  • URL: /core/journals/numerical-mathematics-theory-methods-and-applications
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 1
Total number of PDF views: 9 *
Loading metrics...

Abstract views

Total abstract views: 13 *
Loading metrics...

* Views captured on Cambridge Core between 12th September 2017 - 21st September 2017. This data will be updated every 24 hours.