forked from mirrors/gecko-dev
2ad13433da
This modifies AddInterval in wpf-gpu-raster to try to remember the last interval it searched for so that it doesn't have to search the entire interval list for every interval added. This should take us down from O(n^2) to closer to O(n) for this phase of rasterization. Differential Revision: https://phabricator.services.mozilla.com/D163795
22 lines
912 B
Markdown
22 lines
912 B
Markdown
This is a port of the WPF hardware rasterizer code to Rust. That
|
|
rasterizer is predecessor to the Direct2D rasterizer. Direct2D still
|
|
uses a similar technique when run on hardware that does not support
|
|
Target Independent Rasterization.
|
|
|
|
Design
|
|
======
|
|
|
|
The general algorithm used for rasterization is a vertical sweep of
|
|
the shape that maintains an active edge list. The sweep is done
|
|
at a sub-scanline resolution and results in either:
|
|
1. Sub-scanlines being combined in the coverage buffer and output
|
|
as "complex scans". These are emitted as lines constructed out
|
|
of triangle strips.
|
|
2. Simple trapezoids being recognized in the active edge list
|
|
and output using a faster simple trapezoid path.
|
|
|
|
Bezier flattening is done using an approach that uses forward differencing
|
|
of the error metric to compute a flattened version that would match a traditional
|
|
adaptive recursive flattening.
|
|
|
|
|