A lot of files were missing copyright field in the header and
the Blender Foundation contributed to them in a sense of bug
fixing and general maintenance.
This change makes it explicit that those files are at least
partially copyrighted by the Blender Foundation.
Note that this does not make it so the Blender Foundation is
the only holder of the copyright in those files, and developers
who do not have a signed contract with the foundation still
hold the copyright as well.
Another aspect of this change is using SPDX format for the
header. We already used it for the license specification,
and now we state it for the copyright as well, following the
FAQ:
https://reuse.software/faq/
89 lines
2.2 KiB
C
89 lines
2.2 KiB
C
/* SPDX-FileCopyrightText: 2001-2002 NaN Holding BV. All rights reserved.
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
/** \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 uint mcoords_len)
|
|
{
|
|
uint 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 uint 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 uint 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 (uint 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;
|
|
}
|