Programming C, C++, Java, PHP, Ruby, Turing, VB
Computer Science Canada 
Programming C, C++, Java, PHP, Ruby, Turing, VB  

Username:   Password: 
 RegisterRegister   
 Occlusion
Index -> Programming, Turing -> Turing Help
View previous topic Printable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic
Author Message
smool




PostPosted: Mon Apr 02, 2012 6:09 pm   Post subject: Occlusion

I'm writing a 3D engine, I currently can support 500 polygons at about 23 fps. I've been reading online about Occlusion/culling, but I nowhere can I find a good explanation of how a occlusion/culling algorithm works. Can anyone help? Sorry if this inst the right place to post this.
Sponsor
Sponsor
Sponsor
sponsor
Raknarg




PostPosted: Wed Apr 04, 2012 1:21 pm   Post subject: RE:Occlusion

bump
mirhagk




PostPosted: Wed Apr 04, 2012 5:00 pm   Post subject: RE:Occlusion

There are different ways of doing it. Some simply ones just remove all polygons that are over a certain distance away, while others remove the polygons that aren't in your vision path(a basic check to make sure all the points of the polygon are on screen works decently).

There are then much more complex algorithms such as quad root nodes (having a hierarchy of zones and removing polygons that aren't in certain zones)
Display posts from previous:   
   Index -> Programming, Turing -> Turing Help
View previous topic Tell A FriendPrintable versionDownload TopicSubscribe to this topicPrivate MessagesRefresh page View next topic

Page 1 of 1  [ 3 Posts ]
Jump to:   


Style:  
Search: