geometry_attribute.c

Go to the documentation of this file.

/* BGEOMETRY BUILDS THE MESH FROM A RASTER FOR THE BOUSSINESQ MODEL
KeyPalette Version 0.9375 KMackenzie

file geometry_attribute.c

Copyright, 2009 Emanuele Cordano and Riccardo Rigon

This file is part of BGEOMETRY.
 BGEOMETRY is free software: you can redistribute it and/or modify
    it under the terms of the GNU  General Public License as published by
    the Free Software Foundation, either version 3 of the License, or
    (at your option) any later version.

    BGEOMETRY is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU  General Public License
    along with this program.  If not, see <http://www.gnu.org/licenses/>.
*/

#include "turtle.h"

#include "geometry.h"
#include "t_datamanipulation.h"
#include "geometry_utilities.h"


//#include "geometry_io.h"
#include "geometry_attribute.h"

#define NO_INTERSECTION -99
#define NULL_VALUE -99

polygon_connection_attributes *get_connection(POLYGON *polygon,POLYGONVECTOR *polygons, long boundary, long displacement ,short print){
        polygon_connection_attributes *pca;
        long l,s,l_po1,l_po2,icnt;
        double dist;
        long A_min,A_max; 
        icnt=1;

        pca=(polygon_connection_attributes *)malloc((sizeof(polygon_connection_attributes)));
        if (!pca) printf("Error: polygon_connection_attributes was not allocated at %ld polygon",polygon->index);
        pca->connections=new_longvector(polygon->edge_indices->nh);
        pca->d_connections=new_doublevector(polygon->edge_indices->nh);
        initialize_longvector(pca->connections,boundary);
        initialize_doublevector(pca->d_connections,NULL_VALUE);
        A_min=fmax(polygon->index-displacement,polygons->nl);
        A_max=fmin(polygon->index+displacement,polygons->nh);

        for (l=A_min;l<=A_max;l++){
                if (l!=polygon->index) {
                        dist=1.0;
                        l_po1=0;
                        l_po2=0;

                        s=shared_edges(polygon,polygons->element[l],NO_INTERSECTION,&l_po1,&l_po2,&dist);

                        if (s!=NO_INTERSECTION ){
                                if (l_po1>polygon->edge_indices->nh) printf ("Error: Line %ld : (%ld for polygon %ld) Not coherent data!!! \n ",s,l_po1,polygon->index);
                                pca->connections->element[l_po1]=polygons->element[l]->index;
                                pca->d_connections->element[l_po1]=dist;
//                              printf(" pca conn. %ld %lf",pca->connections->element[l_po1],pca->d_connections->element[l_po1]);
                        }
                }


        }


        return pca;

}






polygon_connection_attribute_array *new_connection_attributes(long nh){
        polygon_connection_attribute_array *apv;

        apv=(polygon_connection_attribute_array *)malloc(sizeof(polygon_connection_attribute_array));
        if (!apv) t_error("polygon_connection_attribute_array was not allocated");

        apv->isdynamic=isDynamic;
        apv->nl=NL;
        apv->nh=nh;


        apv->element=(polygon_connection_attributes **)malloc((size_t)((nh-NL+1+NR_END)*sizeof(polygon_connection_attributes *)));
        if (!apv) t_error("polygon_connection_attribute_array element struct was not allocated");

        return apv;

}

polygon_connection_attribute_array *get_connection_array(POLYGONVECTOR *polygons, long boundary, long displacement, short print){

        polygon_connection_attribute_array *pca;
        long l;

        pca=new_connection_attributes(polygons->nh);
        printf ("pca Allocated!\n");

        for(l=pca->nl;l<=pca->nh;l++){
                pca->element[l]=get_connection(polygons->element[l],polygons,boundary,displacement,print);
                if (print==1) printf ("Polygons %ld (%ld connections) of %ld (displacement=%ld)!! \n",l,pca->element[l]->connections->nh,pca->nh,displacement);
        }

        if (print==1) printf (" Finished polygon_connection_array struct filling!! \n ");



        return pca;
}


int write_polygonconnectionattributearray(char *filename,polygon_connection_attribute_array *pca) {
        FILE *fd;
        long i,nh,nl,l,link_val;
        double d_link_val;
        nl=NL;
        nh=NL;
        for (i=pca->nl;i<=pca->nh;i++){
                if (nl>pca->element[i]->connections->nl) nl=pca->element[i]->connections->nl;
                if (nh<pca->element[i]->connections->nh) nh=pca->element[i]->connections->nh;
        }

        fd=fopen(filename,"w");
        fprintf(fd,"index{%ld}\n",pca->nh);
        fprintf(fd,"/*!*  FILE CONTAINIG NECESSARY INFORMATION FOR POLOYGON CONNECTION  \n");
        fprintf(fd," each polygon connection array is expressed as a double array containing the following information \n");
        fprintf(fd,"polygon_index    ");

        for (l=nl;l<=nh;l++) {
                fprintf(fd,"P%ld    ",l);
                fprintf(fd,"d_P%ld    ",l);
        }
        fprintf(fd," */  \n  ");

        for (i=pca->nl;i<=pca->nh;i++){
                fprintf(fd,"\n");
                fprintf(fd,"%ld: double array connections %ld {",i,i);
                fprintf(fd,"%ld    ",i);

                for (l=nl;l<=nh;l++){
                        link_val=NULL_VALUE;
                        d_link_val=NULL_VALUE;
                        if ((l<=pca->element[i]->connections->nh) && (l>=pca->element[i]->connections->nl)) link_val=pca->element[i]->connections->element[l];
                        if ((l<=pca->element[i]->d_connections->nh) && (l>=pca->element[i]->d_connections->nl)) d_link_val=pca->element[i]->d_connections->element[l];
                        fprintf(fd,",%ld,   ",link_val);
                        fprintf(fd,"%lf    ",d_link_val);
                }
                fprintf(fd,"}");
        }


        fprintf(fd,"\n");
        fclose(fd);
        return 0;

}


int fprint_polygonconnectionattributearray(char *filename,polygon_connection_attribute_array *pca) {
        FILE *fd;
        long i,nh,nl,l,link_val;
        double d_link_val;
        nl=NL;
        nh=NL;
        for (i=pca->nl;i<=pca->nh;i++){
                if (nl>pca->element[i]->connections->nl) nl=pca->element[i]->connections->nl;
                if (nh<pca->element[i]->connections->nh) nh=pca->element[i]->connections->nh;
        }

        fd=fopen(filename,"w");
        fprintf(fd,"polygon_index    ");

        for (l=nl;l<=nh;l++) {
                fprintf(fd,"P%ld    ",l);
                fprintf(fd,"d_P%ld    ",l);
        }
        for (i=pca->nl;i<=pca->nh;i++){
                fprintf(fd,"\n");

                fprintf(fd,"%ld    ",i);

                for (l=nl;l<=nh;l++){
                        link_val=NULL_VALUE;
                        d_link_val=NULL_VALUE;
                        if ((l<=pca->element[i]->connections->nh) && (l>=pca->element[i]->connections->nl)) link_val=pca->element[i]->connections->element[l];
                        if ((l<=pca->element[i]->d_connections->nh) && (l>=pca->element[i]->d_connections->nl)) d_link_val=pca->element[i]->d_connections->element[l];
                        fprintf(fd,"%ld    ",link_val);
                        fprintf(fd,"%lf    ",d_link_val);
                }

        }


        fprintf(fd,"\n");
        fclose(fd);
        return 0;

}


int connections_symmetry(polygon_connection_attribute_array* pca, long boundary) {
        long i,j,kl,c;
        int s=1,sk; 
        for (i=pca->nl;i<=pca->nh;i++) {
                for (j=pca->element[i]->connections->nl;j<=pca->element[i]->connections->nh;j++) {
                        if (pca->element[i]->connections->element[j]!=boundary){

                                kl=pca->element[i]->connections->element[j];
                                sk=0;
                                for (c=pca->element[kl]->connections->nl;c<=pca->element[kl]->connections->nh;c++) {
                                        if (pca->element[kl]->connections->element[c]==i) sk=1;
                                }
                                if (sk==0) {
                                        s=0;
                                        printf("Error in pca: struct is not symmetric in the calls %ld , %ld      /n",i,kl);
                                }
                        }
                }
        }

        return s;

}




polygon_connection_attributes *get_connection_squares(POLYGON *polygon,POLYGONVECTOR *polygons, long boundary,long novalue, long r ,long c,LONGMATRIX *mask,short print){
        polygon_connection_attributes *pca;
        long l,s,l_po1,l_po2,icnt;
        double dist;
        long r_min,r_max,c_min,c_max; 
        long rs,cs;

        icnt=1;

        pca=(polygon_connection_attributes *)malloc((sizeof(polygon_connection_attributes)));
        if (!pca) printf("Error: polygon_connection_attributes was not allocated at %ld polygon",polygon->index);
        pca->connections=new_longvector(polygon->edge_indices->nh);
        pca->d_connections=new_doublevector(polygon->edge_indices->nh);
        initialize_longvector(pca->connections,boundary);
        initialize_doublevector(pca->d_connections,NULL_VALUE);
        r_min=fmax(r-1,mask->nrl);
        r_max=fmin(r+1,mask->nrh);
        c_min=fmax(c-1,mask->ncl);
        c_max=fmin(c+1,mask->nch);

        for (rs=r_min;rs<=r_max;rs++) {
                for (cs=c_min;cs<=c_max;cs++) {
                        l=mask->element[rs][cs];
                        if ((l!=polygon->index) && (l!=novalue)) {
                                dist=1.0;
                                l_po1=0;
                                l_po2=0;

                                s=shared_edges(polygon,polygons->element[l],NO_INTERSECTION,&l_po1,&l_po2,&dist);

                                if (s!=NO_INTERSECTION ){
                                        if (l_po1>polygon->edge_indices->nh) printf ("Error: Line %ld : (%ld for polygon %ld) Not coherent data!!! \n ",s,l_po1,polygon->index);
                                        pca->connections->element[l_po1]=polygons->element[l]->index;
                                        pca->d_connections->element[l_po1]=dist;
                        //                              printf(" pca conn. %ld %lf",pca->connections->element[l_po1],pca->d_connections->element[l_po1]);
                                }
                        }

                }
        }


        return pca;

}




polygon_connection_attribute_array *get_connection_array_squares(POLYGONVECTOR *polygons, long boundary, long novalue, LONGMATRIX *pixels, short print){

        polygon_connection_attribute_array *pca;
        long l,r,c;

        pca=new_connection_attributes(polygons->nh);
        printf ("pca Allocated!\n");

        for (r=pixels->nrl;r<=pixels->nrh;r++) {
                for (c=pixels->ncl;c<=pixels->nch;c++){
                        l=pixels->element[r][c];
                        if (l!=novalue) {
                                pca->element[l]=get_connection_squares(polygons->element[l],polygons,boundary,novalue,r,c,pixels,print);
                                if (print==1) printf ("Polygons %ld (%ld connections) of %ld !! \n",l,pca->element[l]->connections->nh,pca->nh);
                        }
                }
        }
        for(l=pca->nl;l<=pca->nh;l++){
                if (pca->element[l]==NULL) printf("Error: Polygon connections %ld  of %ld were not allocated!! \n",l,pca->nh);

        }

        if (print==1) printf (" Finished polygon_connection_array struct filling!! \n ");



        return pca;
}