Changes

Jump to navigation Jump to search
1 byte added ,  05:55, January 13, 2010
m
Line 50: Line 50:     
But how useful is such a technique, since it is so easy to think of regions which are NOT rectangles?  Let's move on to consider a more general kind of region.
 
But how useful is such a technique, since it is so easy to think of regions which are NOT rectangles?  Let's move on to consider a more general kind of region.
−
[[Image:Dub int 1.jpg|right|thumb|250px|The kind of image under discussion.]]
+
[[Image:Dub int 1.jpg|right|thumb|250px|The kind of region under discussion.]]
 
Suppose a region ''R'' happens to be such that we can identify its lowest extreme ''x'' value, which we'll call ''a'', and its highest ''x'' value, which we'll call ''b'', and that a vertical line drawn through the region intersects the boundary in exactly two points everywhere except those extremes, where a vertical line only intersects that boundary once.  Then there is some function of ''x'' which will give the ''y'' value of the lower of all of those intersections of the boundary with vertical lines, and some some function which will give the ''y'' value of the upper of those intersections.  Let's call these functions <math>y_1, y_2 </math> respectively.  See the illustration to the right.
 
Suppose a region ''R'' happens to be such that we can identify its lowest extreme ''x'' value, which we'll call ''a'', and its highest ''x'' value, which we'll call ''b'', and that a vertical line drawn through the region intersects the boundary in exactly two points everywhere except those extremes, where a vertical line only intersects that boundary once.  Then there is some function of ''x'' which will give the ''y'' value of the lower of all of those intersections of the boundary with vertical lines, and some some function which will give the ''y'' value of the upper of those intersections.  Let's call these functions <math>y_1, y_2 </math> respectively.  See the illustration to the right.
  
3,552

edits

Navigation menu