anchor.diff:  
                   for ti in 0..triangles.Length-1 do
                       let t = triangles.[ti]
  -                    let mutable n0 = store.Query(t.P0, Constant.PositiveTinyValue) |> Set.ofSeq
  -                    let mutable n1 = store.Query(t.P1, Constant.PositiveTinyValue) |> Set.ofSeq
  -                    let mutable n2 = store.Query(t.P2, Constant.PositiveTinyValue) |> Set.ofSeq
  +                    let mutable n0 = store.Query(t.P0, 10.0 * Constant.PositiveTinyValue) |> Set.ofSeq
  +                    let mutable n1 = store.Query(t.P1, 10.0 * Constant.PositiveTinyValue) |> Set.ofSeq
  +                    let mutable n2 = store.Query(t.P2, 10.0 * Constant.PositiveTinyValue) |> Set.ofSeq
   
   
                       let all = Set.intersect n0 (Set.intersect n1 n2) |> Set.remove ti
   
  -                    if not (Set.isEmpty all) then
  -                        n0 <- Set.difference n0 all
  -                        n1 <- Set.difference n1 all
  -                        n2 <- Set.difference n2 all
  -                        Log.warn "removed duplicate triangle"
  +//                    if not (Set.isEmpty all) then
  +//                        n0 <- Set.difference n0 all
  +//                        n1 <- Set.difference n1 all
  +//                        n2 <- Set.difference n2 all
  +//                        Log.warn "removed duplicate triangle"
   
                       pointTriangles.[3 * ti + 0] <- n0
                       pointTriangles.[3 * ti + 1] <- n1
  
positive.code:         let rec addContained (info : OctNodeInfo) (cell : GridCell) (values : array<V3d * 'a>) (n : byref<OctNode<'a>>) =
              match n with
                  | Empty ->
                      n <- Leaf (cell.Center, List values)
  
                  | Leaf content ->
                      if content.Count + values.Length <= info.pointsPerLeaf || cell.ChildVolume < info.minLeafVolume then
  
negative.code:                         let o0 = pointTriangles.[3 * oi + 0]
                          let o1 = pointTriangles.[3 * oi + 1]
                          let o2 = pointTriangles.[3 * oi + 2]
                          let o01 = Set.intersect o0 o1 |> Set.contains ti
                          let o12 = Set.intersect o1 o2 |> Set.contains ti
                          let o20 = Set.intersect o2 o0 |> Set.contains ti
  
  
                          if not (o01 || o12 || o20) then
                              Log.warn "broken topology"
  
  
  