enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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.

  3. 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 ]

  4. 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 = + /.

  5. Rotation of axes in two dimensions - Wikipedia

    en.wikipedia.org/wiki/Rotation_of_axes_in_two...

    In mathematics, a rotation of axes in two dimensions is a mapping from an xy-Cartesian coordinate system to an x′y′-Cartesian coordinate system in which the origin is kept fixed and the x′ and y′ axes are obtained by rotating the x and y axes counterclockwise through an angle .

  6. Solid of revolution - Wikipedia

    en.wikipedia.org/wiki/Solid_of_revolution

    Two common methods for finding the volume of a solid of revolution are the disc method and the shell method of integration.To apply these methods, it is easiest to draw the graph in question; identify the area that is to be revolved about the axis of revolution; determine the volume of either a disc-shaped slice of the solid, with thickness δx, or a cylindrical shell of width δx; and then ...

  7. 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.

  8. Coin rotation paradox - Wikipedia

    en.wikipedia.org/wiki/Coin_rotation_paradox

    The outer coin makes two rotations rolling once around the inner coin. The path of a single point on the edge of the moving coin is a cardioid.. The coin rotation paradox is the counter-intuitive math problem that, when one coin is rolled around the rim of another coin of equal size, the moving coin completes not one but two full rotations after going all the way around the stationary coin ...

  9. Isometric projection - Wikipedia

    en.wikipedia.org/wiki/Isometric_projection

    Isometric projection is a method for visually representing three-dimensional objects in two dimensions in technical and engineering drawings. It is an axonometric projection in which the three coordinate axes appear equally foreshortened and the angle between any two of them is 120 degrees.