algorithm - Finding a minimum bounding sphere for a frustum -


I have disappointment (piece of pyramid) and I need to calculate a border area for this frustration, which is possible It is too small. I can choose the center properly in the center of despair and the radius can be the distance of one of the "far away" corners, but usually becomes very dull around the narrow end of despair

Sounds like simple geometry, but I can not figure it out. Any ideas?

This is probably not the answer you are looking for, but you can count all of the disappointments Plug in and wrap them in a normal minimum boundary area algorithm, like


Comments

Popular posts from this blog

sql - dynamically varied number of conditions in the 'where' statement using LINQ -

asp.net mvc - Dynamically Generated Ajax.BeginForm -

Debug on symbian -