1. 11 Mar, 2022 3 commits
  2. 19 Feb, 2022 2 commits
  3. 26 Jan, 2022 1 commit
  4. 25 Jan, 2022 1 commit
  5. 16 Jan, 2022 1 commit
  6. 15 Jan, 2022 1 commit
  7. 16 Oct, 2021 1 commit
  8. 15 Oct, 2021 1 commit
  9. 14 Oct, 2021 1 commit
  10. 13 Oct, 2021 1 commit
  11. 12 Oct, 2021 1 commit
  12. 29 Jun, 2021 1 commit
  13. 08 Jun, 2021 1 commit
  14. 05 Jun, 2021 5 commits
    • Kevin Cox's avatar
      Merge branch 'no-q' into 'v1' · 26c0429b
      Kevin Cox authored
      Re-enable ifps-deploy logs for review app.
      
      See merge request !19
      26c0429b
    • Kevin Cox's avatar
    • Kevin Cox's avatar
      Update to ipfs-deploy 10. · 5a1b4b47
      Kevin Cox authored
      5a1b4b47
    • Kevin Cox's avatar
      Improve scale weighting. · 052d6c85
      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.
      052d6c85
    • Kevin Cox's avatar
      Fix {col,row}Quality debug. · d97ce0cb
      Kevin Cox authored
      d97ce0cb
  15. 30 May, 2021 1 commit
  16. 29 May, 2021 7 commits
  17. 27 May, 2021 4 commits
    • Kevin Cox's avatar
      Add (failing) test. · 03b9e049
      Kevin Cox authored
      03b9e049
    • Kevin Cox's avatar
      Improve the auto-detect algorithm. · 7a2297ed
      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.
      7a2297ed
    • Kevin Cox's avatar
      Only upload lib files. · b394f3db
      Kevin Cox authored
      b394f3db
    • Kevin Cox's avatar
      Improve edge detection. · d5d3d4ed
      Kevin Cox authored
      - Overall works better.
      - Works for light gridlines.
      d5d3d4ed
  18. 25 May, 2021 3 commits
  19. 18 May, 2021 2 commits
  20. 09 May, 2021 1 commit
  21. 08 May, 2021 1 commit