Abstract:
In a method for classifying line segment arrangements. A first line segment has endpoints A and B and a second line segment has endpoints C and D. A first triangle is traced along endpoints ABC, a second triangle is traced along endpoints ABD, a third triangle is traced along endpoints CDA, and a fourth triangle is traced along endpoints CDB. The signed areas of each of the four triangles are determined from the coordinates of the triangles. The arrangement of the line segments is classified according to the signed areas.

Description:
FIELD OF THE INVENTION 
     The present invention relates generally to a processor-based technique in the field of computational geometry for use in computer graphics and related applications, and more particularly, to techniques for classifying the arrangements of adjacent line segments. 
     BACKGROUND OF THE INVENTION 
     Advanced computer graphics technologies have been applied to a wide variety of practical fields such as industrial design, aerospace, consumer electronics, telecommunications, entertainment, and medicine, to name but a few. Important and basic functions of most types of computer-implemented graphics applications are the modeling and visualization of, and the interaction with, represented real-world or imaginary objects. These functions require robust and computationally efficient processes for manipulating the data structures that represent the objects. 
     For example, numerous medical interventions involve placing a needle, drill, surgical instrument, or other device in the body. In some cases the angle and position of the device with respect to specific body structures is of critical importance, for example in the drilling of a hole for a screw along the axis of a spinal pedicle. In other cases, it is primarily the relative positioning of the instrument in organs which is important, for example, placing a catherization tool in the heart or arteries. 
     In all of these applications, computer graphics are extensively used, and many of these problems can be modeled in two dimensions (2D) as arrangements of line segments in a plane. The line segments are visualized as pixels on a display device. For example, the outline of the heart chambers and major arteries can be represented as poly-lines, i.e., connected sets of many small line segments. In another example, geographical features contained in maps in geographical information systems may be represented as line segments in a plane. 
     Fundamental to the functions of interacting with, and the visual display of objects modeled as arrangements of line segments, is the problem of finding and correctly identifying their relative position, for example, do the lines intersect. The line segment intersection problem is also one of the fundamental problems of computational geometry that has received considerable attention. 
     In a typical prior art formulation of the problem, two line segments are given, and the task is to identify whether the lines intersect each other. Depending on the specification of the problem, two line segments can be considered intersecting when the two lines share a single coordinate point P(x, y) in Euclidean space. Visually this is easy to discern, but computationally this is a relatively difficult task. 
     For a first line segment defined by end points (x 1 ,y 1 ) and (x 2 ,y 2 ), and a second line segment (x 3 ,y 3 ) and (x 4 ,y 4 ), the common method used to determine if the two line segments intersect includes three major steps. 
     First, intersect the two line segments as if they were infinite lines using the formulation: 
     
       
         x=(b 1 *c 2 −b 2 *c 2 )/(a 1 *b 2 −a 2 *b 1 ), 
       
     
     and 
     
       
         y=(c 1 *a 2 −c 2 *a 1 )/(a 1 *b 2 −a 2 *b 1 ), 
       
     
     where 
     
       
         a 1 =y 2 −y 1 , a 2 =y 4 −y 3 , b 1 =x 1 −x 2 , b 2 =x 3 −x 4 , 
       
     
     
       
         c 1 =(x 2  * y 2 )−(x 1  * y 2 ), c 2 =(x 4  * y 3 )−(x 3 −y 4 ). 
       
     
     Second, check whether the intersection point P(x, y) belongs to the first line segment: 
     
       
         x 1 &lt;=x&lt;=x 4 , y 1 &lt;=y&lt;=y 4  or (if x 2 &lt;x 1  or y 2 &lt;y 1 ) 
       
     
     
       
         x 2 &lt;=x&lt;=x 1 , y 2 &lt;=y&lt;=y 1 . 
       
     
     Third, check whether the intersection point P(x, y) belongs to the second line segment: 
     
       
         x 3 &lt;=x&lt;=x 4 , y 3 &lt;=y&lt;=y 4  or (if x 4 &lt;x 3  or y 4 &lt;y 3 ) 
       
     
     
       
         x 4 &lt;=x&lt;=x 3 , y 4 &lt;=y&lt;=y 3 . 
       
     
     If both conations are true, then coordinate P(x, y) is shared by both line segments, and is their intersection point. 
     Obviously, this method requires a large number of arithmetic and logical computational steps to determine P(x, y), particularly multiple divisions. This is true even in the case where the lines do not intersect. In addition, the computations need to be performed with real numbers that require substantial computer resources, such as floating-point logic units. The computational costs increase when there are a large number of line segments to be checked. If a significant number of line segments do not intersect, then time and resources are wasted. 
     It is possible to filter out some non-intersecting line segments using a method described by Berg et al. in “Computational Geometry: Algorithms and Applications,” Springer-Verlag, pp.21-22, 1997. In that method, the pair of line segments is projected onto the X and Y axes. If their projection does not overlap, then the lines cannot intersect. However, this is only a necessary, and not a sufficient condition. Projected line segments can overlap without intersecting. 
     Chazelle et al. in “An optimal algorithm for intersecting line segments in the plane,” Journal of the ACM, v. 39 , pp. 1-54, 1992 describe how to identify the intersection of many line segments. Their goal could be formulated as follows. Given a set S of n line segments in a plane, report all intersection points among the line segments S. Their major concern is to organize a search among analyzed segments, and not to miss any intersections without having to intersect every pair of line segments, or to intersect segments more than once. 
     It is desired to provide a method for determining the intersection of two line segments that represent both necessary and sufficient conditions. In addition, it is desired that this method can be performed without using floating-point computational resources in a minimal number of computational steps. Furthermore, it is desired to determine, in a more general sense, not only intersection, but other relative positions of line segments with respect to each other. 
     SUMMARY OF THE INVENTION 
     In a method for classifying line segment arrangements. A first line segment has endpoints A and B and a second line segment has endpoints C and D. A first triangle is traced along endpoints ABC, a second triangle is traced along endpoints ABD, a third triangle is traced along endpoints CDA, and a fourth triangle is traced along endpoints CDB. 
     The signed areas for each of the four triangles are determined from the coordinates of the triangles. Based on the sign and the areas of the triangles, a classification is made about the arrangement of the line segments. 
     Only if the sign of the first and second triangle are the different, and the sign of the third and fourth triangles are different, then the two line segments fully intersect each other. Furthermore, in the case that the lines intersect, the computed areas can be used to determine the exact point of intersection. 
     It can also be determined if the lines semi-intersect, i.e., one of the lines ends exactly at the other line. Other information can also be determined, for example, do the lines form a comer, do the lines overlap, or are the lines aligned along the same axis without overlap. All of these conditions are encountered on a frequent basis in many modem computational geometry applications. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a diagram of two intersecting line segments with contours of walking the endpoints of the segments; 
     FIG. 2 is a diagram of two non-intersecting line segments with contours; 
     FIG. 3 is a diagram of four contours for two intersecting lines; 
     FIGS. 4 a - 4   i  illustrate other arrangements of line segments; 
     FIG. 5 is a diagram of two line intersecting at a point P(x, y); and 
     FIG. 6 is a flow diagram of a process for determining line segment intersection according to the invention. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     Line Segments Defined 
     FIG. 1 illustrates two non-zero length line segments  110  and  120  in a Euclidean plane. For clarity, the line segments are drawn with dashed lines. Each line segment is specified by a data item that indicates a pair of coordinate values for each of the line&#39;s endpoints  111 - 112  and  121 — 121  in the plane, using a conventional coordinate system. A line segment endpoint, such as endpoint  111 , and an intersection between a pair of line segments, such as intersections  130  are each called a “vertex.” 
     With the line segments according to my invention, the coordinates of the vertices are stored in the data items, not as real numbers, but as integer values. Because my line segments represent outlines of real or imaginary objects in a graphical system, the integer values correspond to pixels in an image plane, and line segments themselves are displayed as a row of fully connected pixels. 
     My invention determines how two line segments are arranged with respect to each other without completely solving for the coordinates of the various points of interest on the lines, therefore taking fewer computational steps than known solutions of the prior art. For example, my method can classify an an arrangement of two line segments as fully intersecting, semi-intersecting, non-intersecting, overlapping, forming a corner, and so forth. These conditions are important to classify for a broad range of complex graphical object where the possible arrangements of tens of thousands of line segments may need to be considered during a visualization or modeling process. 
     As an advantage, my invention can use integer computational elements which are more efficient than floating-point units. Also, the integer values of the associated pixels can be stored in fewer bits. My invention represents the necessary and sufficient conditions for full intersection of line segments without resorting to floating-point calculations. Thus, in the case where segments do not intersect, the expense of computing the coordinates of possible points of intersection is not incurred. As a by-product, my method can classify line segments as having other useful conditions. 
     Walking the Endpoints 
     My invention is based on topological properties of contours generated by “walking” the endpoints of two line segments. By walking, I mean tracing an outline from one endpoint to another. For convenience of this description, I label the endpoints of the first line segment A and B, and the endpoints of the second line segment C and D. 
     If the two line segments should intersect, the two endpoints C and D of the second segment must lie on opposite sides of the first line segment AB, and endpoints A and B must lie on opposite side of the second line segment CD. 
     I define contours by “walking ” the endpoints of the line segments AB and CD. The first contour is CDBC  140 , and the second contour is CDAC  150 . Two additional contours (ABCA and ABDA) are traced by beginning at endpoint A. 
     For my invention to work, the order of walking is important. For each contour I begin at the same endpoint of one of the two line segments, and walk to the other end. When reaching the far end, I visit first one endpoint of the other line segment for the first contour, and then visit the other endpoint for the second contour before returning to my starting point. I repeat this walk for the second line. 
     Significantly, for the arrangement of the lines as shown in FIG. 1, i.e., fully intersecting, the first contour is traced in a counter-clockwise direction, and the second contour is traced in a clockwise direction. This is my necessary and sufficient condition for the line segments to intersect. 
     Non-Intersection 
     As shown in FIG. 2 for two non-intersecting line segments, the two contours  201  and  202  are in the same direction because both endpoints lie on the same side of the other line segment. Topologically, the change in direction for the walk is the necessary and sufficient condition for the line segment intersection. 
     The problems that remain are: how to determine the direction of a particular contour; and how to account for possible degenerate cases which could arise at an intersection of the two line segments, or other possible arrangements, such as, overlap, and comers. 
     Determining the Direction of a Walking Contour 
     Geometrically, each of the four traced contours essentially form a triangle. Note, in some interesting arrangements, e.g., semi-intersection, overlap, and comers, some or all of the triangles can be “flat,” that is with zero area. However, importantly, even “zero” area triangles have a direction in which they are walked. 
     I determine the “direction” or orientation of the triangle by computing the sign of an area of the triangle. It is well known that there are many ways to compute the areas of triangles, I prefer one that is computationally efficient and based on the coordinates of the vertices of the triangle as described in “Graphics Gems,” Vol. IV, Academic Press, p. 4, 1994. 
     For an arbitrary triangle ABC, define the coordinates of vertex A as (x 1 , y 1 ), vertex B as (x 2 , y 2 ), and vertex C as (x 3 , y 3 ), and vertex D as (x 4 , y 4 ). Then, the signed area S of triangle ABC is: 
     
       
         S= 0 . 5 *(x 1 *(y 2 −y 3 )+x 2 *(y 3 −y 1 )+x 3 *(y 1 −y 2 )). 
       
     
     Note that this calculation does not require a division. Now, initially, I am only interested in the sign of the area, the magnitude is not of an immediate concern. Therefore, the above formulation can be reduced to: 
     
       
         S=x 1 *(y 2 −y 3 )+x 2 *(y 3 −y 1 )+x 3 *(y 1 −y 2 ). 
       
     
     Depending upon the ordering of the vertices, S has either a negative or positive sign, which suits my purpose. 
     General Case for Full Intersection 
     By full intersection, I mean that the line segments completely cross each other. Semi-intersection occurs when one line ends or “buts” at another line segment, and to form a corner, two segments touch only at their endpoints. 
     These special conditions I describe below. 
     As shown in FIG. 3, for line segments AB and CD there are four traced contours respectively having signed areas: 
     
       
         s 1 =ABC, s 2 =ABD, s 3 =CDA, s 4 =CDB. 
       
     
     To have intersection, it is necessary and sufficient to have two conditions: 
     
       
         s 1 *s 2 &lt;0 and s 3 *s 4 &lt;0. 
       
     
     That is, the signs of the areas defined by the first pair of contours are different and the signs of the areas defined by the second pair of contours are different. Taking the products of the first and second pairs is a convenient way to make this determination. 
     The method according to my invention can determine whether or not two lines fully intersect without solving for the actual point of intersection. As an advantage, my method requires fewer and simpler computational steps using only integer arithmetic. 
     Other Arrangements 
     FIGS. 4 a - 4   h  show other possible cases. For FIGS. 4 a - 4   b , there are four contours: 
     
       
         s 1 =ABC, s 2 =ABD, s 3 =CDA, s 4 =CDB 
       
     
     with a non-intersecting geometrical situation of: 
     
       
         s 1 *s 2 &lt;0, s 3 *s 4 &gt;0, and 
       
     
     a semi-intersection geometrical situation of: 
     
       
         s 1 *s 2 &lt;0, s 3 *s 4 =0. 
       
     
     For FIGS. 4 c - 4   d , the four contours for the non-intersection geometrical situation yields: 
     
       
         s 1 *s 2 &lt;0, s 3 *s 4 &gt;0, and 
       
     
     a semi-intersection geometrical situation of: 
     
       
         s 1 *s 2 &lt;0, s 3 *s 4 =0 . 
       
     
     For FIGS. 4 e - 4   f , the four contours for the non-intersection geometrical situation yield: 
     
       
         s 1 *s 2 &gt;0, s 3 *s 4 &lt;0, and 
       
     
     a semi-intersection geometrical situation of: 
      s 1 *s 2 =0, s 3 *s 4 &lt;0. 
     For FIGS. 4 g - 4   h , the four contours for the non-intersection geometrical situation yield: 
     
       
         s 1 *s 2 &gt;0, s 3 *s 4 &lt;0, and 
       
     
     a semi-intersection geometrical situation of: 
     
       
         s 1 *s 2 =0, s 3 *s 4 &lt;0. 
       
     
     Note, for non-intersection, the signs of both of the pairs are always different. For the semi-intersection, the signs of the areas defined by one pair of contours are different and the areas of one of the other pair of contours is zero. Therefore, my method can also differentiate full from semi-intersections. In the case of a corner as shown in FIG. 4 i , each pair has one triangle of zero area. It should now be apparent, that for overlapping line segments all of the triangles have zero area. 
     Determining the Coordinates of the Intersection Point 
     My method for calculating the signs of areas defined by walking contours in particular order can also be used to determine the point of intersection P(x,y), should one exist. FIG. 5 shows two intersecting line segments AB and CD. The segments intersect at the P(x,y). To find the location of this point, I use the ratio of the area of triangles ABC=s 1  and ABD=s 2  and the coordinates of the end point C(x 3 , y 3 ) and D(x 4 , y 4 ). Denote PD as d and PC as c. Then, the following ratio holds true: 
     
       
         s 1 /s 2 =c/d. 
       
     
     Consequently, the coordinates (x, y) of intersection point P can be calculated by:          x   =       |   s2   |       *   x3     +     |   s1   |     *   x4         |   s1   |     +     |   s2   |             ,     y   =       |   s2   |       *   y3     +     |   s1   |     *   y4         |   s1   |     +     |   s2   |                                    
     The same formulae could be rewritten for s 3  and s 4  and parts a and b of line segment AB with end point A(x 1 , y 1 ) and end point B(x 2 , y 2 ) as:          x   =       |   s4   |       *   x1     +     |   s3   |     *   x2         |   s3   |     +     |   s4   |             ,     y   =       |   s4   |       *   y1     +     |   s3   |     *   y2         |   s3   |     +     |   s4   |                                    
     Note, the values s 1 , s 2 , s 3 , and s 4  are already known from above, and the remaining values are simply the coordinates of the endpoints of the lines. 
     As shown in FIG. 6, a process for classifying the arrangement of two line segments according to the invention includes the following steps. Define the endpoints of two line segments in step  610 . Trace four contours around the endpoints in step  620 . Determine the signs of the areas for the contours in step  630 . Classify the line segments in step  640  according to the signs of the areas of the contours. 
     This invention is described using specific terms and examples. It is to be understood that various other adaptations and modifications may be made within the spirit and scope of the invention. Therefore, it is the object of the appended claims to cover all such variations and modifications as come within the true spirit and scope of the invention.