Skip to main content
. Author manuscript; available in PMC: 2011 Sep 10.
Published in final edited form as: IEEE Trans Vis Comput Graph. 2010 Sep-Oct;16(5):763–776. doi: 10.1109/TVCG.2009.107

Fig. 13.

Fig. 13

Timing statistics for point location in sorted (green) and unsorted (red) OFBs with ever increasing depth complexity of the scene. For a depth complexity larger than 5, the logarithmic complexity of this operation in a sorted OFB pays off compared to the linear complexity of this operation in an unsorted OFB, even though the data access operations are now data dependent.