Rosetta Code

Talk:Divide a rectangle into a number of unequal triangles: Difference between revisions

Page Discussion

Talk:Divide a rectangle into a number of unequal triangles (view source)

Revision as of 15:11, 19 December 2021

915 bytes removed ,  2 years ago
m
→‎Work in pixels?: suggestion withdrawn (I like my [Phix] demo too much now...)
m (→‎Work in pixels?: suggestion withdrawn (I like my [Phix] demo too much now...))
Line 15:
 
:Similar triangles have a precise mathematical definition that is probably going too far as I think it means having the same angles, allowing rotation, flipping and scaling. Just not having the lengths of each side the same would be enough I think, so scaled triangles would not be classed as similar in this task. --[[User:Paddy3118|Paddy3118]] ([[User talk:Paddy3118|talk]]) 17:08, 18 December 2021 (UTC)
 
==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/sides/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)
Petelomax
7,794

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/318555"