Calculating Exact Area of Ruled Surface: Accuracy and Procedure

Click For Summary
Calculating the exact area of a ruled surface involves connecting points on two curves and forming triangles to approximate the area. By integrating the areas of these triangles, one can derive the total area, with accuracy depending on how small the base of the triangles is made. If the base is sufficiently small, the calculation becomes exact; otherwise, it remains an approximation. The discussion also touches on using parametric functions and Riemann sums to transition from discrete sums to integrals. The method assumes no intersections between the connecting line segments, which is crucial for accurate area calculation.
Moo Of Doom
Messages
365
Reaction score
1
I've been trying to figure out how to calculate the exact area of a ruled surface. I think I've come to a solution that works, but I'm not sure it's totally accurate. The procedure is as follows:

Consider two curves. A ruled surface is constructed by connecting each point on one curve to a corresponding point on the other curve. Now, taking a point on curve 1 (a), the corresponding point on curve 2 (b), and another point on curve 1 arbitrarily close to the first point (c), we form a triangle. Also, by taking another point on curve 2 close to point b (d), we can form triangle bcd. Adding the areas of abc and bcd, we have one element of area. Integrating these areas, you get the whole area.

The question is, is this exact, or just an approximation?
 
Physics news on Phys.org
Depends on how small u are making that base of the triangle. If u are making it very small, then it should be exact otherwise it would be an approximation. (Your method corresponds very close to how computers generate surfaces on computer)

-- AI
 
I'm not sure what you mean by taking a point that is arbitrarily close. Here is one way to carry out your program.

Partition one of the lines with points \{a_n\} and the other line with points \{b_n\}, where b_n is the point associated with a_n. Take the sum of the areas of the triangles formed by the points a_1, b_1, a_2 and by b_1, a_2, b_2, etc. to the end of the lines. Note that, in general, such sums are approximations to the area because, the sides of the triangles are straight lines, but the surface may be curved. Take the limit of such sums as the distance between the points in each partition goes to zero. The limit will be the exact area.
 
Thanks. Just what I wanted to know.

:)
 
Let's say you have two parametric functions (represented via positional vectors) \vec r_1 \left( t \right) and \vec r_2 \left( t \right), continuous \forall t \in \left( {a,b} \right) , where t is your parameter. Now, you connect \vec r_1 \left( t \right) and \vec r_2 \left( t \right) via line segments corresponding to equivalent parameter values --- i.e., connect point \vec r_1 \left( t \right) to \vec r_2 \left( t \right) (corresponding to equivalent t's) for all t's from t=a to t=b. What I do below is just divide the (a,b) interval into smaller units of just {\Delta t}.
*Then, by Moo of Doom's method, the area would be:
\frac{1}<br /> {2}\mathop {\lim }\limits_{\Delta t \to 0^+} \sum\limits_{n = 0}^{2\left( {\frac{{b - a}}<br /> {{\Delta t}}} \right) - 1} {\left\{ {\left[ {\vec r_1 \left( {a + A_n \Delta t} \right) - \vec r_2 \left( {a + B_n \Delta t} \right)} \right] \times \left[ {\vec r_1 \left( {a + B_n \Delta t} \right) - \vec r_2 \left( {a + C_n \Delta t} \right)} \right]} \right\}}
where
\left\{ \begin{gathered}<br /> A_n = \frac{{\left( { - 1} \right)^n + 2n - 1}}<br /> {4} \hfill \\<br /> B_n = \frac{{ - \left( { - 1} \right)^n + 2n + 1}}<br /> {4} \hfill \\<br /> C_n = \frac{{\left( { - 1} \right)^n + 2n + 3}}<br /> {4} \hfill \\ <br /> \end{gathered} \right\}
However, this method assumes no intersections of the line segments connecting \vec r_1 \left( t \right) and \vec r_2 \left( t \right) vectors.
My question is: How would this Riemann sum be converted into an integral?
 
Last edited:
There are probably loads of proofs of this online, but I do not want to cheat. Here is my attempt: Convexity says that $$f(\lambda a + (1-\lambda)b) \leq \lambda f(a) + (1-\lambda) f(b)$$ $$f(b + \lambda(a-b)) \leq f(b) + \lambda (f(a) - f(b))$$ We know from the intermediate value theorem that there exists a ##c \in (b,a)## such that $$\frac{f(a) - f(b)}{a-b} = f'(c).$$ Hence $$f(b + \lambda(a-b)) \leq f(b) + \lambda (a - b) f'(c))$$ $$\frac{f(b + \lambda(a-b)) - f(b)}{\lambda(a-b)}...

Similar threads

  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 3 ·
Replies
3
Views
3K
  • · Replies 24 ·
Replies
24
Views
4K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 13 ·
Replies
13
Views
2K