|
|
|
@ -206,9 +206,9 @@ void convexHull( InputArray _points, OutputArray _hull, bool clockwise, bool ret |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
for( i = 0; i < tl_count-1; i++ ) |
|
|
|
|
hullbuf[nout++] = pointer[tl_stack[i]] - data0; |
|
|
|
|
hullbuf[nout++] = int(pointer[tl_stack[i]] - data0); |
|
|
|
|
for( i = tr_count - 1; i > 0; i-- ) |
|
|
|
|
hullbuf[nout++] = pointer[tr_stack[i]] - data0; |
|
|
|
|
hullbuf[nout++] = int(pointer[tr_stack[i]] - data0); |
|
|
|
|
int stop_idx = tr_count > 2 ? tr_stack[1] : tl_count > 2 ? tl_stack[tl_count - 2] : -1; |
|
|
|
|
|
|
|
|
|
// lower half
|
|
|
|
@ -244,9 +244,9 @@ void convexHull( InputArray _points, OutputArray _hull, bool clockwise, bool ret |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
for( i = 0; i < bl_count-1; i++ ) |
|
|
|
|
hullbuf[nout++] = pointer[bl_stack[i]] - data0; |
|
|
|
|
hullbuf[nout++] = int(pointer[bl_stack[i]] - data0); |
|
|
|
|
for( i = br_count-1; i > 0; i-- ) |
|
|
|
|
hullbuf[nout++] = pointer[br_stack[i]] - data0; |
|
|
|
|
hullbuf[nout++] = int(pointer[br_stack[i]] - data0); |
|
|
|
|
} |
|
|
|
|
|
|
|
|
|
if( !returnPoints ) |
|
|
|
|