Results 1 to 2 of 2

Thread: BSP algorithm and depth buffer

  1. #1
    Senior Member Regular Contributor
    Join Date
    Sep 2002
    Location
    Poland
    Posts
    196

    BSP algorithm and depth buffer

    Hi,

    If I have a depth testing enabled I don't need to sort BSP tree by Z values. But is depth testing slow or something? I've read that BSP tree can solve the problem with depth sorting and it's its main benefit, but what for? I've got the depth buffer?

    thanks in advance

  2. #2
    Guest

    Re: BSP algorithm and depth buffer

    Depth testing is very fast but depth sorting is something else. If you have the camera looking through several colored glass plates do you have to sort the plates after the distance from the camera.
    Another use of depth sorting combined with a depth buffer was to render the closest object first. This made the following tests little faster but I dont know if its a good idea on modern hardware.

Similar Threads

  1. z-buffer algorithm
    By Trisha1993 in forum OpenGL: Basic Coding
    Replies: 3
    Last Post: 04-29-2016, 05:42 PM
  2. question on z-buffer depth test algorithm
    By michael2212 in forum OpenGL: General
    Replies: 2
    Last Post: 02-27-2012, 08:46 AM
  3. Depth Buffer algorithm
    By asimov01 in forum OpenGL: General
    Replies: 1
    Last Post: 10-13-2009, 03:46 PM
  4. Depth buffer reading and depth buffer test
    By BurningLegion in forum OpenGL: Basic Coding
    Replies: 0
    Last Post: 03-15-2007, 04:09 AM
  5. z-buffer algorithm
    By sunmingtao in forum OpenGL: Basic Coding
    Replies: 1
    Last Post: 11-08-2002, 12:40 AM

Posting Permissions

  • You may not post new threads
  • You may not post replies
  • You may not post attachments
  • You may not edit your posts
  •  
Proudly hosted by Digital Ocean