Jump to content

Space partitioning: Revision history


For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

3 December 2024

25 October 2023

16 October 2022

9 June 2022

1 May 2022

30 March 2021

10 March 2021

23 February 2021

4 September 2020

9 September 2019

8 August 2019

18 July 2018

2 September 2017

10 March 2017

3 March 2017

10 November 2016

6 June 2016

2 September 2015

27 July 2015

1 May 2014

14 March 2013

12 February 2013

7 January 2013

  • curprev 14:0014:00, 7 January 2013 Cwkx talk contribs 4,048 bytes 0 BVHs are a "spatial data structure", they does not "partition space" such that the union of leaves are equal the entire n-d space; hence, it is an incorrect example of a "space partitioning data structure". BSP is a correct example. undo

14 November 2012

6 September 2012

2 September 2012

21 September 2011

16 August 2010

15 August 2010

21 June 2010

13 June 2010

30 January 2010

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)