Problem of Apollonius
From Math Images
(8 intermediate revisions not shown.) | |||
Line 1: | Line 1: | ||
{{Image Description Ready | {{Image Description Ready | ||
+ | |Field=Geometry | ||
+ | |Field2=Fractals | ||
|ImageName=Apollonian Gasket | |ImageName=Apollonian Gasket | ||
|Image=Apollonian.jpg | |Image=Apollonian.jpg | ||
+ | |AuthorName=Paul Nylander | ||
+ | |SiteName=Fractals | ||
+ | |Field=Fractals | ||
+ | |Field=Geometry | ||
+ | |SiteURL=http://bugman123.com/Fractals/Fractals.html | ||
+ | |InProgress=No | ||
|ImageIntro=This an example of a fractal that can be created by repeatedly solving the Problem of Apollonius. | |ImageIntro=This an example of a fractal that can be created by repeatedly solving the Problem of Apollonius. | ||
|ImageDescElem=<div style="width:auto; position:relative;">[[Image:Apollonius.png|thumb|150px|Image by: [http://commons.wikimedia.org/wiki/File:Apollonius_solution_3B.png Wikipedia]|left]]<div style="position:relative;">The problem of Apollonius involves trying to find a circle that is tangent to three objects: points, lines, or circles in a plane. The most famous of these is the case involving three different circles in a plane, as seen in the picture to the left. The given three circles are in red, green, and blue, while the solution circle is in black.</div></div> | |ImageDescElem=<div style="width:auto; position:relative;">[[Image:Apollonius.png|thumb|150px|Image by: [http://commons.wikimedia.org/wiki/File:Apollonius_solution_3B.png Wikipedia]|left]]<div style="position:relative;">The problem of Apollonius involves trying to find a circle that is tangent to three objects: points, lines, or circles in a plane. The most famous of these is the case involving three different circles in a plane, as seen in the picture to the left. The given three circles are in red, green, and blue, while the solution circle is in black.</div></div> | ||
Line 13: | Line 21: | ||
Given three points, the problem only has one solution. In the cases of one line and two points; two lines and one point; and one circle and two points, the problem has two solutions. Four solutions exist for the cases of three lines; one circle, one line, and one point; and two circles and one point. There are eight solutions for the cases of two circles and one line; and one circle and two lines, in addition to the three circle problem. | Given three points, the problem only has one solution. In the cases of one line and two points; two lines and one point; and one circle and two points, the problem has two solutions. Four solutions exist for the cases of three lines; one circle, one line, and one point; and two circles and one point. There are eight solutions for the cases of two circles and one line; and one circle and two lines, in addition to the three circle problem. | ||
- | + | |ImageDesc= | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | There are many different ways of solving the problem of Apollonius. The few that are easiest to understand include using an algebraic method or an [[Inversion|inverse geometry]] method. | |
=== Algebraic Method === | === Algebraic Method === | ||
Line 149: | Line 153: | ||
This process can be repeated choosing different signs for the different r values in the c coefficients to find the other seven circles. | This process can be repeated choosing different signs for the different r values in the c coefficients to find the other seven circles. | ||
- | |||
- | |||
- | |||
}} | }} | ||
Line 158: | Line 159: | ||
- | + | == Apollonian Gasket == | |
- | + | ||
- | + | ||
The Apollonian gasket is an example of one of the earliest studied fractals and was first constructed by Gottfried Leibniz. It can be constructed by solving the problem of Apollonius iteratively. It was a precursor to [[Sierpinski's Triangle]], and in a special case, it forms [[Ford Circles]]. | The Apollonian gasket is an example of one of the earliest studied fractals and was first constructed by Gottfried Leibniz. It can be constructed by solving the problem of Apollonius iteratively. It was a precursor to [[Sierpinski's Triangle]], and in a special case, it forms [[Ford Circles]]. | ||
Line 174: | Line 173: | ||
Repeating this process over and over again with each set of three mutually tangent circles will create the Apollonian gasket.}} | Repeating this process over and over again with each set of three mutually tangent circles will create the Apollonian gasket.}} | ||
- | }} | + | == Interactive Applet == |
+ | {{#iframe:https://www.cs.drexel.edu/~rlw82/Canvas/ResizeCircles/|632|632|border=0}} | ||
+ | <BR> | ||
+ | Drag the circles around for solutions to be drawn | ||
+ | Drag the red circles to resize that circle | ||
- | + | == References == | |
- | + | ||
- | + | ||
Line 188: | Line 189: | ||
Wikibooks , [http://en.wikibooks.org/wiki/Fractals/Apollonian_fractals Apollonian fractals] | Wikibooks , [http://en.wikibooks.org/wiki/Fractals/Apollonian_fractals Apollonian fractals] | ||
- | + | == Mathematica Programs == | |
[[User:AnnaP|Anna]] created several programs that solve the problem of Apollonius in the case of three non-tangent, non-intersecting circles that the user inputs. The programs were written in Mathematica 7, but are likely compatible with Mathematica 5 and/or 6. | [[User:AnnaP|Anna]] created several programs that solve the problem of Apollonius in the case of three non-tangent, non-intersecting circles that the user inputs. The programs were written in Mathematica 7, but are likely compatible with Mathematica 5 and/or 6. | ||
Line 195: | Line 196: | ||
The second program allows the user to choose which solutions to plot in groups of two. [http://www.sccs.swarthmore.edu/users/09/anna09/mathematica/apolloniussolutionoptions.nb Click here to download this program] | The second program allows the user to choose which solutions to plot in groups of two. [http://www.sccs.swarthmore.edu/users/09/anna09/mathematica/apolloniussolutionoptions.nb Click here to download this program] | ||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- | |||
- |
Current revision
Apollonian Gasket |
---|
Apollonian Gasket
- This an example of a fractal that can be created by repeatedly solving the Problem of Apollonius.
Contents |
Basic Description
Apollonius of Perga posed and solved this problem in his work called Tangencies. Sadly, Tangencies has been lost, and only a report of his work by Pappus of Alexandria is left. Since then, other mathematicians, such as Isaac Newton and Descartes, have been able to recreate his results and discover new ways of solving this interesting problem.
Given three points, the problem only has one solution. In the cases of one line and two points; two lines and one point; and one circle and two points, the problem has two solutions. Four solutions exist for the cases of three lines; one circle, one line, and one point; and two circles and one point. There are eight solutions for the cases of two circles and one line; and one circle and two lines, in addition to the three circle problem.
A More Mathematical Explanation
There are many different ways of solving the problem of Apollonius. The few that are easiest to under [...]
There are many different ways of solving the problem of Apollonius. The few that are easiest to understand include using an algebraic method or an inverse geometry method.
Algebraic Method
This method only uses math up to the level of understanding quadratic equations. We will proceed by setting up a system of quadratic equations and solving for the radius, r, of the unknown circle.
We start by labeling the center of each of the given circles _{1}_{1}, _{2}_{2}, and _{3}_{3}. We will call the center of the unknown circle . _{1},_{2}, and _{3} are the different radii of each of the given circles.
From this we are able to write our equations:
- _{1}_{1}_{1}
- _{2}_{2}_{2}
- _{3}_{3}_{3}
Next we are able to expand each of the equations to see better how they can relate to each other.
Expanding gives us:
- _{1}_{1}_{1}_{1}_{1}_{1}
- _{2}_{2}_{2}_{2}_{2}_{2}
- _{3}_{3}_{3}_{3}_{3}_{3}
We can now look at the equations and see how we can subtract them from each other. So we will take the second and third equation minus the first equation.
Second minus first gives us:
Third minus first gives us:
For the sake of simplicity, we'll define some new variables. Let
; ; ;
; ; ;
Now our two equations can be written as
Since this is a simple linear system of equations, we can solve it for x and y in terms of r.
Substituting that in to the second equation allows us to find y in terms of known values and r:
- .
Rather than substituting back in to find x, it is actually simpler to go through the same process we used to find y to get x in terms of known values and r.
First, we solve the first equation for y.
Plugging into the second equation gives us
- .
With and , we plug in values for the a's, b's and c's (which we get from the original information about the centers and radii of the three circles) to calculate x and y. Using our very first equations for the circles, we can then solve for r.
Take , and . These three circles are shown below.
Now we want to calculate the a's, b's, and d's first.
Calculating the c terms requires a bit more thought since there are the signs. The choice of these signs determines which circle we are solving for. We simply must be consistent in all of our applications of signs for a given r. For the first example, let's simply take all of the plus signs. Then
.
Now we can calculate x and y for this first circle.
.
.
Now we can return to one of our first equations to find r.
Note that here the sign of is positive. That is because we took the positive sign when we solved for the c values. Plugging in values, we get
This equation is quadratic in r, so it can be solved using the quadratic formula (or a graphing calculator, if you prefer). When the dust clears, we get (the other value that comes out of the quadratic formula does not work when plotted).
Now we can plot this circle with center . It is shown below in red, with the original circles in black.
We can see that it is indeed tangent to the three original circles!
This process can be repeated choosing different signs for the different r values in the c coefficients to find the other seven circles.
Apollonian Gasket
The Apollonian gasket is an example of one of the earliest studied fractals and was first constructed by Gottfried Leibniz. It can be constructed by solving the problem of Apollonius iteratively. It was a precursor to Sierpinski's Triangle, and in a special case, it forms Ford Circles.
Constructing the gasket begins with three mutually tangent circles. By solving this case of the problem of Apollonius we know that there are two other circles that are tangent to the three given circles. We now have five circles from which to start again.
Repeat the process with two of the original circles and one of the newly generated circles. Again, by solving Apollonius' problem we can find two circles that are tangent to this new set of three circles. Although, we already know one of the two solutions for this set of three circles; it is the other of the three circles that we started with.
Repeating this process over and over again with each set of three mutually tangent circles will create the Apollonian gasket.
Teaching Materials
- There are currently no teaching materials for this page. Add teaching materials.
Leave a message on the discussion page by clicking the 'discussion' tab at the top of this image page.
Interactive Applet
Drag the circles around for solutions to be drawn
Drag the red circles to resize that circle
References
Math Pages, Apollonius' Tangency Problem
MathWorld, Apollonius' Problem
Wikibooks , Apollonian fractals
Mathematica Programs
Anna created several programs that solve the problem of Apollonius in the case of three non-tangent, non-intersecting circles that the user inputs. The programs were written in Mathematica 7, but are likely compatible with Mathematica 5 and/or 6.
The first program automatically plots all eight solutions. Click here to download this program
The second program allows the user to choose which solutions to plot in groups of two. Click here to download this program