I've managed to compile and run your code and generate the Voroni Sphere. It is incredibly fast compared to other algorithms! Good job! Really nice implementation of the related paper.

I'm having some errors though.

indHalfEdgesToCells
Assertion failed: (common.size() == 2), function bindHalfEdgesToCells,

I've made many tests and I'm still trying to figure the problem.

I've replace the glm functions and operators but everything seems to work fine until I reach 240 sites.

Mostly I get this assertion error at:

        vector<cell_ptr> common;
        set_intersection(e->start->cells.begin(), e->start->cells.end(), e->end->cells.begin(), e->end->cells.end(), back_inserter(common));
        assert(common.size() == 2);   <---------------

but sometimes a EXC_BAD_ACCESS is happening at:

        while (potentialEdges.size() > 0)
        {
            c->halfEdges.push_back(e);
            potentialEdges.erase(find(potentialEdges.begin(), potentialEdges.end(), e)); <---------------
            e = e->next;
        }

I'm going to still try to figure that out what going on but, if you crossed a problem similar to this since you first posted the file, any help or insight would be appreciated.

Thanks

Hi,

Cool code! But is svMath.h missing?

It's included in svVoronoiCore.h but isn't in the file listing.

Hi! Can you provide a simple test / example file on how to use this?
Thanks!

svprefix.h, svmath.h both missing