If the estimate
were perfect, we would have
and
. If
the circle centered on the
test point
with radius
would be tangent to the ellipse. In
our iterative process, the estimate is not perfect and the circle
intersects the ellipse at least at one other point
,
. Figures 3
and 4 show these circle/ellipse intersections
in two different situations. As shown by these figures, there can be
up to three intersection points in addition to the already known point
.
The additional intersection points can be computed by introducing
in equation (5) an
multiplying by
. We get:
![]() | ||
| where |
![]() |
This is a quartic equation for which we already know one root:
. We can therefore reduce this equation to a
normalized cubic polynomial by a simple coefficients identification
(the value of the constant term
of the quartic is of
course not needed for this degree reduction):
The other circle/ellipse intersections are given by the real roots of
equation (8). In order to compute them, we compute first
the discriminant
:
![]() |
If
is positive, the following expressions compute the two real
numbers
et
and allow to deduce the unique real root
. We do not need the two complex roots
and
. This corresponds to the case
depicted in figure 4. It also occurs for
interior points when we are close to the solution.
![]() | |
| (9) | ![]() |
If
is negative, the three roots are all real ones. This
corresponds to the case depicted in
figure 3. In this case, the trigonometric
expressions of the root are simpler to use:
| (10) | with![]() |
For each
representing a circle/ellipse intersection,
we compute
and
using
equation (4). Since this point belongs to
the ellipse we deduce
using
equation (2).
When there are three roots, only one of them2 leads to a point on the same
half plane (
or
) as the test point
and the already
known intersection point
. We select this root and
disgard the two other ones. This selection is done by comparing the
signs of
and
.
Luc Maisonobe 2006-02-04