Profiling using the connection of intersection lines from triangle soup

摘要

We propose an algorithm profiling mesh geometry which consists of triangle soup. Our profile is set of polygons in vector format. We construct a profile by calculating intersection lines from each triangle and profiling plane, and connect the lines. To avoid singularity problem, we classified configurations of triangle and the plane, and process it individually. Our implementation showed that the algorithm well captures profile polygons.