Define boundary conditions of a polygon in a unit square cell

tomallan
Messages
20
Reaction score
0
Hi,

I am wondering as to how to define the boundary condition for a shape in a unit cell. Just imagine that the shape is the hole for the unit cell. Hence, for a constant thickness on the untextured boundary, thickness is, let's say C, then for the circle, it's C+depth.


For example for a unit cell with width 2r1 by 2r1 with a circle inside the unit cell, the boundary condition is:

h(x,y) = C+depth, if x^2+y^2<r^2, and
h(x,y) = C, if x^2+y^2>r^2.

I am wondering how to do this with complicated polygons, like hexagon and stuff or if there is a formula or principle that i don't know of.

Thank you heaps.
 

Attachments

  • hex.jpg
    hex.jpg
    7.2 KB · Views: 544
Mathematics news on Phys.org
Each of the sides of a polygon is definable by a simple linear equation in x and y. The interior of a convex polygon is the intersection of the half-planes defined by the corresponding inequalities.
 
Last edited:
For convex polygons, the most economic way would probably be to restrict the boundary conditions to particular angles. For more complex polygons, a piecewise defined curve is probably the best way.
 
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.
Back
Top