When.com Web Search

  1. Ad

    related to: find the intersection of two lines calculator

Search results

  1. Results From The WOW.Com Content Network
  2. Line–line intersection - Wikipedia

    en.wikipedia.org/wiki/Lineline_intersection

    The x and y coordinates of the point of intersection of two non-vertical lines can easily be found using the following substitutions and rearrangements. Suppose that two lines have the equations y = ax + c and y = bx + d where a and b are the slopes (gradients) of the lines and where c and d are the y-intercepts of the lines.

  3. Intersection (geometry) - Wikipedia

    en.wikipedia.org/wiki/Intersection_(geometry)

    In geometry, an intersection is a point, line, or curve common to two or more objects (such as lines, curves, planes, and surfaces). The simplest case in Euclidean geometry is the lineline intersection between two distinct lines, which either is one point (sometimes called a vertex) or does not exist (if the lines are parallel). Other types ...

  4. Distance from a point to a line - Wikipedia

    en.wikipedia.org/.../Distance_from_a_point_to_a_line

    The line with equation ax + by + c = 0 has slope -a/b, so any line perpendicular to it will have slope b/a (the negative reciprocal). Let (m, n) be the point of intersection of the line ax + by + c = 0 and the line perpendicular to it which passes through the point (x 0, y 0). The line through these two points is perpendicular to the original ...

  5. Intersection curve - Wikipedia

    en.wikipedia.org/wiki/Intersection_curve

    The intersection of two planes. The analytic determination of the intersection curve of two surfaces is easy only in simple cases; for example: a) the intersection of two planes, b) plane section of a quadric (sphere, cylinder, cone, etc.), c) intersection of two quadrics in special cases. For the general case, literature provides algorithms ...

  6. Intersection - Wikipedia

    en.wikipedia.org/wiki/Intersection

    In geometry, an intersection is a point, line, or curve common to two or more objects (such as lines, curves, planes, and surfaces). The simplest case in Euclidean geometry is the lineline intersection between two distinct lines, which either is one point (sometimes called a vertex) or does not exist (if the lines are parallel). Other types ...

  7. Line-cylinder intersection - Wikipedia

    en.wikipedia.org/wiki/Line-cylinder_intersection

    Cyan line has a single point of intersection. Green line has two intersections. Yellow line lies tangent to the cylinder, so has infinitely many points of intersection. Line-cylinder intersection is the calculation of any points of intersection, given an analytic geometry description of a line and a cylinder in 3d space.

  8. Bentley–Ottmann algorithm - Wikipedia

    en.wikipedia.org/wiki/Bentley–Ottmann_algorithm

    Therefore, two line segments that share an endpoint, or a line segment that contains an endpoint of another segment, both count as an intersection of two line segments. When multiple line segments intersect at the same point, create and process a single event point for that intersection.

  9. Intersection number - Wikipedia

    en.wikipedia.org/wiki/Intersection_number

    Let X be a Riemann surface.Then the intersection number of two closed curves on X has a simple definition in terms of an integral. For every closed curve c on X (i.e., smooth function :), we can associate a differential form of compact support, the Poincaré dual of c, with the property that integrals along c can be calculated by integrals over X: