Tangent plane to a surface, no need for cross product?

d86
Messages
3
Reaction score
0
For tangent plane equation
z-z0 = f{x}(x0,y0)(x-x0) + f{y}(x0,y0)(y-y0)

how come there is no cross product of the partial derivatives f{x} X f{y} to give the normal vector for the plane?
 
Physics news on Phys.org
d86 said:
For tangent plane equation
z-z0 = f{x}(x0,y0)(x-x0) + f{y}(x0,y0)(y-y0)

how come there is no cross product of the partial derivatives f{x} X f{y} to give the normal vector for the plane?

The cross product is already built in. If you parametrize the surface as x = x, y = y, z = f(x,y) you have the parameterization

R(x,y) = < x, y, f(x,y)>

Then Rx = < 1, 0, fx>
Ry = <0, 1, fy>

n = Rx X Ry= <-fx, -fy, 1> or you can change the signs <fx, fy, -1>.

Using that normal and the point (x0,y0,z0> gives you the same equation you have.
 
i see
so as long as the slopes of two intersecting lines are known, the plane they are on can be defined that way w/o going through the cross product?
 
d86 said:
i see
so as long as the slopes of two intersecting lines are known, the plane they are on can be defined that way w/o going through the cross product?

In 3D we don't talk about "slopes", only directions. But I don't see what you are getting at with this comment. You would get the normal by crossing the two direction vectors.
 
i just got confused by why the equation looked different from the regular plane equation. i see that it's the same thing now. the book does refer to f_{x} and f_{y} as slopes tho.
 
d86 said:
i just got confused by why the equation looked different from the regular plane equation. i see that it's the same thing now. the book does refer to f_{x} and f_{y} as slopes tho.

Yes. The partials represent the slope of a two variable function where you hold the other variable constant. They are sometimes called "the slope in the x or y direction". Still, for a general straight line in 3-space, you wouldn't use the term slope.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...

Similar threads

Back
Top