What's the best way to determine the sizes of the blocks to use?
jesshuifeng
Are there any edge cases in this algorithm?
winstonc
Would a binary search on block sizes be efficient?
chenruis
I'm thinking of some granularity control situation here. Also, if all centers are covered in a trig but the line still cuts a corner of the big square, would that be an edge case?
banana
Does contained inside mean the entire block is in the triangle? Or just the blocks center?
ohmygearbox
What is the run time complexity of this method with respect to # of pixels / # of triangles?
coffee
I have the same questions on block sizes and run time complexity. The efficiency here would heavily depend on having the right implementation
What's the best way to determine the sizes of the blocks to use?
Are there any edge cases in this algorithm?
Would a binary search on block sizes be efficient?
I'm thinking of some granularity control situation here. Also, if all centers are covered in a trig but the line still cuts a corner of the big square, would that be an edge case?
Does contained inside mean the entire block is in the triangle? Or just the blocks center?
What is the run time complexity of this method with respect to # of pixels / # of triangles?
I have the same questions on block sizes and run time complexity. The efficiency here would heavily depend on having the right implementation