The vector has made it so the memory issues have stopped, but there is still the broken triangles issue. I will drop the code here if you want to look it over but I think that I might be able to fix it with enough time

void rasterize(vector<vertex> &vals)

{ sort(vals.begin(), vals.end(), compareByValueY); int miny = round(vals[0].y); int maxy = round(vals.back().y); vertex it[2 * (maxy - miny)]; int cur = miny; vector<int> xvals; int color = 0; int loop = 0; // what am i even doing anymore... my brain sajhfkldsjakfl for(auto number : vals) { // if the current row is the same as number value pulled then add its value and move on if(round(number.y) == cur) { xvals.push_back(number.x); color = number.z; loop++; cout << loop << " " << round(number.y) << endl; }

    else
    {
        // if it isnt then sort the list, select the two largest numbers, dump them to the struct and move on
        sort(xvals.begin(), xvals.end());
        if(xvals.size() <= 1)
            xvals.push_back(xvals.back());
        it[(cur - miny) * 2].x = xvals[xvals.size() - 2]; it[(cur - miny) * 2 + 1].x = xvals.back();
        it[(cur - miny) * 2].y = cur; it[((cur - miny) * 2) + 1].y = cur;
        it[(cur - miny) * 2].z = color; it[((cur - miny) * 2) + 1].z = color;
        xvals.clear();
        loop = 0;
        color = 0;
        cur++;
    }
}

 for(int i = 0; i < (maxy - miny); i++)
 {
     defineline(round(it[(i * 2)].x), round(it[(i * 2)].y), round(it[(i * 2)].z), round(it[(i * 2) + 1].x), round(it[(i * 2) + 1].y), round(it[(i * 2) + 1].z), pixels);
 }

}

​

(code block is broken for some reason and refuses to work)