Hi! I was trying to mathematically solve a positioning problem for a game I am playing and while I was able to postulate the problem; I feel my education has fallen me short to find a solution. The problem is as follows:
-
You have N shapes compromized of any number of vertices declared as integer offsets from their origin point (the origin point counts as a vertex).
-
Out of the N shapes you have to pick a group of Y size that maximizes the number of overlapping vertices between them with the following rules:
– The origin point of each shape must be placed on a 2D integer grid.
– The origin point of each shape must be different from each other shapes origin point.
– The shapes can be rotated in steps of 90º any number of times.
– For a vertex to count as overlapping it must be the exact same position as the vertex of at least one other shape and one of the vertices must be the origin point of a shape.
Where could I read material to advance in this problem? Is there an algorithm for these problems?

