I read an article by Joseph O'Rourke. It is about an algorithm for finding a minimum bounding box in three-dimensional this article.
He said there:
The Gaussian sphere is dual of the convex polyhedron.
and also:
Gaussian sphere partitions the surface of the unit sphere to into the convex region, one for each vertex of the convex polyhedron, such that if n is a unit vector from the origin whose tip lies in the convex region then the plane through the convex region with normal n is a supporting plane for the polyhedron.
My questions are:
What is a "Gaussian sphere"
Which algorithm helps to create it?
I search on the net but gained nothing.
Any tip that makes a way to know it, makes me happy.