Code/HumanoidRetargeter/Core/Formats/Mmd/Bullet/LinearMath/HullTriangle.cs

A small internal class representing a triangle used in convex hull computation. Inherits from int3, stores neighbor indices, an id, a vertex with maximum distance, and rise; provides methods to get or set the neighbor opposite an edge defined by two vertex indices.

Native Interop
/*
 *
 * * C# / XNA  port of Bullet (c) 2011 Mark Neale <[email protected]>

Stan Melax Convex Hull Computation
Copyright (c) 2003-2006 Stan Melax http://www.melax.com/

This software is provided 'as-is', without any express or implied warranty.
In no event will the authors be held liable for any damages arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it freely,
subject to the following restrictions:

1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
*/
// Adapted from BulletXNA 73b2e1b9: namespace isolation, no XNA rendering, one type per file.
#nullable disable
#pragma warning disable CS1591, CS0168, CS0219, CS0414, CS0660, CS0661, CS0659, CS0693, CS8981, CS0108, CS0114
using System;
using System.Collections.Generic;
using System.Diagnostics;

namespace HumanoidRetargeter.Core.Formats.Mmd.Bullet.LinearMath;

internal class HullTriangle : int3
{
	public int3 n;
	public int id;
	public int vmax;
	public float rise;
	public HullTriangle(int a, int b, int c) : base(a, b, c)
	{
		n = new int3(-1, -1, -1);
		vmax = -1;
		rise = 0.0f;
	}

	public int Neib(int a, int b)
	{
		int er = -1;
		int i;
		for (i = 0; i < 3; i++)
		{
			int i1 = (i + 1) % 3;
			int i2 = (i + 2) % 3;
			if ((At(i) == a && At(i1) == b))
				return n.At(i2);
			if ((At(i) == b && At(i1) == a))
				return n.At(i2);
		}

		{
		}

		return er;
	}

	public void Neib(int a, int b, int value)
	{
		int er = -1;
		int i;
		for (i = 0; i < 3; i++)
		{
			int i1 = (i + 1) % 3;
			int i2 = (i + 2) % 3;
			if ((At(i) == a && At(i1) == b))
			{
				n.At(i2, value);
				break;
			}

			if ((At(i) == b && At(i1) == a))
			{
				n.At(i2, value);
				break;
			}
		}
	}
}