English 中文(简体)
连接多个反恐怖线
原标题:connecting multiple anti-aliased lines together

我在维基百日ia和其他地方应用/扩展了假体编码中的“武”算法。

When drawing a sine wave it breaks down at the point where the line changes from y dominant to x dominant (or vice versa). (I did not copy the endpoint code because it looks terrible and I do not need them for my purposes. )

是否有人知道这个问题的解决办法? 如果没有,我将修改算法,以使之发挥作用。 如果有人这样作,我是很奇怪的,我知道如何解决这一问题。 如果没有全球相互了解,能否执行这些路线? 还是这样,为什么图谋实施转行和职能?

rel=“nofollow noreferer”> The pseudo code

最佳回答

我只是想对此采取后续行动,并结束。 我认为,我已从网站上张贴的算法中删除了终点代码。 然而,我犯了一个错误,没有去掉所有这些错误,这就是为什么这些界线被打破。 最后结果如下:

如果你仔细看一看,当线从占支配地位到占支配地位,反之亦然,那么强度就会急剧上升。 这还因为这个线长不到一只六餐。 我在更高的分辨率下行,然后缩小取样,将产生像Guy Sirton所建议的那样的高质量结果。 但为了我的目的,这还不够。

问题回答

如果业绩不是一个大问题,那么你可以采取更宽松的办法,制定反恐怖的路线,例如:

  • Draw the lines in a higher resolution grid (e.g. some integer multiple of your target resolution) - you ll need to adjust their thickness.
  • Downsample to your target resolution by converting each block of n x m pixels to a single pixels, e.g. by averaging the RGB values.

视你改用哪一种语言或职业介绍所而定,可以建立功能,简单地做到这一点。

或者,你可以计算每个钢材中哪一部分由你(将钢板与线混为一谈)来计算其子价,使比照该线所覆盖的六氯区域部分的六氯强度。





相关问题
How to add/merge several Big O s into one

If I have an algorithm which is comprised of (let s say) three sub-algorithms, all with different O() characteristics, e.g.: algorithm A: O(n) algorithm B: O(log(n)) algorithm C: O(n log(n)) How do ...

Grokking Timsort

There s a (relatively) new sort on the block called Timsort. It s been used as Python s list.sort, and is now going to be the new Array.sort in Java 7. There s some documentation and a tiny Wikipedia ...

Manually implementing high performance algorithms in .NET

As a learning experience I recently tried implementing Quicksort with 3 way partitioning in C#. Apart from needing to add an extra range check on the left/right variables before the recursive call, ...

Print possible strings created from a Number

Given a 10 digit Telephone Number, we have to print all possible strings created from that. The mapping of the numbers is the one as exactly on a phone s keypad. i.e. for 1,0-> No Letter for 2->...

Enumerating All Minimal Directed Cycles Of A Directed Graph

I have a directed graph and my problem is to enumerate all the minimal (cycles that cannot be constructed as the union of other cycles) directed cycles of this graph. This is different from what the ...

Quick padding of a string in Delphi

I was trying to speed up a certain routine in an application, and my profiler, AQTime, identified one method in particular as a bottleneck. The method has been with us for years, and is part of a "...

热门标签