- 11 Mar, 2022 3 commits
- 19 Feb, 2022 2 commits
-
-
Kevin Cox authored
- 26 Jan, 2022 1 commit
-
- 25 Jan, 2022 1 commit
-
-
Kevin Cox authored
-
- 16 Jan, 2022 1 commit
-
- 15 Jan, 2022 1 commit
-
-
WhiteSource Renovate authored
-
- 16 Oct, 2021 1 commit
-
- 15 Oct, 2021 1 commit
-
-
WhiteSource Renovate authored
-
- 14 Oct, 2021 1 commit
-
- 13 Oct, 2021 1 commit
-
-
WhiteSource Renovate authored
-
- 12 Oct, 2021 1 commit
-
- 29 Jun, 2021 1 commit
-
-
Kevin Cox authored
-
- 08 Jun, 2021 1 commit
-
-
WhiteSource Renovate authored
-
- 05 Jun, 2021 5 commits
-
-
-
Kevin Cox authored
-
Kevin Cox authored
Previously average quality was divided by the size. This means that subdividing a grid could result in an equivalent score even if the newly added cells were all zero! This is because the average would be half, but it would be divided by half less due to the small grid bonus. The only thing really protecting us was that we needed some good lines to "propose" a grid that small. This was fixed by adjusting the bonus to scale slower. The current factor was picked so that when subdividing the grid the newly considered points need to be at least half as good as the previous points. This factor sounds a bit low but it makes sense as we don't want to get hung up on some really bold lines that are part of the style instead of the grid. In general we expect the grid to be fairly consistent so we don't want to give too much preference to a small number of bold points. Fixing this factor also allowed us to consider more candidate distances. Previously lines slightly off of the real grid could trigger us considering a very small grid, over-ranking it and selecting it. Now that we have fixed that considering small grids is not very harmful. The max number of lines to consider was chosen to be slightly less than the square root of the total lines. This effectively counteracts the fact that we consider every pair of chosen lines which is `O(n^2)` resulting in the overall algorithm being less than linear with the image dimensions.
-
Kevin Cox authored
- 30 May, 2021 1 commit
-
-
Kevin Cox authored
-
- 29 May, 2021 7 commits
-
-
Kevin Cox authored
-
Kevin Cox authored
-
Kevin Cox authored
This has two main components. We de-anti-alias the line by shifting the pixel location from the middle to the edge. Secondly we try to find the largest set of lines for a given width to base the distance on. If we find two candidates far apart we can get a really good guess for line size.
-
Kevin Cox authored
-
Kevin Cox authored
-
Kevin Cox authored
-
Kevin Cox authored
-
- 27 May, 2021 4 commits
-
-
Kevin Cox authored
-
Kevin Cox authored
This works much better. The biggest issue is that it doesn't support non-integer grid sizes. I think that we can support that in the future as well but "de-aliasing" the selected edges. By finding the "center" of the line I think we can estimate non-integer sizes fairly well. Also adds some debugging views.
-
Kevin Cox authored
-
Kevin Cox authored
- Overall works better. - Works for light gridlines.
-
- 25 May, 2021 3 commits
-
-
Kevin Cox authored
-
Kevin Cox authored
This only really works for local files. Ideally we would set the `crossorigin` attribute on the `<img>` but that seems to cause requests to fail even though https://developer.mozilla.org/en-US/docs/Web/HTML/Element/img#attr-crossorigin seems to say that it should be no worse. So until I figure out what I am doing wrong I am not setting the attribe which basically prevents all URLs from auto-detecting.
-
- 18 May, 2021 2 commits
- 09 May, 2021 1 commit
-
- 08 May, 2021 1 commit
-
-
WhiteSource Renovate authored
-