enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Problem of Apollonius - Wikipedia

    en.wikipedia.org/wiki/Problem_of_Apollonius

    Solutions to Apollonius's problem generally occur in pairs; for each solution circle, there is a conjugate solution circle (Figure 6). [1] One solution circle excludes the given circles that are enclosed by its conjugate solution, and vice versa.

  3. Special cases of Apollonius' problem - Wikipedia

    en.wikipedia.org/wiki/Special_cases_of_Apollonius...

    CLP problems generally have 4 solutions. The solution of this special case is similar to that of the CPP Apollonius solution. Draw a circle centered on the given point P; since the solution circle must pass through P, inversion in this [clarification needed] circle transforms the solution circle

  4. 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 ... solutions for n = 2, 3, 4 ...

  5. Circles of Apollonius - Wikipedia

    en.wikipedia.org/wiki/Circles_of_Apollonius

    The solutions to this problem are sometimes called the circles of Apollonius. The Apollonian gasket —one of the first fractals ever described—is a set of mutually tangent circles, formed by solving Apollonius' problem iteratively.

  6. Packing problems - Wikipedia

    en.wikipedia.org/wiki/Packing_problems

    To convert between these two formulations of the problem, the square side for unit circles will be = + /. The optimal packing of 15 circles in a square Optimal solutions have been proven for n ≤ 30. Packing circles in a rectangle; Packing circles in an isosceles right triangle - good estimates are known for n < 300.

  7. Malfatti circles - Wikipedia

    en.wikipedia.org/wiki/Malfatti_circles

    The algebraic solutions do not distinguish between internal and external tangencies among the circles and the given triangle; if the problem is generalized to allow tangencies of either kind, then a given triangle will have 32 different solutions and conversely a triple of mutually tangent circles will be a solution for eight different ...

  8. Goat grazing problem - Wikipedia

    en.wikipedia.org/wiki/Goat_grazing_problem

    A circle containing one acre is cut by another whose center is on the circumference of the given circle, and the area common to both is one-half acre. Find the radius of the cutting circle. The solutions in both cases are non-trivial but yield to straightforward application of trigonometry, analytical geometry or integral calculus.

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