When.com Web Search

  1. Ad

    related to: fitting circles in a circle chart excel worksheet 1 10

Search results

  1. Results From The WOW.Com Content Network
  2. Circle packing in a circle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_circle

    Circle packing in a circle is a two-dimensional packing problem with the objective of packing unit circles into the smallest possible larger circle. Table of solutions, 1 ≤ n ≤ 20 [ edit ]

  3. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    The most efficient way to pack different-sized circles together is not obvious. In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap.

  4. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    The related circle packing problem deals with packing circles, possibly of different sizes, on a surface, for instance the plane or a sphere. The counterparts of a circle in other dimensions can never be packed with complete efficiency in dimensions larger than one (in a one-dimensional universe, the circle analogue is just two points).

  5. Circle packing in an equilateral triangle - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_an...

    [1] [2] [3] A conjecture of Paul ErdÅ‘s and Norman Oler states that, if n is a triangular number, then the optimal packings of n − 1 and of n circles have the same side length: that is, according to the conjecture, an optimal packing for n − 1 circles can be found by removing any single circle from the optimal hexagonal packing of n circles ...

  6. Circle packing in a square - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_in_a_square

    Circle packing in a square is a packing problem in recreational mathematics, where the aim is to pack n unit circles into the smallest possible square. Equivalently, the problem is to arrange n points in a unit square aiming to get the greatest minimal separation, d n , between points. [ 1 ]

  7. Circle packing theorem - Wikipedia

    en.wikipedia.org/wiki/Circle_packing_theorem

    The intersection graph of a circle packing is the graph having a vertex for each circle, and an edge for every pair of circles that are tangent. If the circle packing is on the plane, or, equivalently, on the sphere, then its intersection graph is called a coin graph ; more generally, intersection graphs of interior-disjoint geometric objects ...

  8. Doyle spiral - Wikipedia

    en.wikipedia.org/wiki/Doyle_spiral

    A Doyle spiral of type (8,16) printed in 1911 in Popular Science as an illustration of phyllotaxis. [1] One of its spiral arms is shaded. In the mathematics of circle packing, a Doyle spiral is a pattern of non-crossing circles in the plane in which each circle is surrounded by a ring of six tangent circles.

  9. File:Circle manifold chart from slope.svg - Wikipedia

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

    The original can be viewed here: Circle manifold chart from slope.png: . Modifications made by Pbroks13 . This file is licensed under the Creative Commons Attribution-Share Alike 3.0 Unported license.