When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Five points determine a conic - Wikipedia

    en.wikipedia.org/wiki/Five_points_determine_a_conic

    This can be shown by taking the points X and Y to the standard points [::] and [::] by a projective transformation, in which case the pencils of lines correspond to the horizontal and vertical lines in the plane, and the intersections of corresponding lines to the graph of a function, which (must be shown) is a hyperbola, hence a conic, hence ...

  3. Line–line intersection - Wikipedia

    en.wikipedia.org/wiki/Line–line_intersection

    By using homogeneous coordinates, the intersection point of two implicitly defined lines can be determined quite easily. In 2D, every point can be defined as a projection of a 3D point, given as the ordered triple (x, y, w). The mapping from 3D to 2D coordinates is (x′, y′) = (⁠ x / w ⁠, ⁠ y / w ⁠).

  4. Intersection (geometry) - Wikipedia

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

    This proves that all points in the intersection are the same distance from the point E in the plane P, in other words all points in the intersection lie on a circle C with center E. [5] This proves that the intersection of P and S is contained in C. Note that OE is the axis of the circle. Now consider a point D of the circle C. Since C lies in ...

  5. Line–plane intersection - Wikipedia

    en.wikipedia.org/wiki/Line–plane_intersection

    In analytic geometry, the intersection of a line and a plane in three-dimensional space can be the empty set, a point, or a line. It is the entire line if that line is embedded in the plane, and is the empty set if the line is parallel to the plane but outside it. Otherwise, the line cuts through the plane at a single point.

  6. Intersection curve - Wikipedia

    en.wikipedia.org/wiki/Intersection_curve

    One possibility to determine a polygon of points of the intersection curve of two surfaces is the marching method (see section References). It consists of two essential parts: The first part is the curve point algorithm, which determines to a starting point in the vicinity of the two surfaces a point on the intersection curve. The algorithm ...

  7. Tangent lines to circles - Wikipedia

    en.wikipedia.org/wiki/Tangent_lines_to_circles

    The intersection points T 1 and T 2 of the circle C and the new circle are the tangent points for lines passing through P, by the following argument. The line segments OT 1 and OT 2 are radii of the circle C ; since both are inscribed in a semicircle, they are perpendicular to the line segments PT 1 and PT 2 , respectively.

  8. Unit disk graph - Wikipedia

    en.wikipedia.org/wiki/Unit_disk_graph

    Unit disk graphs are the graphs formed from a collection of points in the Euclidean plane, with a vertex for each point and an edge connecting each pair of points whose distance is below a fixed threshold. Unit disk graphs are the intersection graphs of equal-radius circles, or of equal-radius disks. These graphs have a vertex for each circle ...

  9. Poincaré half-plane model - Wikipedia

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

    If the two given points lie on a vertical line and the given center is below the other given point: Draw a circle around the intersection of the vertical line and the x-axis which passes through the given central point. Draw a line tangent to the circle which passes through the given non-central point. Draw a horizontal line through that point ...