| 770 | } |
| 771 | |
| 772 | float CalcShapeError(AMD_BC6H_Format& BC6H_data, float fEndPoints[MAX_SUBSETS][MAX_END_POINTS][MAX_DIMENSION_BIG], bool SkipPallet) |
| 773 | { |
| 774 | int maxPallet; |
| 775 | int subset = 0; |
| 776 | float totalError = 0.0f; |
| 777 | int region = (BC6H_data.region - 1); |
| 778 | |
| 779 | if (region == 0) |
| 780 | maxPallet = 16; |
| 781 | else |
| 782 | maxPallet = 8; |
| 783 | |
| 784 | if (!SkipPallet) |
| 785 | palitizeEndPointsF(BC6H_data, fEndPoints); |
| 786 | |
| 787 | for (int i = 0; i < MAX_SUBSET_SIZE; i++) |
| 788 | { |
| 789 | float error = 0.0f; |
| 790 | float bestError = 0.0f; |
| 791 | |
| 792 | if (region == 0) |
| 793 | { |
| 794 | subset = 0; |
| 795 | } |
| 796 | else |
| 797 | { |
| 798 | //subset 0 or subset 1 |
| 799 | subset = PARTITIONS[region][BC6H_data.d_shape_index][i]; |
| 800 | } |
| 801 | |
| 802 | // initialize bestError to the difference for first data |
| 803 | bestError = abs(BC6H_data.din[i][0] - BC6H_data.Paletef[subset][0].x) + abs(BC6H_data.din[i][1] - BC6H_data.Paletef[subset][0].y) + |
| 804 | abs(BC6H_data.din[i][2] - BC6H_data.Paletef[subset][0].z); |
| 805 | |
| 806 | // loop through the rest of the data until find the best error |
| 807 | for (int j = 1; j < maxPallet && bestError > 0; j++) |
| 808 | { |
| 809 | error = abs(BC6H_data.din[i][0] - BC6H_data.Paletef[subset][j].x) + abs(BC6H_data.din[i][1] - BC6H_data.Paletef[subset][j].y) + |
| 810 | abs(BC6H_data.din[i][2] - BC6H_data.Paletef[subset][j].z); |
| 811 | |
| 812 | if (error <= bestError) |
| 813 | bestError = error; |
| 814 | else |
| 815 | break; |
| 816 | } |
| 817 | totalError += bestError; |
| 818 | } |
| 819 | |
| 820 | return totalError; |
| 821 | } |
| 822 | |
| 823 | void ReIndexShapef(AMD_BC6H_Format& BC6H_data, int shape_indices[BC6H_MAX_SUBSETS][MAX_SUBSET_SIZE]) |
| 824 | { |
no test coverage detected