Falling polygons: meshing vs. stacking - analytic solution needed

SLanghi
Messages
1
Reaction score
0
Falling polygons: meshing vs. stacking -- analytic solution needed

I'm a game developer and not a mathematics specialist, so I'm not 100% sure if this question is correctly categorized.

My problem is as follows.

I'm building a game that's similar to Tetris, but in 3D instead of 2D. Rather than arranging falling tetriminos to form lines within a grid, the player arranges falling tangram pieces to form squares within a square basin.

All of the tangram pieces occupy even fractions of a square (1/4, 1/8, 1/2). Furthermore, when a piece lands, each of its vertices aligns with one of the following: the corners of the basin, the midpoints of the basin's sides, or the central midpoint of the basin.

As the player guides the falling pieces, there will be cases in which a piece nestles just inside the vacancy formed by other, adjacent pieces. I need a collision-detection logic that can allow for these situations where the descending object "just fits" into a hole having the exact shape and size of the piece.

The polygonal collision engine I'm using (Unity) is exhibiting problematic behavior. Even when the tangrams' vertices are aligned exactly to the key points mentioned above, the physics-based polygonal collision logic registers an overlap between a falling piece and one of the pieces bordering the hole into which it's falling. As a result, the falling piece stacks on top of the other pieces, though it appears to the naked eye that the falling piece should have continued into the hole.

I'd like to use an analytic solution that can tell me whether a space within the basin having a particular shape at a particular location is occupied or vacant, given full prior knowledge of the tangrams already residing with the basin. I have very few ideas about where to start with this. If anyone can provide a solution method, or even point me toward the correct mathematical topic, I'll greatly appreciate it.
 
Mathematics news on Phys.org
Hmm, certainly not differential geometry. Either general math or programming.

If I understand your problem correctly, the polygon positions are discrete. Why don't you just make a grid and check if one element of it is occupied?
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.

Similar threads

Replies
5
Views
4K
Replies
4
Views
3K
Replies
8
Views
4K
Back
Top