void NavMesh::BuildPointsTriangle(int width, int depth, std::function<bool (int, int)> predicate) {
for (int i=0; i<triangles.size(); i++) {
delete triangles[i];
}
triangles.clear();
navigation.clear();
collision.clear();
trianglesPerVertex.clear();
std::vector<double> outer = {
0,0,
(double)width,0,
0,(double)depth,
(double)width,(double)depth,
};
std::vector<int> segments = {
0,1,
1,3,
3,2,
2,0,
};
std::vector<double> holes;
int lastPos = width - 1;
for (int z=0; z<depth; ++z) {
int unblockPos = 0;
for (int x=0; x<width; ++x) {
bool blocked = predicate(x,z);
//if (blocked) {
// AddHole(outer, segments, holes, {(float)x,(float)z}, {1.0f, 1.0f});
//}
//continue;
if (!blocked || x == lastPos) {
int size = x - unblockPos;
if (x == lastPos ) {
size++;
}
if (size>0) {
AddHole(outer, segments, holes, {(float)unblockPos,(float)z}, {(float)size, 1.0f});
}
unblockPos = x + 1;
}
}
}
triangulateio in;
memset(&in, 0, sizeof(triangulateio));
in.numberofpoints = (int)outer.size()/2;
in.pointlist = &outer[0];
in.holelist = &holes[0];
in.numberofholes = (int)holes.size()/2;
in.segmentlist = &segments[0];
in.numberofsegments = (int)segments.size()/2;
triangulateio out;
memset(&out, 0, sizeof(triangulateio));
triangulate("zpnQ", &in, &out, (struct triangulateio *) NULL );
triangles.resize(out.numberoftriangles);
for (int i=0; i<out.numberoftriangles; i++) {
triangles[i] = new NavTriangle();
}
collision.resize(out.numberofpoints);
trianglesPerVertex.resize(out.numberofpoints);
for (int i=0; i<out.numberofpoints; i++) {
double* pos = &out.pointlist[i*2];
collision[i].x = (float)pos[0];
collision[i].y = (float)pos[1];
}
navigation = collision;
std::cout<<"-------------"<<std::endl;
for (int i=0; i<out.numberoftriangles; i++) {
int* triangleIndex = &out.trianglelist[i*3];
//std::cout<<triangle[0]<<", "<<triangle[1]<<", " <<triangle[2]<<std::endl;
NavTriangle& tri = *triangles[i];
tri.corners[0]= triangleIndex[0];
tri.corners[1]= triangleIndex[1];
tri.corners[2]= triangleIndex[2];
int* neighbor = &out.neighborlist[i*3];
tri.neighbors[1] = neighbor[0]>=0 ? triangles[neighbor[0]] : 0;
tri.neighbors[2] = neighbor[1]>=0 ? triangles[neighbor[1]] : 0;
tri.neighbors[0] = neighbor[2]>=0 ? triangles[neighbor[2]] : 0;
// std::cout<<"neightbor"<<std::endl;
// std::cout<<neighbor[0]<<", "<<neighbor[1]<<", " <<neighbor[2]<<std::endl;
}
trifree(out.pointlist);
trifree(out.neighborlist);
trifree(out.trianglelist);
TrimSmallTriangles();
Grow(navigation, -0.5f);
version++;
}
PATCH_RET_CODE Execute( byte *dest )
{
char *tmp;
#else
PATCH_RET_CODE Execute( void )
{
char tmp[4];
#if defined(__386__)
#if defined(_WPATCH)
extern MY_FILE NewFile;
#define InNew( offset ) ( Input( &NewFile, tmp, offset, \
sizeof(hole)), \
*(hole*)tmp )
#define OutNew( off, x, type ) *(type*)tmp = (x); \
Output( &NewFile, tmp, \
off, sizeof( type ) );
#else
extern byte *NewFile;
#define OutNew( off, x, type ) *(type*)(NewFile+off) = (x);
#define InNew( off ) *(hole*)(NewFile+off)
#endif
#elif defined(BDUMP)
#define InNew( offset ) 1
#define OutNew( off, x, type ) ( x )
#undef Dump
#define Dump( x ) printf x
#undef DOPROMPT
#undef DOBACKUP
#define DOPROMPT 0
#define DOBACKUP 0
#else
extern MY_FILE NewFile;
extern void Input( MY_FILE *file, void *tmp, foff off, size_t len );
#define InNew( offset ) ( Input( &NewFile, tmp, offset, \
sizeof(hole)), \
*(hole*)tmp )
extern void Output( MY_FILE *file, void *tmp, foff off, size_t len );
#define OutNew( off, x, type ) *(type*)tmp = (x); \
Output( &NewFile, tmp, \
off, sizeof( type ) );
#endif
#endif
patch_cmd cmd;
byte next;
hole diff;
foff size;
foff incr;
foff iters;
foff old_size;
foff new_size;
foff checksum;
foff new_offset;
foff old_offset;
char ch;
int havenew;
PATCH_RET_CODE ret;
PATCH_RET_CODE ret2;
#ifdef BDIFF
char *dummy = NULL;
#endif
havenew = 1;
#ifdef BDIFF
InitPatch( &dummy );
#endif
old_size = InPatch( foff );
new_size = InPatch( foff );
checksum = InPatch( foff );
ret = OpenOld( old_size, DOPROMPT, new_size, checksum );
if( ret != PATCH_RET_OKAY ) goto error1;
ret = OpenNew( new_size );
if( ret != PATCH_RET_OKAY ) goto error2;
InitHoles();
for( ;; ) {
#if defined( INSTALL_PROGRAM )
#if defined( WINNT ) || defined( WIN ) || defined( OS2 )
if( StatusCancelled() ) {
ret = PATCH_RET_CANCEL;
goto error3;
}
#endif
#endif
cmd = InPatch( patch_cmd );
if( cmd == CMD_DONE ) break;
switch( cmd ) {
case CMD_DIFFS:
new_offset = InPatch( foff );
size = InPatch( foff );
Dump(( "Different new-%8.8lx size-%8.8lx\n", new_offset, size ));
while( size != 0 ) {
OutNew( new_offset, InPatch( byte ), byte );
++new_offset;
--size;
}
break;
case CMD_SAMES:
new_offset = InPatch( foff );
old_offset = InPatch( foff );
size = InPatch( foff );
Dump(( "Similar new-%8.8lx old-%8.8lx size-%8.8lx\n",
new_offset, old_offset, size));
while( size != 0 ) {
OutNew( new_offset, InOld( old_offset ), byte );
++new_offset;
++old_offset;
--size;
}
break;
case CMD_ITER_HOLES:
new_offset = InPatch( foff );
diff = InPatch( hole );
iters = InPatch( foff );
incr = InPatch( foff );
ch = InPatch( byte );
Dump(( "IterHole new-%8.8lx diff-%8.8lx iter-%8.8lx inc-%8.8lx\n",
new_offset, diff, iters, incr ));
while( iters != 0 ) {
AddHole( new_offset, diff );
new_offset += incr;
--iters;
}
break;
case CMD_HOLES:
new_offset = InPatch( foff );
diff = InPatch( hole );
for( ;; ) {
Dump(( "Hole new-%8.8lx diff-%8.8lx\n",new_offset,diff));
AddHole( new_offset, diff );
next = InPatch( byte );
if( next == 0 ) break;
if( ( next & 0x80 ) == 0 ) {
new_offset += (foff)next & 0x7f;
} else if( ( next & 0x40 ) == 0 ) {
new_offset += ( (foff)next & 0x3f ) << 8;
new_offset += (foff)InPatch( byte );
} else {
new_offset += ( (foff)next & 0x3f ) << 16;
new_offset += (foff)InPatch(byte) << 8;
new_offset += (foff)InPatch(byte);
}
}
break;
default:
PatchError( ERR_BAD_PATCHFILE, PatchName );
ret = PATCH_BAD_PATCH_FILE;
goto error3;
}
}
ret = PATCH_RET_OKAY;
FlushHoles();
error3:
FreeHoleArray();
ret2 = CloseNew( new_size, checksum, &havenew );
if( ret == PATCH_RET_OKAY ) {
ret = ret2;
}
error2:
CloseOld( havenew && DOPROMPT, DOBACKUP );
error1:
ClosePatch();
return( ret );
}
