RE: [Algorithms] Bounding cones.

[Paul Du B. <du...@do...>]

> It's also
> almost identical to the 2D version - finding bounding circles=20
> - but not
> quite because the circles are the projections of the cones on=20
> the surface of the unit sphere

This reminds me of the "find an empty region" problem discussed
in the Johnstone/Williams quaternion spline paper.  You want to
find the largest empty region in s(2) populated by circles, and
the paper wants the largest empty region in an S(3) populated by
points.  Still, the paper outlines a few attacks on the problem
(with references) and it may give you some good insight.

Section 7.4, "A rational quaternion spline of arbitrary continuity"

p