Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 492033
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 13, 20262026-05-13T02:04:16+00:00 2026-05-13T02:04:16+00:00

Most collision detection algorithm in billiard uses a naive approch, where the balls’ positions

  • 0

Most collision detection algorithm in billiard uses a naive approch, where the balls’ positions are incremented and then checked for collisions. This method dosen’t work well when the speed are really high because we might “skip” collisions.

I have been searching for a way to pre-calculate the trajectories of the balls in a billiard game. Once the trajectories are know, I can animate the balls until they stop moving. And I don’t have to worry about the speed, because the collisions are mathematically detected and resolved.

Do you know if anyone has done that? I don’t want to reinvent the wheel.
Thank you.

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-13T02:04:16+00:00Added an answer on May 13, 2026 at 2:04 am

    Start with quadtrees and make your sampling interval smaller. If your billiard balls are moving so fast that they pass through other balls, however, you’re modeling the game incorrectly. Have you ever played a game of billiards where the balls ACTUALLY moved that fast?

    Alternatively

    Between your time steps, model the ball’s previous position and current position as a 2-Dimensional cylinder. If any two cylinders collide, make the time step smaller and try again. In this fashion, you get very quick general calculations, and you can still handle super high velocities.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Why is it that most, if not all collision detection algorithms today require each
I'm trying to implement simple continuous collision detection for my pong game however i'm
Basically, I am have a basic method for collision detection, and sometimes when I
I'm writing a collision detection system for a 3D platformer video game. All the
There's a lot of literature on collision detection, and I've read at least a
I'm making a vertical shooter game and I am having trouble with collision detection.
How can we find the most efficient hash function(least possible chances of collision) for
Ok. So there are several methods to implement Collision detection like R-trees, Quadtrees, BSP
Most of my user stories end up with tasks for create code review, carry
Most things are dynamic in SSRS i.e you can create a custom expression for

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.