Extension of the edge tracing algorithm to disconnected Voronoi skeletons

One of the ways how to describe spatial relations among balls in Euclidean space is to use an additively weighted Voronoi diagram, where each ball has a region of closest points assigned to it. The boundary of regions is formed by non‐linear faces, edges and vertices. Edges and vertices form a skeleton of the diagram. An edge tracing algorithm exists, which finds an initial vertex and then traces edges until the whole component is discovered. The problem is that the skeleton can have more components but the algorithm does not necessarily discover them all. We introduce an extension of the edge tracing algorithm to discover all components.