Search results
Results from the WOW.Com Content Network
Circle packing in a circle is a two-dimensional packing ... Of these, solutions for n = 2, 3, 4, 7, 19, and 37 achieve a packing density greater than any smaller ...
The paradox is that the smaller inner circle moves 2πR, the circumference of the larger outer circle with radius R, rather than its own circumference. If the inner circle were rolled separately, it would move 2πr, its own circumference with radius r. The inner circle is not separate but rigidly connected to the larger.
A compact binary circle packing with the most similarly sized circles possible. [7] It is also the densest possible packing of discs with this size ratio (ratio of 0.6375559772 with packing fraction (area density) of 0.910683). [8] There are also a range of problems which permit the sizes of the circles to be non-uniform.
The Tusi couple (also known as Tusi's mechanism [1] [2] [3]) is a mathematical device in which a small circle rotates inside a larger circle twice the diameter of the smaller circle. Rotations of the circles cause a point on the circumference of the smaller circle to oscillate back and forth in linear motion along a diameter of the larger circle.
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). That is ...
The two given circles α and β cannot intersect; hence, the smaller given circle must lie inside or outside the larger. The circles are usually shown as an annulus, i.e., with the smaller given circle inside the larger one. In this configuration, the Steiner-chain circles are externally tangent to the inner given circle and internally tangent ...
The red curve is a hypotrochoid drawn as the smaller black circle rolls around inside the larger blue circle (parameters are R = 5, r = 3, d = 5).. In geometry, a hypotrochoid is a roulette traced by a point attached to a circle of radius r rolling around the inside of a fixed circle of radius R, where the point is a distance d from the center of the interior circle.
The smallest-circle problem (also known as minimum covering circle problem, bounding circle problem, least bounding circle problem, smallest enclosing circle problem) is a computational geometry problem of computing the smallest circle that contains all of a given set of points in the Euclidean plane.