Jump to content
  • Advertisement
Sign in to follow this  
chrome68

geometric collision in c++

This topic is 3683 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

How can i find the points of intersection between a sphere and solid cone? [Edited by - chrome68 on November 12, 2008 5:49:19 AM]

Share this post


Link to post
Share on other sites
Advertisement
how about finding the closest point on cone to the sphere centre? That should be relatively easy.

Share this post


Link to post
Share on other sites
Thanks for your suggestion. The intersection between a cone and a sphere is curved area, so lets assume its is a plane (which can't be mathematically defined). So the question is what is the nearest point on the cone, to the sphere centre (presumably perpendicular). Bear in mind that the sphere centre could be outside the sphere or inside, its radius determines whether there is a collision or not. The problem is the desription of the cone before any calculation can begin, which can be found in pdf

The closest point should lie on a line of some sort on the slant of the cone. The cone is defined by an axis vector, apex vertex and angle theta.

How can i find the point on the cone?

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

GameDev.net is your game development community. Create an account for your GameDev Portfolio and participate in the largest developer community in the games industry.

Sign me up!