Home » Developing U++ » U++ Developers corner » Funny way how NOT to speedup sorting of small arrays
| Re: Funny way how NOT to speedup sorting of small arrays [message #19912 is a reply to message #19911] |
Sun, 01 February 2009 18:17   |
 |
mirek
Messages: 14255
Registered: November 2005
|
Ultimate Member |
|
|
| Mindtraveller wrote on Sun, 01 February 2009 10:59 |
| luzr wrote on Sun, 01 February 2009 13:30 |
One of critical issues in polygon rasterizer (which I could not resist to work on in the end)
|
Mirek, so you started working on image<->polygon converter as polygonized Da Vinci`s Mona Liza you`ve shown some time ago? 
|
Well, I rather got tired of AGG bugs, design problems and limitations and (re)started new 2D sw renderer ("Painter 2.0") from scratch.
But heavily mining AGG sources - but I feel no shame, as AGG heavily mined others - it is actually funny to trace the code back - the bread and butter of AGG, antialiased polygon renderer, is based on Freetype code, which in turn is based on LibArt code.
That said, I am not sure whether the polygon rasterizing algorithm was invented by Raph Levien of LibArt, but if it was, he is really really smart guy.
Mirek
|
|
|
|
Current Time: Sun Apr 27 22:13:21 CEST 2025
Total time taken to generate the page: 0.00733 seconds
|
Members
Pages
Help
Register
Login
Home
