[FIX #371] Repaired the multithreading setting
* General style Some style improvements. * * General features: * - Points - Transform: Color equalizer (contrast and offset setting for each color * channel) * * Performance improvements (in general about 4 times faster) * - Lari/Habib 2014 clustering has now following improvements. * - Removing points from the parameter space kd-tree after adding to a plane - * This change created an additional, temporary parameter domain kd-tree which * is in the beginning just a copy of the original parameter domain kd-tree. * When points are added to a plane, they are removed from that copy. It makes * the algorithm a way faster. * - Distinguishing whether a point belongs to an extent directly in an point * searcher instance works faster than building a list with additional * unnecessary points and filtering afterwards. In that change a new class * inherited from WPointSearcher and overwrote a method which distinguishes * whether points are added or not. * - Another story is counting points of an extent with a searched point as peak * centre. Previously points were put in a list in order to count them * afterwards. This new class was further modified at traversing. So no new * unnecessary list is built up. * * Bugs fixed: * - Boundary detection problems were fixed. Originally there was a detection that * checked whether a new bound would hit the pre previously detectet bound. But that * seemet practically not to be enough. So every point adding a new bound is checked * whether it hits one of all bound pieces detected. Nevertheless the problem is not * solved completely but there are much less less problems by far.
Showing with 421 additions and 255 deletions
|...||...||@@ -54,13 +54,6 @@ public:|