                 d.l = rightEdge
                 d.x = d.l + bbox.width / 2 + 5
                 d.r = d.l + bbox.width + 10
-            }
+            
             else console.log("no conflicts for ", d)
             
             # add this label to the quadtree, so it will show up as a conflict

                #x1,y1,x2,y2 are the bounds of the rectangle that
                #this node covers
                
                if (  (x1 > d.r + maxLabelWidth/2) 
                        #left edge of node is to the right of right edge of label
                    ||(x2 < d.l - maxLabelWidth/2) 
                        #right edge of node is to the left of left edge of label
                    ||(y1 > d.b + maxLabelHeight/2)
                        #top (minY) edge of node is greater than the bottom of label
                    ||(y2 < d.t - maxLabelHeight/2 ) )
                        #bottom (maxY) edge of node is less than the top of label
                    
                      return true #don't bother visiting children or checking this node
                
                p = node.point
                v = false, h = false
                if ( p ) { #p is defined, i.e., there is a value stored in this node
                    h =  ( ((p.l > d.l) && (p.l <= d.r))
                       || ((p.r > d.l) && (p.r <= d.r)) 
                       || ((p.l < d.l)&&(p.r >=d.r) ) ) #horizontal conflict

        pointers.exit().remove()
        
        pointers.transition().attr("d", (d) ->
            if d.cx > d.l
                return "M" + (d.l+2) + "," + d.b + "L" + (d.r-2) + "," + d.b + " " + d.cx + "," + d.cy
            else
                return "M" + (d.r-2) + "," + d.b + "L" + (d.l+2) + "," + d.b + " " + d.cx + "," + d.cy
            
        )
