I am looking for an example implementation or pseudo-code of a multi-stage bevel for a half-edge data structure. A single edge is simple, but several edges at once ... I tried several hours now without success. I am only struggling with topological changes, pushing the peaks forward is not so difficult. Basically, I am looking for an algorithm on how to go from the left grid to the right grid in a half-edge data structure:

Can someone point me to a paper, a book or an example of a polyhedral bevel?
source
share