enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Dividing a circle into areas - Wikipedia

    en.wikipedia.org/wiki/Dividing_a_circle_into_areas

    The number of points (n), chords (c) and regions (r G) for first 6 terms of Moser's circle problem. In geometry, the problem of dividing a circle into areas by means of an inscribed polygon with n sides in such a way as to maximise the number of areas created by the edges and diagonals, sometimes called Moser's circle problem (named after Leo Moser), has a solution by an inductive method.

  3. Voronoi diagram - Wikipedia

    en.wikipedia.org/wiki/Voronoi_diagram

    Let be a metric space with distance function .Let be a set of indices and let () be a tuple (indexed collection) of nonempty subsets (the sites) in the space .The Voronoi cell, or Voronoi region, , associated with the site is the set of all points in whose distance to is not greater than their distance to the other sites , where is any index different from .

  4. Hexagonal tiling - Wikipedia

    en.wikipedia.org/wiki/Hexagonal_tiling

    The honeycomb conjecture states that hexagonal tiling is the best way to divide a surface into regions of equal area with the least total perimeter. The optimal three-dimensional structure for making honeycomb (or rather, soap bubbles) was investigated by Lord Kelvin , who believed that the Kelvin structure (or body-centered cubic lattice) is ...

  5. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    Chord: a line segment whose endpoints lie on the circle, thus dividing a circle into two segments. Circumference: the length of one circuit along the circle, or the distance around the circle. Diameter: a line segment whose endpoints lie on the circle and that passes through the centre; or the length of such a line segment. This is the largest ...

  6. File:Circle division by chords.svg - Wikipedia

    en.wikipedia.org/wiki/File:Circle_division_by...

    circle division by chords Image title Illustration of the number of points ( n ), chords ( c ) and regions ( rG ) for first six terms of Moser's circle problem (OEIS A000127) by CMG Lee.

  7. Honeycomb conjecture - Wikipedia

    en.wikipedia.org/wiki/Honeycomb_conjecture

    A regular hexagonal grid This honeycomb forms a circle packing, with circles centered on each hexagon.. The honeycomb conjecture states that a regular hexagonal grid or honeycomb has the least total perimeter of any subdivision of the plane into regions of equal area.

  8. Napoleon's problem - Wikipedia

    en.wikipedia.org/wiki/Napoleon's_problem

    In it, a circle and its center are given. The challenge is to divide the circle into four equal arcs using only a compass. [1] [2] Napoleon was known to be an amateur mathematician, but it is not known if he either created or solved the problem.

  9. Area of a circle - Wikipedia

    en.wikipedia.org/wiki/Area_of_a_circle

    The transformation sends the circle to an ellipse by stretching or shrinking the horizontal and vertical diameters to the major and minor axes of the ellipse. The square gets sent to a rectangle circumscribing the ellipse. The ratio of the area of the circle to the square is π /4, which means the ratio of the ellipse to the rectangle is also π /4