An efficient bivariate basis for triangular patch modeling

Journal article


Authors/Editors


Strategic Research Themes

No matching items found.


Publication Details

Author listDejdumrong N.

PublisherAmerican Scientific Publishers

Publication year2013

JournalAdvanced Science Letters (1936-6612)

Volume number19

Issue number5

Start page1500

End page1505

Number of pages6

ISSN1936-6612

eISSN1936-7317

URLhttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84876885796&doi=10.1166%2fasl.2013.4464&partnerID=40&md5=ef59d21485f6e57db6154951733e8b62

LanguagesEnglish-Great Britain (EN-GB)


View on publisher site


Abstract

A new bivariate basis for triangular patches is expressed by recurrence formulae. This patch can be constructed by a recursive formula that is proven to be the most efficient algorithm compared to any existing triangular surface models. Extended from the author's univariate blending functions, evaluating a point on the basis's curve can be efficiently calculated in linear computations by either its iterative or recursive algorithms. The computational time for this surface's recursive algorithm is of quadratic complexity, 0(n2). Several essential geometric properties for the curves and tensor-product surfaces using this basis are identified, for example, the boundary point interpolation, the affine invariance, the partition of unity, the convex hull properties, and the symmetry. Moreover, the transformations between the B้zier triangular patches and the proposed surfaces can be performed using the monomial form approach. Finally, the degree elevation formula is derived. ฉ 2013 American Scientific Publishers All rights reserved. All rights reserved.


Keywords

Conversion formulaeRecurrence formulaeRecursive algorithmTriangular B้zier surface


Last updated on 2023-28-09 at 07:35