The slicing algorithm is done on the STL model and it is ensured that the result is a series of simple polygons that do not intersect each other. In other words all of those polygons generate closed loops. I need to identify which of those loops are outer and inner loops. There have been some references suggesting tree depth can be used to identify external and internal loops, without any outline of the algorithm.
It would be great if anyone can point to more detailed references where the tree depth can be utilized to filter out inner and outer contour lines.
The following images will provide more information:
According to the article that I am following - a, b, e, f, and j are outer loops, while the rest are inner loops.
In the current situation, I am identifying the inner and outer loops while doing the scanline over each layer after the slicing operation. But I want to identify the inner and outer loops ahead of the scanline operation, so that I can create inner/outer offset for the identified loops and then run the scanline to generate the fill pattern.
The article that I am following is titled - "Equidistant path generation for improving scanning efficiency in layered manufacturing". I googled up and I am afraid that it is not public. I downloaded the article through the university database.