Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Collision detections using BSP tree instead of BLOCKMAP #77

Closed
cher-nov opened this issue May 3, 2022 · 1 comment
Closed

Collision detections using BSP tree instead of BLOCKMAP #77

cher-nov opened this issue May 3, 2022 · 1 comment

Comments

@cher-nov
Copy link

cher-nov commented May 3, 2022

John Carmack wrote about that in ReadMe of the Doom open-source release:
https://github.com/id-Software/DOOM/blob/77735c3ff0772609e9c8d29e3ce2ab42ff54d20b/README.TXT#L37-L45

Just curious: would it help gather some speedup advantage?
Changing collision method will definitely cause desync in demos / multiplayer, but speedup would be useful for singleplayer, so it could be optional.

@cher-nov
Copy link
Author

cher-nov commented May 3, 2022

Okay, ketmar (author of k8vavoom source port) told me that a BSP tree would be even slower that the BLOCKMAP - the latter is O(1) while the former would be O(logN) in the best case.

@cher-nov cher-nov closed this as completed May 3, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant