StelGeodesicGrid.cpp   StelGeodesicGrid.cpp 
skipping to change at line 339 skipping to change at line 339
bool *corner_inside[12]; bool *corner_inside[12];
for(int ci=0; ci < 12; ci++) corner_inside[ci]= new bool[convex.size ()]; for(int ci=0; ci < 12; ci++) corner_inside[ci]= new bool[convex.size ()];
#else #else
bool corner_inside[12][convex.size()]; bool corner_inside[12][convex.size()];
#endif #endif
for (int h=0;h<convex.size();h++) for (int h=0;h<convex.size();h++)
{ {
const SphericalCap& half_space(convex.at(h)); const SphericalCap& half_space(convex.at(h));
for (int i=0;i<12;i++) for (int i=0;i<12;i++)
{ {
corner_inside[i][h] = half_space.contains(icosahedro const Vec3f corner = icosahedron_corners[i];
n_corners[i]); corner_inside[i][h] =
half_space.contains(Vec3d(corner[0], corner[
1], corner[2]));
} }
} }
for (int i=0;i<20;i++) for (int i=0;i<20;i++)
{ {
searchZones(0,i, searchZones(0,i,
convex,halfs_used,convex.size(), convex,halfs_used,convex.size(),
corner_inside[icosahedron_triangles[i].corners[0 ]], corner_inside[icosahedron_triangles[i].corners[0 ]],
corner_inside[icosahedron_triangles[i].corners[1 ]], corner_inside[icosahedron_triangles[i].corners[1 ]],
corner_inside[icosahedron_triangles[i].corners[2 ]], corner_inside[icosahedron_triangles[i].corners[2 ]],
inside_list,border_list,maxSearchLevel); inside_list,border_list,maxSearchLevel);
skipping to change at line 421 skipping to change at line 423
bool *edge2_inside = new bool[convex.size()]; bool *edge2_inside = new bool[convex.size()];
#else #else
bool edge0_inside[convex.size()]; bool edge0_inside[convex.size()];
bool edge1_inside[convex.size()]; bool edge1_inside[convex.size()];
bool edge2_inside[convex.size()]; bool edge2_inside[convex.size()];
#endif #endif
for (int h=0;h<halfs_used_count;h++) for (int h=0;h<halfs_used_count;h++)
{ {
const int i = halfs_used[h]; const int i = halfs_used[h];
const SphericalCap& half_space(convex.at(i)) ; const SphericalCap& half_space(convex.at(i)) ;
edge0_inside[i] = half_space.contains(t.e0); edge0_inside[i] = half_space.contains(Vec3d(
edge1_inside[i] = half_space.contains(t.e1); t.e0[0], t.e0[1], t.e0[2]));
edge2_inside[i] = half_space.contains(t.e2); edge1_inside[i] = half_space.contains(Vec3d(
t.e1[0], t.e1[1], t.e1[2]));
edge2_inside[i] = half_space.contains(Vec3d(
t.e2[0], t.e2[1], t.e2[2]));
} }
searchZones(lev,index+0, searchZones(lev,index+0,
convex,halfs_used,halfs_used_count, convex,halfs_used,halfs_used_count,
corner0_inside,edge2_inside,edge1_inside , corner0_inside,edge2_inside,edge1_inside ,
inside_list,border_list,maxSearchLevel); inside_list,border_list,maxSearchLevel);
searchZones(lev,index+1, searchZones(lev,index+1,
convex,halfs_used,halfs_used_count, convex,halfs_used,halfs_used_count,
edge2_inside,corner1_inside,edge0_inside , edge2_inside,corner1_inside,edge0_inside ,
inside_list,border_list,maxSearchLevel); inside_list,border_list,maxSearchLevel);
searchZones(lev,index+2, searchZones(lev,index+2,
 End of changes. 2 change blocks. 
5 lines changed or deleted 10 lines changed or added

This html diff was produced by rfcdiff 1.41. The latest version is available from http://tools.ietf.org/tools/rfcdiff/