frackit issueshttps://git.iws.uni-stuttgart.de/tools/frackit/-/issues2020-12-10T08:16:22Zhttps://git.iws.uni-stuttgart.de/tools/frackit/-/issues/24Add junit output to test pipelines2020-12-10T08:16:22ZDennis GläserAdd junit output to test pipelines1.3Dennis GläserDennis Gläserhttps://git.iws.uni-stuttgart.de/tools/frackit/-/issues/23Introduce graph data structures and algorithms2020-12-10T08:16:43ZDennis GläserIntroduce graph data structures and algorithmsTranslation of entity networks into graphs would be useful for efficient analysis of the network characteristics based on algorithms on graphs.Translation of entity networks into graphs would be useful for efficient analysis of the network characteristics based on algorithms on graphs.1.3Dennis GläserDennis Gläserhttps://git.iws.uni-stuttgart.de/tools/frackit/-/issues/20generalize box class2020-12-10T08:17:04ZDennis Gläsergeneralize box classThe `Box` class is currently actually a bounding box. In addition, a `BoundingBox` type exists which is only an alias for `Box`. The `Box` class should be generalized such that it can be oriented arbitrarily in space, while `BoundingBox`...The `Box` class is currently actually a bounding box. In addition, a `BoundingBox` type exists which is only an alias for `Box`. The `Box` class should be generalized such that it can be oriented arbitrarily in space, while `BoundingBox` implements the current `Box`.1.3Dennis GläserDennis Gläserhttps://git.iws.uni-stuttgart.de/tools/frackit/-/issues/19add geothermal example application2020-12-10T08:17:12ZDennis Gläseradd geothermal example applicationIt would be nice to have an example application with injection & extraction wells and a fracture network in between them.It would be nice to have an example application with injection & extraction wells and a fracture network in between them.1.3Dennis GläserDennis Gläserhttps://git.iws.uni-stuttgart.de/tools/frackit/-/issues/18unify style of geometric algorithms2020-12-10T08:17:20ZDennis Gläserunify style of geometric algorithmsFor intersection angle computations, there is the `IntersectionAngle` class which contains the algorithms, while for `computeMagnitude` and `computeDistance` they are inside the free functions. This should probably be unified.
The advan...For intersection angle computations, there is the `IntersectionAngle` class which contains the algorithms, while for `computeMagnitude` and `computeDistance` they are inside the free functions. This should probably be unified.
The advantage of an "algorithm class" is that it can be used as driver in some other place, and is thus modifiable by inheritance and modification of specific details.
One solution could be to add a free function
```cpp
template<class Geo1, class Geo2, class Intersection, class AngleEngine = IntersectionAngle>
ctype computeAngle(const Geo1& geo1, const Geo2& geo2, const Intersection& is)
{ return AngleEngine()(geo1, geo2, is); }
```
where the engine defaults to the standard engine. Similarly, we could put `computeMagnitude` etc, also in "algorithm classes" and let the free functions have an additional template argument for the driver, with default.1.3Dennis GläserDennis Gläser