Hide text Hide pseudo-code | |

The need to traverse a polygon is typical in many applications. Berg et al. present a way to traverse a polygon set stored using DCEL without using extra storage space for the algorithm. Polygons are ordered into a list to determine the traversing order. List is build by choosing an entry edge for every polygon. Each time an entry polygon is encountered a new polygon is entered. This way all polygons can be visited exatly once. The task is to find the entry half edges and traverse the network in correct order. Entries can be found when find entry button is selected. Traversal can proceed when Traverse button is selected. | |