When.com Web Search

  1. Ad

    related to: points of intersection two functions calculator with steps

Search results

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

    en.wikipedia.org/wiki/Line–line_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. Line-cylinder intersection - Wikipedia

    en.wikipedia.org/wiki/Line-cylinder_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. An arbitrary line and cylinder may have no intersection at all.

  4. Intersection (geometry) - Wikipedia

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

    A transversal intersection of two curves touching intersection (left), touching (right) Two curves in (two-dimensional space), which are continuously differentiable (i.e. there is no sharp bend), have an intersection point, if they have a point of the plane in common and have at this point (see diagram):

  5. Distance between two parallel lines - Wikipedia

    en.wikipedia.org/wiki/Distance_between_two...

    the distance between the two lines is the distance between the two intersection points of these lines with the perpendicular line y = − x / m . {\displaystyle y=-x/m\,.} This distance can be found by first solving the linear systems

  6. 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 ...

  7. Perpendicular - Wikipedia

    en.wikipedia.org/wiki/Perpendicular

    Step 1 (red): construct a circle with center at P to create points A' and B' on the line AB, which are equidistant from P. Step 2 (green): construct circles centered at A' and B' having equal radius. Let Q and P be the points of intersection of these two circles. Step 3 (blue): connect Q and P to construct the desired perpendicular PQ.

  8. Bentley–Ottmann algorithm - Wikipedia

    en.wikipedia.org/wiki/Bentley–Ottmann_algorithm

    The remaining events occur when L sweeps across a crossing between (or intersection of) two line segments s and t. These events may also be predicted from the fact that, just prior to the event, the points of intersection of L with s and t are adjacent in the vertical ordering of the intersection points [clarification needed].

  9. Distance from a point to a line - Wikipedia

    en.wikipedia.org/wiki/Distance_from_a_point_to_a...

    The distance (or perpendicular distance) from a point to a line is the shortest distance from a fixed point to any point on a fixed infinite line in Euclidean geometry. It is the length of the line segment which joins the point to the line and is perpendicular to the line. The formula for calculating it can be derived and expressed in several ways.