fdo-mirrors/cairo
1
0
Fork 0
mirror of https://gitlab.freedesktop.org/cairo/cairo.git synced 2026-05-05 00:38:06 +02:00
Code Issues Projects Releases Packages Wiki Activity Actions

Add references to the skiplist paper

Browse source
This commit is contained in:
Behdad Esfahbod 2007-04-08 22:56:30 -04:00
parent ad0e13805c
commit 9da86e4a38
2 changed files with 14 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
BIBLIOGRAPHY
View file

@ -60,6 +60,14 @@ algorithm for robustness against edges being "bent" due to restricting
intersection coordinates to the grid available by finite-precision
arithmetic. This is one algorithm we have not implemented yet.
We use a data-structure called Skiplists in the our implementation
of Bentley-Ottmann:
W. Pugh, Skip Lists: a Probabilistic Alternative to Balanced Trees,
Communications of the ACM, vol. 33, no. 6, pp.668-676, 1990.
http://citeseer.ist.psu.edu/pugh90skip.html
From the result of the intersection-finding pass, we are currently
computing a tessellation of trapezoids, (the exact manner is
undergoing some work right now with some important speedup), but we

6
src/cairo-skiplist-private.h
View file

@ -26,6 +26,12 @@
#include "cairoint.h"
/*
* Skip lists are described in detail here:
*
* http://citeseer.ist.psu.edu/pugh90skip.html
*/
#define MAX_LEVEL 31
/*