enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    Packing circles in a square - closely related to spreading points in a unit square with the objective of finding the greatest minimal separation, d n, between points. To convert between these two formulations of the problem, the square side for unit circles will be L = 2 + 2 / d n {\displaystyle L=2+2/d_{n}} .

  3. Circle packing - Wikipedia

    en.wikipedia.org/wiki/Circle_packing

    In practice, suboptimal rectangular packings are often used to simplify decoding. Circle packing has become an essential tool in origami design, as each appendage on an origami figure requires a circle of paper. [12] Robert J. Lang has used the mathematics of circle packing to develop computer programs that aid in the design of complex origami ...

  4. Egyptian geometry - Wikipedia

    en.wikipedia.org/wiki/Egyptian_geometry

    If the area of the Square is 434 units. The area of the circle is 433.7. The ostracon depicting this diagram was found near the Step Pyramid of Saqqara. A curve is divided into five sections and the height of the curve is given in cubits, palms, and digits in each of the sections. [3] [4] At some point, lengths were standardized by cubit rods ...

  5. Unit circle - Wikipedia

    en.wikipedia.org/wiki/Unit_circle

    Since C = 2πr, the circumference of a unit circle is 2π. In mathematics, a unit circle is a circle of unit radius—that is, a radius of 1. [1] Frequently, especially in trigonometry, the unit circle is the circle of radius 1 centered at the origin (0, 0) in the Cartesian coordinate system in the Euclidean plane.

  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. Golden rectangle - Wikipedia

    en.wikipedia.org/wiki/Golden_rectangle

    Owing to the Pythagorean theorem, the diagonal dividing one half of a square equals the radius of a circle whose outermost point is the corner of a golden rectangle added to the square. [1] Thus, a golden rectangle can be constructed with only a straightedge and compass in four steps: Draw a square

  8. Gauss circle problem - Wikipedia

    en.wikipedia.org/wiki/Gauss_circle_problem

    This problem is known as the primitive circle problem, as it involves searching for primitive solutions to the original circle problem. [9] It can be intuitively understood as the question of how many trees within a distance of r are visible in the Euclid's orchard , standing in the origin.

  9. Circle - Wikipedia

    en.wikipedia.org/wiki/Circle

    A circle circumference and radius are proportional. The area enclosed and the square of its radius are proportional. The constants of proportionality are 2 π and π respectively. The circle that is centred at the origin with radius 1 is called the unit circle. Thought of as a great circle of the unit sphere, it becomes the Riemannian circle.