void enqueue_node_dense(int id, float dist)
{
GraphNodeStruct g = new GraphNodeStruct(id, -1, dist);
DenseNodes[id] = g;
DenseQueue.Insert(id, dist);
}
void enqueue_node_dense(int id, float dist, int parent_id)
{
var g = new GraphNodeStruct(id, parent_id, dist);
DenseNodes[id] = g;
DenseQueue.Insert(id, dist);
}
protected virtual void InitializeQueue()
{
int NE = mesh.EdgeCount;
int MaxEID = mesh.MaxEdgeID;
EdgeQuadrics = new QEdge[MaxEID];
EdgeQueue = new IndexPriorityQueue(MaxEID);
float[] edgeErrors = new float[MaxEID];
// vertex quadrics can be computed in parallel
gParallel.BlockStartEnd(0, MaxEID - 1, (start_eid, end_eid) => {
for (int eid = start_eid; eid <= end_eid; eid++)
{
if (mesh.IsEdge(eid))
{
Index2i ev = mesh.GetEdgeV(eid);
QuadricError Q = new QuadricError(ref vertQuadrics[ev.a], ref vertQuadrics[ev.b]);
Vector3d opt = OptimalPoint(eid, ref Q, ev.a, ev.b);
edgeErrors[eid] = (float)Q.Evaluate(ref opt);
EdgeQuadrics[eid] = new QEdge(eid, ref Q, ref opt);
}
}
});
// sorted pq insert is faster, so sort edge errors array and index map
int[] indices = new int[MaxEID];
for (int i = 0; i < MaxEID; ++i)
{
indices[i] = i;
}
Array.Sort(edgeErrors, indices);
// now do inserts
for (int i = 0; i < edgeErrors.Length; ++i)
{
int eid = indices[i];
if (mesh.IsEdge(eid))
{
QEdge edge = EdgeQuadrics[eid];
EdgeQueue.Insert(edge.eid, edgeErrors[i]);
}
}
/*
* // previous code that does unsorted insert. This is marginally slower, but
* // might get even slower on larger meshes? have only tried up to about 350k.
* // (still, this function is not the bottleneck...)
* int cur_eid = start_edges();
* bool done = false;
* do {
* if (mesh.IsEdge(cur_eid)) {
* QEdge edge = EdgeQuadrics[cur_eid];
* double err = errList[cur_eid];
* EdgeQueue.Enqueue(cur_eid, (float)err);
* }
* cur_eid = next_edge(cur_eid, out done);
* } while (done == false);
*/
}
// update queue weight for each edge in vertex one-ring
protected virtual void UpdateNeighbours(int vid)
{
foreach (int eid in mesh.VtxEdgesItr(vid))
{
Index2i nev = mesh.GetEdgeV(eid);
QuadricError Q = new QuadricError(ref vertQuadrics[nev.a], ref vertQuadrics[nev.b]);
Vector3d opt = OptimalPoint(eid, ref Q, nev.a, nev.b);
double err = Q.Evaluate(ref opt);
EdgeQuadrics[eid] = new QEdge(eid, ref Q, ref opt);
if (EdgeQueue.Contains(eid))
{
EdgeQueue.Update(eid, (float)err);
}
else
{
EdgeQueue.Insert(eid, (float)err);
}
}
}
