-
Couldn't load subscription status.
- Fork 17
Replace BSP Sorting with Fast Z-Sort #65
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
base: main
Are you sure you want to change the base?
Replace BSP Sorting with Fast Z-Sort #65
Conversation
|
The latest updates on your projects. Learn more about Vercel for GitHub.
|
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
We're looking for an algo optimization for the claim
Oh, sorry that’s my mistake |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Overview
This PR replaces the slow BSP (Binary Space Partitioning) face sorting algorithm with a fast Z-sort algorithm in the renderer. These changes make the renderer much faster and easier to maintain, especially for scenes with many faces.
Key Changes
1. Z-Sort Algorithm for Face Ordering
What is Z-Sort?
Why Z-Sort?
How does it work?
Impact
/claim #56
videos :-
Screen.Recording.2025-09-27.113209.mp4
Screen.Recording.2025-09-27.114211.mp4