diff options
| author | Anuj Verma <anujv@iitbhilai.ac.in> | 2020-07-31 17:47:39 +0530 |
|---|---|---|
| committer | anujverma <anujv@iitbhilai.ac.in> | 2020-08-02 16:33:21 +0530 |
| commit | 185c88905e3282b640feb78ccace3a5ebe1adc4e (patch) | |
| tree | 94a4e3614a8ad3aa6c9210bf27c575e4e24a27b3 | |
| parent | 62b38d2b8541b46d02ac64c3b98448ceb6b77733 (diff) | |
| download | freetype2-185c88905e3282b640feb78ccace3a5ebe1adc4e.tar.gz | |
* src/sdf/ftbsdf.c (compute_edge_distance): Grammer fix.
| -rw-r--r-- | [GSoC]ChangeLog | 4 | ||||
| -rw-r--r-- | src/sdf/ftbsdf.c | 5 |
2 files changed, 7 insertions, 2 deletions
diff --git a/[GSoC]ChangeLog b/[GSoC]ChangeLog index ddb4a9178..4570ca395 100644 --- a/[GSoC]ChangeLog +++ b/[GSoC]ChangeLog @@ -1,5 +1,9 @@ 2020-07-31 Anuj Verma <anujv@iitbhilai.ac.in> + * src/sdf/ftbsdf.c (compute_edge_distance): Grammer fix. + +2020-07-31 Anuj Verma <anujv@iitbhilai.ac.in> + [sdf -> bsdf] Add explanation of the approximation. * src/sdf/ftbsdf.c (compute_gradient => compute_edge_distance): diff --git a/src/sdf/ftbsdf.c b/src/sdf/ftbsdf.c index e26f18cb7..696d54999 100644 --- a/src/sdf/ftbsdf.c +++ b/src/sdf/ftbsdf.c @@ -187,11 +187,12 @@ /* distance of the pixel to edge pretty accurately. A real */ /* simple approximation is ( 0.5f - alpha ), assuming that */ /* the outline is parallel to the x or y axis. But in this */ - /* algorithm that is pretty accurate the edge distance. */ + /* algorithm we use a different approximation which is qui- */ + /* te accurate even for non axis aligned edges. */ /* */ /* * The only remaining piece of information that we cannot */ /* approximate directly from the alpha is the direction of */ - /* the edge. That is where we use the Sobel's operator to */ + /* the edge. This is where we use the Sobel's operator to */ /* compute the gradient of the pixel. The gradient give us */ /* a pretty good approximation of the edge direction. */ /* We use a 3x3 kernel filter to compute the gradient. */ |