When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Bézier curve - Wikipedia

    en.wikipedia.org/wiki/Bézier_curve

    Equivalence of a quadratic Bézier curve and a parabolic segment. A quadratic Bézier curve is also a segment of a parabola. As a parabola is a conic section, some sources refer to quadratic Béziers as "conic arcs". [12] With reference to the figure on the right, the important features of the parabola can be derived as follows: [13]

  3. Distance from a point to a line - Wikipedia

    en.wikipedia.org/.../Distance_from_a_point_to_a_line

    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.

  4. Tractrix - Wikipedia

    en.wikipedia.org/wiki/Tractrix

    The essential property of the tractrix is constancy of the distance between a point P on the curve and the intersection of the tangent line at P with the asymptote of the curve. The tractrix might be regarded in a multitude of ways: It is the locus of the center of a hyperbolic spiral rolling (without skidding) on a straight line.

  5. Line segment - Wikipedia

    en.wikipedia.org/wiki/Line_segment

    A closed line segment includes both endpoints, while an open line segment excludes both endpoints; a half-open line segment includes exactly one of the endpoints. In geometry , a line segment is often denoted using an overline ( vinculum ) above the symbols for the two endpoints, such as in AB .

  6. Piecewise linear function - Wikipedia

    en.wikipedia.org/wiki/Piecewise_linear_function

    The graph of this function is shown to the right. Since the graph of an affine(*) function is a line, the graph of a piecewise linear function consists of line segments and rays. The x values (in the above example −3, 0, and 3) where the slope changes are typically called breakpoints, changepoints, threshold values or knots. As in many ...

  7. Bresenham's line algorithm - Wikipedia

    en.wikipedia.org/wiki/Bresenham's_line_algorithm

    Bresenham's line algorithm is a line drawing algorithm that determines the points of an n-dimensional raster that should be selected in order to form a close approximation to a straight line between two points.

  8. DE-9IM - Wikipedia

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

    where ⁠ ⁠ is the dimension of the intersection (∩) of the interior (I), boundary (B), and exterior (E) of geometries a and b.. The terms interior and boundary in this article are used in the sense used in algebraic topology and manifold theory, not in the sense used in general topology: for example, the interior of a line segment is the line segment without its endpoints, and its ...

  9. Polar coordinate system - Wikipedia

    en.wikipedia.org/wiki/Polar_coordinate_system

    The two arms are smoothly connected at the pole. If a = 0, taking the mirror image of one arm across the 90°/270° line will yield the other arm. This curve is notable as one of the first curves, after the conic sections, to be described in a mathematical treatise, and as a prime example of a curve best defined by a polar equation.