Talk:Divide a rectangle into a number of unequal triangles: Difference between revisions
Content added Content deleted
| Line 17: | Line 17: | ||
==Work in pixels?== |
==Work in pixels?== |
||
Fairly obviously if the vertices can be defined using (ir)rational numbers then (as long as at least one exists, aka n>=3) there are an infinite number of possible solutions.<br> If instead every point has to be an exact pixel (or grid vertex) then there are a finite number of solutions, manageable and countable at least for relatively small rectangle sizes and n, and that opens up the possiblility of finding all of them rather than being constrained to one or two methods. Determining non-similarity when none of the sides are horizontal/vertical might be a little bit more challenging? Maybe it could just rely on all areas/ |
Fairly obviously if the vertices can be defined using (ir)rational numbers then (as long as at least one exists, aka n>=3) there are an infinite number of possible solutions.<br> If instead every point has to be an exact pixel (or grid vertex) then there are a finite number of solutions, manageable and countable at least for relatively small rectangle sizes and n, and that opens up the possiblility of finding all of them rather than being constrained to one or two methods. Determining non-similarity when none of the sides are horizontal/vertical might be a little bit more challenging? Maybe it could just rely on all areas and/or angles differing by at least some given epsilon? I doubt there is any real-world need for a "fast find any" so making this a "slow find all" should not be an issue. --[[User:Petelomax|Pete Lomax]] ([[User talk:Petelomax|talk]]) 12:35, 19 December 2021 (UTC) |
||