Fix for very old bug in Boolean code. BSP trees were calculated incorrectly,
authorKen Hughes <khughes@pacific.edu>
Thu, 14 Jun 2007 14:42:35 +0000 (14:42 +0000)
committerKen Hughes <khughes@pacific.edu>
Thu, 14 Jun 2007 14:42:35 +0000 (14:42 +0000)
commit34341ce3f1a53be03c69877668949b67a1727238
treeb783aaf5e258b3bc81837c4fc7d07c6283900283
parenta499da719217a3009a7014203a91f914742da74a
Fix for very old bug in Boolean code.  BSP trees were calculated incorrectly,
which caused faces of convex objects to be classified wrongly.  Also removed
some dead code.  For convex objects, the BSP trees would also be literally
orders of magnitude larger than they were supposed to be (one test with a
5000 face torus reduced the BSP tree size from 5.96 million nodes to just 72.1
thousand).
intern/boolop/intern/BOP_BSPNode.cpp
intern/boolop/intern/BOP_BSPNode.h
intern/boolop/intern/BOP_BSPTree.cpp
intern/boolop/intern/BOP_BSPTree.h
intern/boolop/intern/BOP_Interface.cpp