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

=={{header|Julia}}==

The `cutrectangle` method creates a new triangle by consuming a previously created triangle by cutting it at a location determined by the ratio of two sequential primes, making for guaranteed noncongruence of all triangles thus made. The Luxor code is for the demo. See also <link>https://lynxview.com/temp/luxor-drawing.png</link>

using Luxor

using Primes

finish()

preview()

<pre>

t = Triangle(Point(200.0, 0.0), Point(150.0, 150.0), Point(105.0, 105.0))

=={{header|Perl}}==

All triangle vertices lie on the lengths and the corners and their locations are defined by ratios among two sequences with unique numbers. Since the height is the same but with different base for all triangles, none will share the area.

use warnings;

use feature 'say';

 

my @V = UnequalDivider(1000,500,7);

{{out}}

<pre>(0 500) (0 0) (352.941 500)

and penned a wee little interactive visualisation demo of it, that can be run [http://phix.x10.mx/p2js/SpliRT.htm here].

Should you find a way to make it draw similar triangles, shout out and let me know n and canvas size!

<span style="color: #000080;font-style:italic;">-- demo/rosetta/SpliRT.exw </span>

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #7060A8;">IupClose</span><span style="color: #0000FF;">()</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">if</span>

 

=={{header|Python}}==

It is assumed that the rectangle has its bottom left coordinate at (0,0) and is not rotated in the coordinate space, meaning that the location of the top-right corner of the rectangle is then enough to define it.

 

import random

from typing import List, Union, Tuple

print("\nrect_into_top_tri #2")

pp(rect_into_top_tri((2, 1), 4, 10))

 

{{out}}

=={{header|Raku}}==

The first triangle bisects the rectangle via the diagonal. The rest of them all got one vertex at the origin and a side defined by ratios of numbers from a descending positive integer sequence.

 

# Proof :

}

 

{{out}}

<pre>

 

This process should ensure that all the triangles are different, albeit the first one is usually much larger than the others. However, to be absolutely sure, we check that the areas of all the triangles are different.

import "./seq" for Lst

 

}

System.print()

 

{{out}}