Fast BSP Tree Generation Using Binary Searches
|Links:||The article in .pdf format|
This article presents an idea for an algorithm that is able to quickly choose splitting planes when constructing BSP trees so that good balance between few splits and tree depth are produced. Although the article mentions it as just an unproven idea the author have since implemented it and proved it successful.
|Date created:||0000-00-00 00:00:00|
|Date evaluated:||0000-00-00 00:00:00|
|Categories:||Computer Science/Algorithms & data structures/BSP trees|