🚀 go-pugleaf

Hi guys,

I have a probably very simple quesiton for math guys. I haven't worked out
this problem yet, because I couldn't find a starting point.

I interested in the field of CFD with curvi-linear grid. So I have a 
grid, which is locally more or less orthogonal and the boundaries are
fitted to any arbitrary body shape. It should be mentioned that I'm 
dealing with four-sided cells in these grids.

The problem is to detect the distance of all the center points from the
2 boundaries of the domain. This distance should be the normal distance,
to have the smallest path.




A simple  example:

                                                  2
***********************             **************************
*                     *             *                        * 
*                     *             *                        *
*                      *         1 *                         *
*                       *         *                          *
*                        *       *                           *
*                         **   **           X                *3
*                           ***                              *
*                                                            *
*                                                            *
*                                                            *
*                                                            *
**************************************************************
                                             4                


X is an arbitrary point in the domain, with a know location.
That point is influence in this special case by 4 wall marked
marked with the numbers 1,2,3 and 4. I need now the points on
all these 4 surfaces and their distance to the point given by
X.

This is already a special case. Did anybody consider something
similar and more general.



Sincerely, Gerhard Bosch