Linear-time algorithms for sorting vertices in polygon contours
- by Cheery
I figured out an algorithm that lets me turn my holed polygons into trapezoids in linear time if I have vertex indices sorted from lowest coordinate to highest.
I get simple polygons as contours. They have certain order that might be exploited most of the time.
So giving these conditions, is there a near-linear-time algorithm on sorting?