--- brute.cpp	2006-11-01 18:53:18.000000000 +0000
+++ brute.cpp.org	2006-11-01 18:29:54.000000000 +0000
@@ -280,7 +280,12 @@
   // This triangulation scheme could probably be better.
   for (x=0; x<res; x+=2)
   {
-    if (x<=0)
+    if (x>0)
+    {
+      indices[indexcount++] = offs+x*xadd+zadd;
+      indices[indexcount++] = offs+x*xadd;
+    }
+    else
     {
       indices[indexcount++] = offs+x*xadd;
       indices[indexcount++] = offs+x*xadd;
@@ -288,21 +293,21 @@
     }
 
     indices[indexcount++] = offs+(x+1)*xadd+zadd;
-
     if (!halfres)
       indices[indexcount++] = offs+(x+1)*xadd;
     else
       indices[indexcount++] = offs+x*xadd;
 
-
     if (x<res-2)
     {
       indices[indexcount++] = offs+(x+2)*xadd+zadd;
       indices[indexcount++] = offs+(x+2)*xadd;
     }
     else
-      {
-	   indices[indexcount++] = offs+(x+2)*xadd;
+    {
+      indices[indexcount++] = offs+(x+2)*xadd;
+      indices[indexcount++] = offs+(x+2)*xadd;
+      indices[indexcount++] = offs+(x+2)*xadd;
     }
   }
 }
@@ -310,36 +315,7 @@
 bool csTerrBlock::Split ()
 {
   int i;
-  csVector3 tmp;
-  if (vertex_data!=NULL)
-    {
-      float tmp[9];
-      int res = terr->GetBlockResolution ();
-      int half =(int)( (res-1)/2.0);
-      tmp[0]=vertex_data[0][1]; //One corner
-      tmp[1]=vertex_data[half][1]; //the center point on that side
-      tmp[2]=vertex_data[res-1][1]; //Other corner
-      tmp[3]=vertex_data[((half-1)*(res-1))+1][1]; //other center-side point
-      tmp[4]=vertex_data[((half-1)*(res-1))+half][1]; //center point
-      tmp[5]=vertex_data[((half)*(res-1))][1]; //center-side point
-      tmp[6]=vertex_data[((res-2)*(res-1))+1][1]; //3º corner
-      tmp[7]=vertex_data[((res-2)*(res-1))+half][1]; //last center-side point
-      tmp[8]=vertex_data[(res-1)*(res-1)][1]; //4º corner
-      
-      if ((tmp[0]==tmp[1])&&
-	  (tmp[1]==tmp[2])&&
-	  (tmp[2]==tmp[3])&&
-	  (tmp[3]==tmp[4])&&
-	  (tmp[4]==tmp[5])&&
-	  (tmp[5]==tmp[6])&&
-	  (tmp[6]==tmp[7])&&
-	  (tmp[7]==tmp[8]))
-	{
-	  return true; //Supposed that the all the block has the same height
-	}
 
-    }
-  
   if(!IsLeaf())
     return false;
 
@@ -1470,16 +1446,14 @@
               block_res, indices, numindices[idx],
               block_res, (block_res+1), -1);
 
-	    
+            FillEdge (l==1,
+              block_res, indices, numindices[idx], 
+              block_res*(block_res+1), -(block_res+1), 1);
+
             FillEdge (b==1, 
               block_res, indices, numindices[idx],
               block_res*(block_res+1)+block_res, -1, -(block_res+1));
 
-
-	    FillEdge (l==1,
-              block_res, indices, numindices[idx], 
-              block_res*(block_res+1), -(block_res+1), 1);
-
             mesh_indices[idx]->Release ();
           }
         }