The project delves into the various algorithms pertaining to occlusion culling. Most of the classic algorithms related to occlusion culling try to sort the polygons(objects) based on various properties like distance from view point etc. We considered a density based approach to Occlusion culling as probability of occlusion is proportional to density and inversely proportional to distance.
-
Notifications
You must be signed in to change notification settings - Fork 0
The project delves into the various algorithms pertaining to occlusion culling. Most of the classic algorithms related to occlusion culling try to sort the polygons(objects) based on various properties like distance from view point etc. We considered a density based approach to Occlusion culling as probability of occlusion is proportional to den…
aashd/density-occlusion-culling
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The project delves into the various algorithms pertaining to occlusion culling. Most of the classic algorithms related to occlusion culling try to sort the polygons(objects) based on various properties like distance from view point etc. We considered a density based approach to Occlusion culling as probability of occlusion is proportional to den…
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published