Search results
Results From The WOW.Com Content Network
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 ]
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.
The nine-point circle is tangent to the incircle and excircles. In geometry, the nine-point circle is a circle that can be constructed for any given triangle. It is so named because it passes through nine significant concyclic points defined from the triangle. These nine points are: [28] [29] The midpoint of each side of the triangle; The foot ...
Circle with similar triangles: circumscribed side, inscribed side and complement, inscribed split side and complement. Let one side of an inscribed regular n-gon have length s n and touch the circle at points A and B. Let A′ be the point opposite A on the circle, so that A′A is a diameter, and A′AB is an inscribed triangle on a diameter.
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 ]
This circle is called the incircle of the quadrilateral or its inscribed circle, its center is the incenter and its radius is called the inradius. Since these quadrilaterals can be drawn surrounding or circumscribing their incircles, they have also been called circumscribable quadrilaterals , circumscribing quadrilaterals , and circumscriptible ...
Gauss's circle problem asks how many points there are inside this circle of the form (,) where and are both integers. Since the equation of this circle is given in Cartesian coordinates by x 2 + y 2 = r 2 {\displaystyle x^{2}+y^{2}=r^{2}} , the question is equivalently asking how many pairs of integers m and n there are such that
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 ...