Hacker News Reader

Very cool! How much is it affected by the method of new pin selection after each time we add a line? I.e. currently you are doing oldPin = bestPin, and the first pin is selected at random... wouldn't it be better to just add lines based on a Hough transform (with rounding to the nearest pins) - starting from the line which covers the maximum number of points, and going down?

View on HN

The current implementation is very similar to a hough transform limited to 1 dimension (the angle). Your approach would allow a little more variation and thus a better image. In practice this would however mean one would have to retie the thread at both the start and the end of every line.

You are right, I didn't really think about the practical implications. oldPin = bestPin makes a lot more sense now :) Thanks.

could maybe guide it around neighboring pins to get to the next optimal start pin instead, at least for some amount.

Reply on news.ycombinator.com