Quaoar wrote: ↑Sun Aug 13, 2017 12:30 pm

Looks awesome!

I might have misled you. The scenario I laid out in the preceding post was just a 'use case' example . I did NOT use my algorithm on that model in the pictures.

Quaoar wrote: ↑Sun Aug 13, 2017 12:30 pm

Have you implemented this algorithm based on Euler operators?

Don't know anything about euler operators, so no

Quaoar wrote: ↑Sun Aug 13, 2017 12:30 pm

Do you have a repository for your algorithm?

No I don't. It is currently intertwined with a couple of other personal projects, so it is not easy to separate. I really haven't done anything elegant. The basic process.

find open boundary.

intersect geometry of all boundary faces to curves.

intersect all curves to vertices.

use Euler characteristic to eliminate invalid curves and vertices until 1 solution for each boundary face.

Here is a reference picture and I have attached the svg it was created from.

- openBoundConceptGraph3.png (193.03 KiB) Viewed 1941 times