lili/opennurbs
1
0
Fork 0
mirror of https://github.com/mcneel/opennurbs.git synced 2026-04-17 11:46:01 +08:00
Code Issues Packages Projects Releases Wiki Activity

Sync changes from upstream repository

Browse Source 
Co-authored-by: Andrew le Bihan <andy@mcneel.com>
Co-authored-by: Brian Gillespie <brian@mcneel.com>
Co-authored-by: Dale Lear <dalelear@mcneel.com>
Co-authored-by: Giulio Piacentino <giulio@mcneel.com>
Co-authored-by: Greg Arden <greg@mcneel.com>
Co-authored-by: Lars <lars@mcneel.com>
Co-authored-by: Lowell <lowell@mcneelcom>
Co-authored-by: Nathan Letwory <nathan@mcneel.com>
Co-authored-by: Pierre Cuvilliers <pierre@mcneel.com>
Co-authored-by: Tim Hemmelman <tim@mcneel.com>
This commit is contained in:
Bozo The Builder
2020-12-16 05:49:44 -08:00
parent 990401a8f5
commit 488533eb7a
54 changed files with 4026 additions and 898 deletions
Download Patch File Download Diff File Expand all files Collapse all files

82
opennurbs_line.cpp
View File

@@ -589,6 +589,13 @@ ON_Triangle::ON_Triangle(double x)
m_V[0] = m_V[1] = m_V[2] = p;
}
ON_Triangle::ON_Triangle(const double vertices[9])
{
m_V[0] = ON_3dPoint(vertices);
m_V[1] = ON_3dPoint(vertices ? vertices+3 : vertices);
m_V[2] = ON_3dPoint(vertices ? vertices+6 : vertices);
}
ON_Triangle::operator ON_3dPoint*()
{
return m_V;
@@ -734,7 +741,11 @@ ON_3dPoint ON_Triangle::Centroid() const
return PointAt(1.0/3.0, 1.0/3.0);
}
bool ON_Triangle::ClosestPointTo(const ON_3dPoint & P, double * s1, double * s2) const
bool ON_Triangle::GetBarycentricCoordinates(
const ON_3dPoint& P,
bool constrainInside,
double* s1, double* s2
) const
{
bool rc = false;
// Choose base vertex v[i0] is closest to P
@@ -761,53 +772,53 @@ bool ON_Triangle::ClosestPointTo(const ON_3dPoint & P, double * s1, double * s2)
// use decomposition
s[i0] = 1 - s[(i0 + 1) % 3] - s[(i0 + 2) % 3];
for (int i = 0; i < 3; i++)
{
if (s[i] < 0)
{
double t;
if (Edge(i).ClosestPointTo(P, &t))
{
s = ON_3dPoint( 0,0,0 );
if (t < 0)
{
s[(i + 1) % 3] = 1.0;
}
if (constrainInside)
for (int i = 0; i < 3; i++)
if (s[i] < 0)
{
double t;
if (Edge(i).ClosestPointTo(P, &t))
{
s = ON_3dPoint( 0,0,0 );
if (t < 0)
{
s[(i + 1) % 3] = 1.0;
}
else if (t >= 1.0)
{
s[(i + 2) % 3] = 1.0;
}
else
{
s[(i + 1) % 3] = 1 - t;
s[(i + 2) % 3] = t;
}
}
break;
}
}
else if (t >= 1.0)
{
s[(i + 2) % 3] = 1.0;
}
else
{
s[(i + 1) % 3] = 1 - t;
s[(i + 2) % 3] = t;
}
}
break;
}
rc = true;
}
else
{
// decomposition failed:
// Find closest point to longest edge i0
double max = -1;
for (int i = 0; i < 3; i++)
double max = Edge(0).Direction().LengthSquared();
i0 = 0;
for (int i = 1; i < 3; i++)
{
double len = Edge(i).Length();
if (len > max)
double lensq = Edge(i).Direction().LengthSquared();
if (max < lensq)
{
i0 = 0;
max = len;
i0 = i;
max = lensq;
}
}
double t;
if (Edge(i0).ClosestPointTo(P, &t))
{
s[(i0 + 1) % 3] = (1 - t);
s[(i0 + 1) % 3] = t;
s[(i0 + 2) % 3] = t;
rc = true;
}
@@ -819,6 +830,11 @@ bool ON_Triangle::ClosestPointTo(const ON_3dPoint & P, double * s1, double * s2)
return rc;
}
bool ON_Triangle::ClosestPointTo(const ON_3dPoint & P, double * s1, double * s2) const
{
return GetBarycentricCoordinates(P, true, s1, s2);
}
ON_3dPoint ON_Triangle::ClosestPointTo(const ON_3dPoint& P) const
{