We show an efficient algorithm for generating geodesic regular tree structures for periodic hyperbolic and Euclidean tessellations, and experimentally verify its performance on tessellations. This
This data contains algorithm performance data on variant problems for our paper: ASOC-D-20-02502_R1 'On the Diversity and Robustness of Multi-Objective Test Suites'. There are several new instances (v
The evaluation table consists of three features; the area of the expert-annotated polygons, the area of the automatically detected contours, and the Intersection-over-Union (IOU) as a measure of segme