... | ... | @@ -545,8 +545,6 @@ Ruppert's algorithm is able to mesh complex geometries defined by PSLGs containi |
|
|
|
|
|
# EikMesh <a name="EikMEsh"></a>
|
|
|
|
|
|
![headMesh](uploads/76ced2ddd4ef0e71d3f76043bcbcad83/headMesh.png)
|
|
|
|
|
|
EikMesh uses our implementation of the [DCEL](https://gitlab.lrz.de/vadere/vadere/wikis/eikmesh/The-Mesh-Data-Structure) as underlying data structure. EikMesh requires three basically three ingredients:
|
|
|
1. a bounding box `VPolygon` (containing all mesh points)
|
|
|
2. a signed distance function d(x) which gives the distance to the topography border
|
... | ... | @@ -556,6 +554,8 @@ EikMesh uses our implementation of the [DCEL](https://gitlab.lrz.de/vadere/vader |
|
|
However if (2) is missing EikMesh constructs d(x) by using only the bounding box (and maybe additional `VShape`s). If (3) is missing EikMesh assumes h(x) = h0 everywhere leading to a mesh of balanced edge lengths.
|
|
|
For more details we refer to [Zönnchen and Köster, 2018](https://www.sciencedirect.com/science/article/pii/S1877750318303193).
|
|
|
|
|
|
![headMesh](uploads/76ced2ddd4ef0e71d3f76043bcbcad83/headMesh.png)
|
|
|
|
|
|
## Examples
|
|
|
|
|
|
### Example 1 (Uniform ring)
|
... | ... | |