public static List <List <int> > getBoundaryLoop(ref Mesh rhinoMesh)
{
if (rhinoMesh == null)
{
throw new ArgumentNullException(nameof(rhinoMesh));
}
// initialize the pointer and pass data
int nF = rhinoMesh.Faces.Count;
int numEle = 3 * rhinoMesh.Vertices.Count * 20;
// copy data into the IntPtr
//float[] V = rhino_mesh.Vertices.ToFloatArray();
int[] F = rhinoMesh.Faces.ToIntArray(true);
IntPtr meshF = Marshal.AllocHGlobal(Marshal.SizeOf(F[0]) * F.Length);
Marshal.Copy(F, 0, meshF, F.Length);
// assume each vert has most 10 neighbours
IntPtr boundLoopFromCpp = Marshal.AllocHGlobal(Marshal.SizeOf(typeof(int)) * numEle);
// call the c++ func
int sz;
CppIGL.igl_boundary_loop(meshF, nF, boundLoopFromCpp, out sz);
int[] processedBoundLoop = new int[numEle];
Marshal.Copy(boundLoopFromCpp, processedBoundLoop, 0, numEle);
// free memory
Marshal.FreeHGlobal(meshF);
Marshal.FreeHGlobal(boundLoopFromCpp);
List <List <int> > boundLoop = new List <List <int> >();
int cnt = 0;
while (cnt < sz)
{
int num = processedBoundLoop[cnt];
cnt++;
List <int> transferLst = new List <int>();
for (int i = 0; i < num; i++)
{
transferLst.Add(processedBoundLoop[cnt++]);
}
boundLoop.Add(transferLst);
}
// compute from cpp side.
return(boundLoop);
}
public static List <float> getLapacianScalar(ref Mesh rhinoMesh, ref List <int> con_idx, ref List <double> con_val)
{
if (rhinoMesh == null)
{
throw new ArgumentNullException(nameof(rhinoMesh));
}
float[] V = rhinoMesh.Vertices.ToFloatArray();
int[] F = rhinoMesh.Faces.ToIntArray(true);
int nV = rhinoMesh.Vertices.Count;
int nF = rhinoMesh.Faces.Count;
// data transformation and memory allocation
IntPtr meshV = Marshal.AllocHGlobal(Marshal.SizeOf(V[0]) * V.Length);
IntPtr meshF = Marshal.AllocHGlobal(Marshal.SizeOf(F[0]) * F.Length);
IntPtr conIdx = Marshal.AllocHGlobal(Marshal.SizeOf(con_idx[0]) * con_idx.Count);
IntPtr conVal = Marshal.AllocHGlobal(Marshal.SizeOf(con_val[0]) * con_val.Count);
Marshal.Copy(V, 0, meshV, V.Length);
Marshal.Copy(F, 0, meshF, F.Length);
Marshal.Copy(con_idx.ToArray(), 0, conIdx, con_idx.Count);
Marshal.Copy(con_val.ToArray(), 0, conVal, con_val.Count);
// since we don't know the # of pts in a isoLine, let's assme # = V at most
int assumedDataNum = Marshal.SizeOf(typeof(float)) * 3 * nV;
IntPtr laplacianValue = Marshal.AllocHGlobal(assumedDataNum / 3);
//CppIGL
CppIGL.computeLaplacian(meshV, nV, meshF, nF, conIdx, conVal, con_idx.Count, laplacianValue);
// process returned data
float[] processedScalarValue = new float[nV];
Marshal.Copy(laplacianValue, processedScalarValue, 0, nV);
List <float> laplacianV = new List <float>();
for (int i = 0; i < nV; i++)
{
laplacianV.Add(processedScalarValue[i]);
}
// free memory
Marshal.FreeHGlobal(meshV);
Marshal.FreeHGlobal(meshF);
Marshal.FreeHGlobal(conIdx);
Marshal.FreeHGlobal(conVal);
Marshal.FreeHGlobal(laplacianValue);
return(laplacianV);
}
public static List <List <int> > getAdjacencyLst(ref Mesh rhinoMesh)
{
// initialize the pointer and pass data
int nF = rhinoMesh.Faces.Count;
int numEle = 3 * rhinoMesh.Vertices.Count * 20;
// copy data into the IntPtr
//float[] V = rhino_mesh.Vertices.ToFloatArray();
int[] F = rhinoMesh.Faces.ToIntArray(true);
IntPtr meshF = Marshal.AllocHGlobal(Marshal.SizeOf(F[0]) * F.Length);
Marshal.Copy(F, 0, meshF, F.Length);
// assume each vert has most 10 neighbours
IntPtr adjLstFromCpp = Marshal.AllocHGlobal(Marshal.SizeOf(typeof(int)) * numEle);
// call the c++ func
int sz;
CppIGL.igl_adjacency_list(meshF, nF, adjLstFromCpp, out sz);
int[] processedAdjLst = new int[numEle];
Marshal.Copy(adjLstFromCpp, processedAdjLst, 0, numEle);
// free memory
Marshal.FreeHGlobal(meshF);
Marshal.FreeHGlobal(adjLstFromCpp);
List <List <int> > adjLst = new List <List <int> >();
int cnt = 0;
while (cnt < sz)
{
int num = processedAdjLst[cnt];
cnt++;
List <int> transferLst = new List <int>();
for (int i = 0; i < num; i++)
{
transferLst.Add(processedAdjLst[cnt++]);
}
adjLst.Add(transferLst);
}
// compute from cpp side.
return(adjLst);
}
public static List <List <Point3d> > getIsolinePts(ref Mesh rhinoMesh, ref List <int> con_idx, ref List <double> con_val, int divN)
{
float[] V = rhinoMesh.Vertices.ToFloatArray();
int[] F = rhinoMesh.Faces.ToIntArray(true);
int nV = rhinoMesh.Vertices.Count;
int nF = rhinoMesh.Faces.Count;
// data transformation and memory allocation
IntPtr meshV = Marshal.AllocHGlobal(Marshal.SizeOf(V[0]) * V.Length);
IntPtr meshF = Marshal.AllocHGlobal(Marshal.SizeOf(F[0]) * F.Length);
IntPtr conIdx = Marshal.AllocHGlobal(Marshal.SizeOf(con_idx[0]) * con_idx.Count);
IntPtr conVal = Marshal.AllocHGlobal(Marshal.SizeOf(con_val[0]) * con_val.Count);
Marshal.Copy(V, 0, meshV, V.Length);
Marshal.Copy(F, 0, meshF, F.Length);
Marshal.Copy(con_idx.ToArray(), 0, conIdx, con_idx.Count);
Marshal.Copy(con_val.ToArray(), 0, conVal, con_val.Count);
// since we don't know the # of pts in a isoLine, let's assme # = V at most
int assumedDataNum = Marshal.SizeOf(typeof(float)) * 3 * nV;
IntPtr isoLinePts = Marshal.AllocHGlobal(assumedDataNum);
IntPtr numPtsEachLst = Marshal.AllocHGlobal(Marshal.SizeOf(typeof(int)) * divN);
//CppIGL
CppIGL.extractIsoLinePts(meshV, nV, meshF, nF, conIdx, conVal, con_idx.Count, divN, isoLinePts, numPtsEachLst);
// process returned data
int[] processedNumPtsLst = new int[divN];
Marshal.Copy(numPtsEachLst, processedNumPtsLst, 0, divN);
int totalNumPts = 0;
for (int i = 0; i < divN; i++)
{
totalNumPts += processedNumPtsLst[i];
}
float[] processedIsoLine = new float[Marshal.SizeOf(typeof(float)) * 3 * nV * divN];
Marshal.Copy(isoLinePts, processedIsoLine, 0, totalNumPts * 3);
// free memory
Marshal.FreeHGlobal(meshV);
Marshal.FreeHGlobal(meshF);
Marshal.FreeHGlobal(conIdx);
Marshal.FreeHGlobal(conVal);
Marshal.FreeHGlobal(numPtsEachLst);
Marshal.FreeHGlobal(isoLinePts);
List <List <Point3d> > isolst = new List <List <Point3d> >();
int ptCnt = 0;
for (int i = 0; i < divN; i++)
{
int sz = processedNumPtsLst[i];
List <Point3d> ptLst = new List <Point3d>();
for (int j = 0; j < sz; j++)
{
ptLst.Add(new Point3d(processedIsoLine[ptCnt * 3],
processedIsoLine[ptCnt * 3 + 1],
processedIsoLine[ptCnt * 3 + 2]));
ptCnt++;
}
isolst.Add(ptLst);
}
return(isolst);
}
/// <summary>
/// Sums two numbers
/// </summary>
public static double Sum(double a, double b)
{
return(CppIGL.Add(a, b));
}
