[cairo] performance of cairo in a larger application

[Mathieu Lacage]

On Wed, 2004-07-28 at 16:09, Carl Worth wrote:
> On Wed, 28 Jul 2004 08:04:33 +0200, Mathieu Lacage wrote:
> > On Tue, 2004-07-27 at 16:15, Carl Worth wrote:
> > > 1) Keith and I are involved in a rewrite of the tessellation and
> > >    rasterization stages right now. We're doing this to make it correct
> > >    and more robust, but it looks like the new version will also be a
> > >    fair amount faster.
> > 
> > Where does this new code live ? Although I cannot promiss to contribute
> > code, I would be definitely be interested in reading it and maybe
> > commenting on it.
> 
> For tessellation, the algorithm is straight from a paper by John Hobby:
> 
> 	http://cm.bell-labs.com/cm/cs/doc/93/2-27.ps.gz
> 
>         [Hobby93c] John D. Hobby, Practical Segment Intersection with
>         Finite Precision Output, Computation Geometry Theory and
>         Applications, 13(4), 1999.

I suspected that :) I can clearly remember the large comments in the
current tessellation algorithm sources which refer to that paper.

> 
> The prototype we have so far is written in nickle, and is in the
> src/tess module within the CVS tree at keithp.com. As we finish it and
> port it to C it will appear in cairo of course.

I will look into it.

regards,
Mathieu
-- 
Mathieu Lacage <mathieu.lacage at sophia.inria.fr>