0
$\begingroup$

is there a pattern that can be followed to draw a polygon which should be symmetrical both horizontally and vertically and the co-ordinates of vertices should be integers. considering that the vertices are on lattice points, the internal angles should be either 45 or 90 or 135. so based on this how to find a algorithm to find vertices if number of sides is given.

$\endgroup$
3
  • $\begingroup$ The only non-degenerate polygons with those internal angles are a 45-45-90 triangle and a rectangle (or square). $\endgroup$ Jan 12, 2021 at 12:49
  • $\begingroup$ Yes just realised that. There's an option of 135 too $\endgroup$ Jan 13, 2021 at 2:51
  • $\begingroup$ That still only gives you convex polygons. The largest number of sides/vertices you can get is 8, which happens when all angles are 135. $\endgroup$ Jan 13, 2021 at 7:04

0

You must log in to answer this question.

Browse other questions tagged .