enow.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 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 ).

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

  5. DE-9IM - Wikipedia

    en.wikipedia.org/wiki/DE-9IM

    The Dimensionally Extended 9-Intersection Model (DE-9IM) is a topological model and a standard used to describe the spatial relations of two regions (two geometries in two-dimensions, R 2), in geometry, point-set topology, geospatial topology, and fields related to computer spatial analysis.

  6. Multiple line segment intersection - Wikipedia

    en.wikipedia.org/wiki/Multiple_line_segment...

    The Shamos–Hoey algorithm [1] applies this principle to solve the line segment intersection detection problem, as stated above, of determining whether or not a set of line segments has an intersection; the Bentley–Ottmann algorithm works by the same principle to list all intersections in logarithmic time per intersection.

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

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

  9. Tangent lines to circles - Wikipedia

    en.wikipedia.org/wiki/Tangent_lines_to_circles

    But only a tangent line is perpendicular to the radial line. Hence, the two lines from P and passing through T 1 and T 2 are tangent to the circle C. Another method to construct the tangent lines to a point P external to the circle using only a straightedge: Draw any three different lines through the given point P that intersect the circle twice.