[Cairo] The complexity problem in the spline stroking algorithm

Soeren Sandmann sandmann at daimi.au.dk
Tue Aug 26 11:26:36 PDT 2003

Carl Worth <cworth at east.isi.edu> writes:

> The current implementation first computes the polygonal boundary of
> the desired shape. Then this polygon is passed to
> _cairo_traps_tessellate_polygon. That function is O(n^2), (or so), and
> is the call we want to be able to remove.

I actually thought polygon triangulation could be done in O(n log n)?


More information about the cairo mailing list