When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Lineline_intersection

    The intersection point falls within the first line segment if 0 ≤ t ≤ 1, and it falls within the second line segment if 0 ≤ u ≤ 1. These inequalities can be tested without the need for division, allowing rapid determination of the existence of any line segment intersection before calculating its exact point. [3]

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

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

  5. Intersection - Wikipedia

    en.wikipedia.org/wiki/Intersection

    The intersection (red) of two disks (white and red with black boundaries). The circle (black) intersects the line (purple) in two points (red). The disk (yellow) intersects the line in the line segment between the two red points. The intersection of D and E is shown in grayish purple. The intersection of A with any of B, C, D, or E is the empty ...

  6. Smallest-circle problem - Wikipedia

    en.wikipedia.org/wiki/Smallest-circle_problem

    Let Q k be the intersection of the bisectors in the k-th pair. The line q in the p 1 direction is placed to go through an intersection Q x such that there are intersections in each half-plane defined by the line (median position). The constrained version of the enclosing problem is run on the line q' which determines half-plane where the center ...

  7. Tangent lines to circles - Wikipedia

    en.wikipedia.org/wiki/Tangent_lines_to_circles

    In Möbius or inversive geometry, lines are viewed as circles through a point "at infinity" and for any line and any circle, there is a Möbius transformation which maps one to the other. In Möbius geometry, tangency between a line and a circle becomes a special case of tangency between two circles.

  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. Poincaré half-plane model - Wikipedia

    en.wikipedia.org/wiki/Poincaré_half-plane_model

    The metric of the model on the half-plane, { , >}, is: = + ()where s measures the length along a (possibly curved) line. The straight lines in the hyperbolic plane (geodesics for this metric tensor, i.e., curves which minimize the distance) are represented in this model by circular arcs perpendicular to the x-axis (half-circles whose centers are on the x-axis) and straight vertical rays ...