Method ExtractPath

engine/Poseidon/Graphics/Rendering/Shape/Shape.cpp:392–561

};

Shape* Shape::ExtractPath() // optimize this shape as path lod
{
    // scan all faces
    // replace vertices with degenerate
    // create a new shape with 2-vertex (degenerate) faces
    Shape* res = new Shape;

    res->_pointToVertex.Realloc(_pointToVertex.Size());
    res->_pointToVertex.Resize(_pointToVertex.Size());
    for (int i = 0; i < res->_pointToVertex.Size(); i++)
    {
        res->_pointToVertex[i] = -1;
    }

    // first of all convert all points to their respective "merged" variants
    // find longest of the shortest edges

    float maxMerge2 = 0;
    for (Offset o = BeginFaces(); o < EndFaces(); NextFace(o))
    {
        float shortestEdge2 = 1e10;
        const Poly& face = Face(o);
        for (int v = 0, p = face.N() - 1; v < face.N(); p = v++)
        {
            Vector3Val vpos = Pos(face.GetVertex(v));
            Vector3Val ppos = Pos(face.GetVertex(p));
            float dist2 = vpos.Distance2(ppos);
            saturateMin(shortestEdge2, dist2);
        }
        if (shortestEdge2 < Square(1.5))
        {
            saturateMax(maxMerge2, shortestEdge2);
        }
    }
    maxMerge2 *= 1.01;
    LOG_DEBUG(Graphics, "  longest shortest edge {:.1f}", sqrt(maxMerge2));
    saturate(maxMerge2, Square(0.5), Square(1.5));
    // or use property from model

    AutoArray<MergedVertex> vertex;
    Temp<int> vertexReplacedBy(NPos());

    res->_pointToVertex.Realloc(_pointToVertex.Size());
    res->_pointToVertex.Resize(_pointToVertex.Size());
    for (int i = 0; i < res->_pointToVertex.Size(); i++)
    {
        res->_pointToVertex[i] = -1;
    }
    for (int i = 0; i < NPos(); i++)
    {
        Vector3Val pos = Pos(i);
        // search if the point is already present
        // check i point selection
        // check i
        int pointI = VertexToPoint(i);
        int selI = -1;
        const char* name = "";
        for (int s = 0; s < NNamedSel(); s++)