e955c94ed3
Listing the "Blender Foundation" as copyright holder implied the Blender Foundation holds copyright to files which may include work from many developers. While keeping copyright on headers makes sense for isolated libraries, Blender's own code may be refactored or moved between files in a way that makes the per file copyright holders less meaningful. Copyright references to the "Blender Foundation" have been replaced with "Blender Authors", with the exception of `./extern/` since these this contains libraries which are more isolated, any changed to license headers there can be handled on a case-by-case basis. Some directories in `./intern/` have also been excluded: - `./intern/cycles/` it's own `AUTHORS` file is planned. - `./intern/opensubdiv/`. An "AUTHORS" file has been added, using the chromium projects authors file as a template. Design task: #110784 Ref !110783.
108 lines
3.1 KiB
C++
108 lines
3.1 KiB
C++
/* SPDX-FileCopyrightText: 2020 Blender Authors
|
|
*
|
|
* SPDX-License-Identifier: GPL-2.0-or-later */
|
|
|
|
/** \file
|
|
* \ingroup intern_rigidbody
|
|
*/
|
|
|
|
#include "LinearMath/btConvexHullComputer.h"
|
|
#include "RBI_hull_api.h"
|
|
|
|
plConvexHull plConvexHullCompute(float (*coords)[3], int count)
|
|
{
|
|
btConvexHullComputer *computer = new btConvexHullComputer;
|
|
computer->compute(reinterpret_cast<float *>(coords), sizeof(*coords), count, 0, 0);
|
|
return reinterpret_cast<plConvexHull>(computer);
|
|
}
|
|
|
|
void plConvexHullDelete(plConvexHull hull)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
delete computer;
|
|
}
|
|
|
|
int plConvexHullNumVertices(plConvexHull hull)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
return computer->vertices.size();
|
|
}
|
|
|
|
int plConvexHullNumLoops(plConvexHull hull)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
return computer->edges.size();
|
|
}
|
|
|
|
int plConvexHullNumFaces(plConvexHull hull)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
return computer->faces.size();
|
|
}
|
|
|
|
void plConvexHullGetVertex(plConvexHull hull, int n, float coords[3], int *original_index)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
const btVector3 &v(computer->vertices[n]);
|
|
coords[0] = v[0];
|
|
coords[1] = v[1];
|
|
coords[2] = v[2];
|
|
(*original_index) = computer->original_vertex_index[n];
|
|
}
|
|
|
|
void plConvexHullGetLoop(plConvexHull hull, int n, int *v_from, int *v_to)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
(*v_from) = computer->edges[n].getSourceVertex();
|
|
(*v_to) = computer->edges[n].getTargetVertex();
|
|
}
|
|
|
|
int plConvexHullGetReversedLoopIndex(plConvexHull hull, int n)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
return computer->edges[n].getReverseEdge() - &computer->edges[0];
|
|
}
|
|
|
|
int plConvexHullGetFaceSize(plConvexHull hull, int n)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
const btConvexHullComputer::Edge *e_orig, *e;
|
|
int count;
|
|
|
|
for (e_orig = &computer->edges[computer->faces[n]], e = e_orig, count = 0;
|
|
count == 0 || e != e_orig;
|
|
e = e->getNextEdgeOfFace(), count++)
|
|
{
|
|
;
|
|
}
|
|
return count;
|
|
}
|
|
|
|
void plConvexHullGetFaceLoops(plConvexHull hull, int n, int *loops)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
const btConvexHullComputer::Edge *e_orig, *e;
|
|
int count;
|
|
|
|
for (e_orig = &computer->edges[computer->faces[n]], e = e_orig, count = 0;
|
|
count == 0 || e != e_orig;
|
|
e = e->getNextEdgeOfFace(), count++)
|
|
{
|
|
loops[count] = e - &computer->edges[0];
|
|
}
|
|
}
|
|
|
|
void plConvexHullGetFaceVertices(plConvexHull hull, int n, int *vertices)
|
|
{
|
|
btConvexHullComputer *computer(reinterpret_cast<btConvexHullComputer *>(hull));
|
|
const btConvexHullComputer::Edge *e_orig, *e;
|
|
int count;
|
|
|
|
for (e_orig = &computer->edges[computer->faces[n]], e = e_orig, count = 0;
|
|
count == 0 || e != e_orig;
|
|
e = e->getNextEdgeOfFace(), count++)
|
|
{
|
|
vertices[count] = e->getTargetVertex();
|
|
}
|
|
}
|