Function findBestCluster

mapcluster.c:633–670

traverse the quadtree to find the best renking cluster */

/* traverse the quadtree to find the best renking cluster */
static void findBestCluster(layerObj* layer, msClusterLayerInfo* layerinfo, clusterTreeNode *node)
{
    int i;
    double rank;
    clusterInfo* s = node->shapes;
    while (s)
    {
        if (s->filter < 0 && layer->cluster.filter.string != NULL)
        {
            InitShapeAttributes(layer, s);
            s->filter = msClusterEvaluateFilter(&layer->cluster.filter, &s->shape);
        }
        
        if (s->numsiblings == 0 || s->filter == 0)
        {
            /* individual or filtered shapes must be removed for sure */
            layerinfo->current = s;
            return;
        }
        
        /* calculating the rank */
        rank = (s->x - s->avgx) * (s->x - s->avgx) + (s->y - s->avgy) * (s->y - s->avgy) /*+ s->varx + s->vary*/ + (double)1/ (1 + s->numsiblings);
        
        if (rank < layerinfo->rank)
        {
            layerinfo->current = s;
            layerinfo->rank = rank;
        }
        s = s->next;
    }

    /* Recurse to subnodes if they exist */
    for (i = 0; i < 4; i++)
    {
        if (node->subnode[i])
            findBestCluster(layer, layerinfo, node->subnode[i]);
    }
}

/* adding the shape based on the shape bounds (point) */
static int treeNodeAddShape(msClusterLayerInfo* layerinfo, clusterTreeNode* node, clusterInfo* shape, int depth)