The Shrinking Circle Problem is an example of a simple-to-state geometry problem that is visually appealing yet quite challenging to solve. A combination of geometry and analysis is used to completely solve the general problem in the plane, and its extension to three dimensions: the Shrinking Sphere Problem. We show why traditional numerical attempts to answer even the simplest problem is futile. The original problem was generalized based on visual evidence produced by dynamic geometry software. Only with this insight was it possible to utilize symbolic computation tools to put together the complete proofs. All supplemental materials that accompany this paper can be found online at either of the folowing URLs
Dynamic geometric software can facilitate mathematical conjecturing. Computer construction programs ...
All our geometry, whether limited to circles and. straight lines or extended to include conic sectio...
This paper discusses the problem of approximating data points in n-dimensional Euclidean space, usin...
This article considers an example of solving the problem by the decrease vector method, where the ch...
. A circle packing is a configuration P of circles realizing a specified pattern of tangencies. We d...
The computer--aided solution to algorithmic problems is becoming more and more important in various ...
Abstract. Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Mi...
Convergence in education can be seen as a way to teach a subject by integrating knowledge, methods, ...
We describe exact representations and algorithms for geometric operations on general circles and cir...
The method of exhaustion is a technique that Archimedes used to find the area and circumference of t...
You are given 2n+3 points (n ≥ 1) in the plane, no three on a line and no four on a circle. By using...
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, ...
We develop exact algorithms for geometric operations on general circles and circular arcs on the sph...
In Tangencies Apollonius of Perga showed how to construct a circle that is tangent to three given ci...
The article deals with the problem of discretization of the three-dimensional sphere and the problem...
Dynamic geometric software can facilitate mathematical conjecturing. Computer construction programs ...
All our geometry, whether limited to circles and. straight lines or extended to include conic sectio...
This paper discusses the problem of approximating data points in n-dimensional Euclidean space, usin...
This article considers an example of solving the problem by the decrease vector method, where the ch...
. A circle packing is a configuration P of circles realizing a specified pattern of tangencies. We d...
The computer--aided solution to algorithmic problems is becoming more and more important in various ...
Abstract. Dense packing of equal circles on a sphere is investigated. A systematic algorithm, the Mi...
Convergence in education can be seen as a way to teach a subject by integrating knowledge, methods, ...
We describe exact representations and algorithms for geometric operations on general circles and cir...
The method of exhaustion is a technique that Archimedes used to find the area and circumference of t...
You are given 2n+3 points (n ≥ 1) in the plane, no three on a line and no four on a circle. By using...
Exact algorithms for dealing with geometric objects are complicated, hard to implement in practice, ...
We develop exact algorithms for geometric operations on general circles and circular arcs on the sph...
In Tangencies Apollonius of Perga showed how to construct a circle that is tangent to three given ci...
The article deals with the problem of discretization of the three-dimensional sphere and the problem...
Dynamic geometric software can facilitate mathematical conjecturing. Computer construction programs ...
All our geometry, whether limited to circles and. straight lines or extended to include conic sectio...
This paper discusses the problem of approximating data points in n-dimensional Euclidean space, usin...