Linear-time algorithms for sorting vertices in polygon contours

Posted by Cheery on Stack Overflow See other posts from Stack Overflow or by Cheery
Published on 2010-05-12T06:18:12Z Indexed on 2010/05/12 6:24 UTC
Read the original article Hit count: 222

Filed under:
|
|
|

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?

© Stack Overflow or respective owner

Related posts about c

    Related posts about sorting