* Generalize bounding box tree
* Extract intersection algorithms
* Fix some epsilon issues in interval (1d) and triangle (2d) point intersection
* Adapt point sources to new interface
* Adapt fv grid geometry to new interface -> element map moved to basefvgeometry
* Improve bounding box tree test

Timo Koch authored 7 years ago and Kilian Weishaupt committed 7 years ago

[boundingBoxTreeHelper] Fix bug when checking if point is in interval (2D)

See merge request !551

* use absolute value of cross product

Sina Ackermann authored 8 years ago and Timo Koch committed 7 years ago

(cherry picked from commit 3b9e129a)

Feature/use adl for std functions

* `std::swap` and `dumux/common` was cleaned up
* much more needs to be done
* I found a bunch of other clean-up stuff

See merge request !259

Everything in our .hh files is defined within the namespace `Dumux`.
There were numerous occurrences of `Dumux::` qualifiers that were
unnecessary. Remove those occurrences. Necessary qualifications
remain, such as `typedef Dumux::H2O<Scalar> H2O;`.

* The normal vector has to be normalized to compute the right distance
* The distance epsilon needs to be scaled with a characteristic
  length, now the edge length, not the distance of the point from
  the origin (is possibly zero or very large).

The geoemtry collision noe return a vector of intersection corners.
The collision algorithm with another budning box tree returns
a vector of BoundingBoxTreeIntersection object.

The object has a method first and second to get the intersecting
entity indices as well as a method corners. From that you
could build e.g. a intersection geometry. The intersections are
not unique yet. There might be interesctions with the same
corner points but different elements.

We can collide two AABB trees efficiently now. Thus,
AABB trees of two grids can be intersected. This returns
a pair of vectors. They have the same length. Each entry
contains the element index of the one grid in the first
vector and the intersecting element of the second grid in
the second vector.

This implements primitive tests for intersection of two AABB trees
only for 3d with 1d grids for now. If you want to intersect
grids of other dimensions implement the method collides in the
geometry collision class added with this commit.

A general method for all dimensions. Call the helper
methods with the actual coordinates pointer instead of the
whole coordinate vector. Technically this is an interface
change. However, the bounding box helper methods only
make sense to be called by the bboxtree itself so it's
an internal class that is necessary for template specialization.

Kilian Weishaupt authored 9 years ago and Timo Koch committed 9 years ago

The function doesn't change anything in the class.

Use for pointsources and the collision of a grid with a point
the new algorithms to detect whether a point is inside an entity.

As Dune currently offers no general solution to find if a
point lies inside an entity, we need an own solution here.
This implements algorithms from different sources (see comments)
for fast detection of whether a point lies in an entity.
Algorithms are only implemented for simplices in all
combinations of dimgrid and dimworld. Other geometries are
subdivided in simplices and then checked for intersection.

The bounding box internally calculates an index to element map
anyway. We can also use that outside the tree now.

Small bugfix in the 2d tree.

The class used a parameter from the boundingbox tree class
that it has no access to