Ungvichian,V., Kanongchaiyos,P.
Abstract:
This work in progress describes an algorithm to find "thin points" in a solid represented as an Abstract Cellular Complex, for example, to find its weakest points. The algorithm is mostly iterative, adding one face at a time to a set of previously selected faces, and choosing the selections that produce the loops with the shortest lengths for the next iteration. The output from the algorithm is a set of loops that indicate the thinnest portions of the solid. The results indicate that, while the algorithm does have some degree of accuracy, its effectiveness can still be vastly improved. Also, as implemented, the algorithm allows a threshold to be set to limit the number of loops that are selected in each iteration. The results indicate that increasing the threshold also increases the accuracy, but also increases execution time.