.png){kind=icon}
.png){kind=icon}
Return
Subdivision depth for triangular surfaces
.png){kind=icon}
OA
AI
DOI：10.1016/j.aej.2016.02.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The aim of this attempt was to present an efficient algorithm for the evaluation of error bound of triangular subdivision surfaces. The error estimation technique is based on first order difference and this process is independent of parametrization. This technique can be easily generalized to higher arity triangular surfaces. The estimated error bound is expressed in-terms of initial control point sequence and constants. Here, we efficiently estimate error bound between triangular surface and its control polygon after k-fold subdivision and further extended to evaluate subdivision depth of the scheme. (C) 2016 Faculty of Engineering, Alexandria University. Production and hosting by Elsevier B.V. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
Keywords:
Subdivision surfaces
Control polygon
B-spline
Triangular surface
Error bound
Subdivision depth
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.8
Papers:
6.3K
Citations:
2.6W
Organization
View more organizations