Abstract
The algorithm presented in this work, known as the sequential edge detection algorithm
(SEDA), finds exact perimeter for a given projection of a volume mesh through the use of
vertex and edge data from the original mesh. The state of the art for determining this type of
boundary is the alpha shape technique. Alpha shapes however are only capable of
approximating the intended shape and in many cases do not represent the projection with
sufficient accuracy. The Python implementation of SEDA presented in this work introduces
localized vertex and edge searching methods to assist with mesh filtering and edge
intersection detection. The implementation demonstrates SEDA's superior quality to the
alpha-shape alternative and is able to determine the exact profile of very large and complex
meshes and is ready for general use.