Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
162 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

A de Casteljau Algorithm for Bernstein type Polynomials based on (p,q)-integers (1507.04110v4)

Published 15 Jul 2015 in cs.GR

Abstract: In this paper, a de Casteljau algorithm to compute (p,q)-Bernstein Bezier curves based on (p,q)-integers is introduced. We study the nature of degree elevation and degree reduction for (p,q)-Bezier Bernstein functions. The new curves have some properties similar to q-Bezier curves. Moreover, we construct the corresponding tensor product surfaces over the rectangular domain (u, v) \in [0, 1] \times [0, 1] depending on four parameters. We also study the de Casteljau algorithm and degree evaluation properties of the surfaces for these generalization over the rectangular domain. Furthermore, some fundamental properties for (p,q)-Bernstein Bezier curves are discussed. We get q-Bezier curves and surfaces for (u, v) \in [0, 1] \times [0, 1] when we set the parameter p1 = p2 = 1.

Citations (21)

Summary

We haven't generated a summary for this paper yet.