c434782e3a
Use a shorter/simpler license convention, stops the header taking so much space. Follow the SPDX license specification: https://spdx.org/licenses - C/C++/objc/objc++ - Python - Shell Scripts - CMake, GNUmakefile While most of the source tree has been included - `./extern/` was left out. - `./intern/cycles` & `./intern/atomic` are also excluded because they use different header conventions. doc/license/SPDX-license-identifiers.txt has been added to list SPDX all used identifiers. See P2788 for the script that automated these edits. Reviewed By: brecht, mont29, sergey Ref D14069
88 lines
2.3 KiB
C
88 lines
2.3 KiB
C
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2001-2002 NaN Holding BV. All rights reserved. */
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
*/
|
|
|
|
#include "DNA_vec_types.h"
|
|
|
|
#include "BLI_math.h"
|
|
#include "BLI_strict_flags.h"
|
|
|
|
#include "BLI_lasso_2d.h" /* own include */
|
|
|
|
void BLI_lasso_boundbox(rcti *rect, const int mcoords[][2], const unsigned int mcoords_len)
|
|
{
|
|
unsigned int a;
|
|
|
|
rect->xmin = rect->xmax = mcoords[0][0];
|
|
rect->ymin = rect->ymax = mcoords[0][1];
|
|
|
|
for (a = 1; a < mcoords_len; a++) {
|
|
if (mcoords[a][0] < rect->xmin) {
|
|
rect->xmin = mcoords[a][0];
|
|
}
|
|
else if (mcoords[a][0] > rect->xmax) {
|
|
rect->xmax = mcoords[a][0];
|
|
}
|
|
if (mcoords[a][1] < rect->ymin) {
|
|
rect->ymin = mcoords[a][1];
|
|
}
|
|
else if (mcoords[a][1] > rect->ymax) {
|
|
rect->ymax = mcoords[a][1];
|
|
}
|
|
}
|
|
}
|
|
|
|
bool BLI_lasso_is_point_inside(const int mcoords[][2],
|
|
const unsigned int mcoords_len,
|
|
const int sx,
|
|
const int sy,
|
|
const int error_value)
|
|
{
|
|
if (sx == error_value || mcoords_len == 0) {
|
|
return false;
|
|
}
|
|
|
|
const int pt[2] = {sx, sy};
|
|
return isect_point_poly_v2_int(pt, mcoords, mcoords_len, true);
|
|
}
|
|
|
|
bool BLI_lasso_is_edge_inside(const int mcoords[][2],
|
|
const unsigned int mcoords_len,
|
|
int x0,
|
|
int y0,
|
|
int x1,
|
|
int y1,
|
|
const int error_value)
|
|
{
|
|
|
|
if (x0 == error_value || x1 == error_value || mcoords_len == 0) {
|
|
return false;
|
|
}
|
|
|
|
const int v1[2] = {x0, y0}, v2[2] = {x1, y1};
|
|
|
|
/* check points in lasso */
|
|
if (BLI_lasso_is_point_inside(mcoords, mcoords_len, v1[0], v1[1], error_value)) {
|
|
return true;
|
|
}
|
|
if (BLI_lasso_is_point_inside(mcoords, mcoords_len, v2[0], v2[1], error_value)) {
|
|
return true;
|
|
}
|
|
|
|
/* no points in lasso, so we have to intersect with lasso edge */
|
|
|
|
if (isect_seg_seg_v2_int(mcoords[0], mcoords[mcoords_len - 1], v1, v2) > 0) {
|
|
return true;
|
|
}
|
|
for (unsigned int a = 0; a < mcoords_len - 1; a++) {
|
|
if (isect_seg_seg_v2_int(mcoords[a], mcoords[a + 1], v1, v2) > 0) {
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|