I What Does the F Matrix Look Like for a Linear Bezier Curve?

bobtedbob
Messages
1
Reaction score
0
TL;DR Summary
Rational linear parametric curve and its implicit
form that is a projected image of the algebraic curve
I'm looking at the following web page which looks at rendering bezier curves.

GPU Gems 3 - Chapter 25
Paper on same topic

The mathematics is quite interesting, I was interested to know what the F matrix would look like for for a linear bezier equation. The maths for the quadratic case is in the paper (2nd link) section 3 claim 1. I understand how the M matrix is calculated (and its inverse) but I don't understand how the F matrix was created.

Can someone help explain the F matrix creation process and how it would apply to the linear bezier case?

[Moderator's note: approved.]
 
Last edited by a moderator:
Physics news on Phys.org
In paper (2nd link) section 3 claim 1, the matrix F is a permutation matrix. This matrix F has the given form because the vector ##v=[1\,\, t\,\, t^2]## was rewritten as ##u=[t \,\,t^2\,\, 1]##. This is represented by the matrix F, which is the identity matrix, rewritten with colluns in different order.

It is not clear to me what you mean with the linear bezier case. Is this case? You can find some results on Bézier curves on SearchOnMath that can helps you.
 
Last edited:
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top