When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Pappus configuration - Wikipedia

    en.wikipedia.org/wiki/Pappus_configuration

    The Pappus configuration, augmented with an additional line (the vertical one in the center of the figure), solves the orchard-planting problem.. A variant of the Pappus configuration provides a solution to the orchard-planting problem, the problem of finding sets of points that have the largest possible number of lines through three points.

  3. Collocation method - Wikipedia

    en.wikipedia.org/wiki/Collocation_method

    In mathematics, a collocation method is a method for the numerical solution of ordinary differential equations, partial differential equations and integral equations.The idea is to choose a finite-dimensional space of candidate solutions (usually polynomials up to a certain degree) and a number of points in the domain (called collocation points), and to select that solution which satisfies the ...

  4. No-three-in-line problem - Wikipedia

    en.wikipedia.org/wiki/No-three-in-line_problem

    A set of 20 points in a 10 × 10 grid, with no three points in a line. The no-three-in-line problem in discrete geometry asks how many points can be placed in the grid so that no three points lie on the same line. The problem concerns lines of all slopes, not only those aligned with the

  5. Problem of Apollonius - Wikipedia

    en.wikipedia.org/wiki/Problem_of_Apollonius

    Remarkably, these six points lie on four lines, three points on each line; moreover, each line corresponds to the radical axis of a potential pair of solution circles. To show this, Gergonne considered lines through corresponding points of tangency on two of the given circles, e.g., the line defined by A 1 / A 2 and the line defined by B 1 / B 2 .

  6. Five points determine a conic - Wikipedia

    en.wikipedia.org/wiki/Five_points_determine_a_conic

    In Euclidean and projective geometry, five points determine a conic (a degree-2 plane curve), just as two (distinct) points determine a line (a degree-1 plane curve).There are additional subtleties for conics that do not exist for lines, and thus the statement and its proof for conics are both more technical than for lines.

  7. Configuration (geometry) - Wikipedia

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

    Configurations (4 3 6 2) (a complete quadrangle, at left) and (6 2 4 3) (a complete quadrilateral, at right).. In mathematics, specifically projective geometry, a configuration in the plane consists of a finite set of points, and a finite arrangement of lines, such that each point is incident to the same number of lines and each line is incident to the same number of points.

  8. Curve fitting - Wikipedia

    en.wikipedia.org/wiki/Curve_fitting

    Polynomial curves fitting points generated with a sine function. The black dotted line is the "true" data, the red line is a first degree polynomial, the green line is second degree, the orange line is third degree and the blue line is fourth degree. The first degree polynomial equation = + is a line with slope a. A line will connect any two ...

  9. Arrangement of lines - Wikipedia

    en.wikipedia.org/wiki/Arrangement_of_lines

    These are the connected components of the points that would remain after removing all points on lines. [1] The edges or panels of the arrangement are one-dimensional regions belonging to a single line. They are the open line segments and open infinite rays into which each line is partitioned by its crossing points with the other lines.