8#ifndef DUNE_GRIDGLUE_MERGING_STANDARDMERGE_HH
9#define DUNE_GRIDGLUE_MERGING_STANDARDMERGE_HH
22#include <dune/common/fvector.hh>
23#include <dune/common/bitsetvector.hh>
24#include <dune/common/stdstreams.hh>
25#include <dune/common/timer.hh>
27#include <dune/geometry/referenceelements.hh>
28#include <dune/grid/common/grid.hh>
53template<
class T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
55 :
public Merger<T,grid1Dim,grid2Dim,dimworld>
98 const std::vector<Dune::FieldVector<T,dimworld> >& grid1ElementCorners,
99 std::bitset<(1<<grid1Dim)>& neighborIntersects1,
100 unsigned int grid1Index,
101 const Dune::GeometryType& grid2ElementType,
102 const std::vector<Dune::FieldVector<T,dimworld> >& grid2ElementCorners,
103 std::bitset<(1<<grid2Dim)>& neighborIntersects2,
104 unsigned int grid2Index,
105 std::vector<SimplicialIntersection>& intersections) = 0;
111 const std::vector<Dune::FieldVector<T,dimworld> >& grid1Coords,
112 const std::vector<Dune::GeometryType>& grid1_element_types,
113 std::bitset<(1<<grid1Dim)>& neighborIntersects1,
114 const std::vector<Dune::FieldVector<T,dimworld> >& grid2Coords,
115 const std::vector<Dune::GeometryType>& grid2_element_types,
116 std::bitset<(1<<grid2Dim)>& neighborIntersects2,
138 void build(
const std::vector<Dune::FieldVector<T,dimworld> >& grid1_Coords,
139 const std::vector<unsigned int>& grid1_elements,
140 const std::vector<Dune::GeometryType>& grid1_element_types,
141 const std::vector<Dune::FieldVector<T,dimworld> >& grid2_coords,
142 const std::vector<unsigned int>& grid2_elements,
143 const std::vector<Dune::GeometryType>& grid2_element_types)
override;
166 m_enableFallback = fallback;
171 m_enableBruteForce = bruteForce;
178 bool m_enableFallback =
false;
183 bool m_enableBruteForce =
false;
185 auto& intersections()
190 static void purge(V & v)
201 void generateSeed(std::vector<int>& seeds,
202 Dune::BitSetVector<1>& isHandled2,
203 std::stack<unsigned>& candidates2,
204 const std::vector<Dune::FieldVector<T, dimworld> >& grid1Coords,
205 const std::vector<Dune::GeometryType>& grid1_element_types,
206 const std::vector<Dune::FieldVector<T, dimworld> >& grid2Coords,
207 const std::vector<Dune::GeometryType>& grid2_element_types);
212 int insertIntersections(
unsigned int candidate1,
unsigned int candidate2,std::vector<SimplicialIntersection>& intersections);
217 int bruteForceSearch(
int candidate1,
218 const std::vector<Dune::FieldVector<T,dimworld> >& grid1Coords,
219 const std::vector<Dune::GeometryType>& grid1_element_types,
220 const std::vector<Dune::FieldVector<T,dimworld> >& grid2Coords,
221 const std::vector<Dune::GeometryType>& grid2_element_types);
226 std::pair<bool, unsigned int>
227 intersectionIndex(
unsigned int grid1Index,
unsigned int grid2Index,
233 template <
int gr
idDim>
234 void computeNeighborsPerElement(
const std::vector<Dune::GeometryType>& gridElementTypes,
235 const std::vector<std::vector<unsigned int> >& gridElementCorners,
236 std::vector<std::vector<int> >& elementNeighbors);
238 void buildAdvancingFront(
239 const std::vector<Dune::FieldVector<T,dimworld> >& grid1_Coords,
240 const std::vector<unsigned int>& grid1_elements,
241 const std::vector<Dune::GeometryType>& grid1_element_types,
242 const std::vector<Dune::FieldVector<T,dimworld> >& grid2_coords,
243 const std::vector<unsigned int>& grid2_elements,
244 const std::vector<Dune::GeometryType>& grid2_element_types
247 void buildBruteForce(
248 const std::vector<Dune::FieldVector<T,dimworld> >& grid1_Coords,
249 const std::vector<unsigned int>& grid1_elements,
250 const std::vector<Dune::GeometryType>& grid1_element_types,
251 const std::vector<Dune::FieldVector<T,dimworld> >& grid2_coords,
252 const std::vector<unsigned int>& grid2_elements,
253 const std::vector<Dune::GeometryType>& grid2_element_types
260template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
262 const std::vector<Dune::FieldVector<T,dimworld> >& grid1Coords,
263 const std::vector<Dune::GeometryType>& grid1_element_types,
264 std::bitset<(1<<grid1Dim)>& neighborIntersects1,
265 const std::vector<Dune::FieldVector<T,dimworld> >& grid2Coords,
266 const std::vector<Dune::GeometryType>& grid2_element_types,
267 std::bitset<(1<<grid2Dim)>& neighborIntersects2,
271 int grid1NumVertices = grid1ElementCorners_[candidate0].size();
272 std::vector<Dune::FieldVector<T,dimworld> > grid1ElementCorners(grid1NumVertices);
273 for (
int i=0; i<grid1NumVertices; i++)
274 grid1ElementCorners[i] = grid1Coords[grid1ElementCorners_[candidate0][i]];
277 int grid2NumVertices = grid2ElementCorners_[candidate1].size();
278 std::vector<Dune::FieldVector<T,dimworld> > grid2ElementCorners(grid2NumVertices);
279 for (
int i=0; i<grid2NumVertices; i++)
280 grid2ElementCorners[i] = grid2Coords[grid2ElementCorners_[candidate1][i]];
289 computeIntersections(grid1_element_types[candidate0], grid1ElementCorners,
290 neighborIntersects1, candidate0,
291 grid2_element_types[candidate1], grid2ElementCorners,
292 neighborIntersects2, candidate1,
300 return !
intersections.empty() || neighborIntersects1.any() || neighborIntersects2.any();
304template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
306 const std::vector<Dune::FieldVector<T,dimworld> >& grid1Coords,
307 const std::vector<Dune::GeometryType>& grid1_element_types,
308 const std::vector<Dune::FieldVector<T,dimworld> >& grid2Coords,
309 const std::vector<Dune::GeometryType>& grid2_element_types)
311 std::bitset<(1<<grid1Dim)> neighborIntersects1;
312 std::bitset<(1<<grid2Dim)> neighborIntersects2;
313 for (std::size_t i=0; i<grid1_element_types.size(); i++) {
315 bool intersectionFound = computeIntersection(i, candidate1,
316 grid1Coords, grid1_element_types, neighborIntersects1,
317 grid2Coords, grid2_element_types, neighborIntersects2,
321 if (intersectionFound)
330template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
332void StandardMerge<T,grid1Dim,grid2Dim,dimworld>::
333computeNeighborsPerElement(
const std::vector<Dune::GeometryType>& gridElementTypes,
334 const std::vector<std::vector<unsigned int> >& gridElementCorners,
335 std::vector<std::vector<int> >& elementNeighbors)
337 typedef std::vector<unsigned int> FaceType;
338 typedef std::map<FaceType, std::pair<unsigned int, unsigned int> > FaceSetType;
344 elementNeighbors.resize(gridElementTypes.size());
346 for (
size_t i=0; i<gridElementTypes.size(); i++)
347 elementNeighbors[i].resize(Dune::ReferenceElements<T,gridDim>::general(gridElementTypes[i]).size(1), -1);
349 for (
size_t i=0; i<gridElementTypes.size(); i++) {
350 const auto& refElement = Dune::ReferenceElements<T,gridDim>::general(gridElementTypes[i]);
352 for (
size_t j=0; j<(size_t)refElement.size(1); j++) {
356 for (
size_t k=0; k<(size_t)refElement.size(j,1,gridDim); k++)
357 face.push_back(gridElementCorners[i][refElement.subEntity(j,1,k,gridDim)]);
360 std::sort(face.begin(), face.end());
362 typename FaceSetType::iterator faceHandle = faces.find(face);
364 if (faceHandle == faces.end()) {
367 faces.insert(std::make_pair(face, std::make_pair(i,j)));
372 elementNeighbors[i][j] = faceHandle->second.first;
373 elementNeighbors[faceHandle->second.first][faceHandle->second.second] = i;
375 faces.erase(faceHandle);
389template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
391 const std::vector<unsigned int>& grid1_elements,
392 const std::vector<Dune::GeometryType>& grid1_element_types,
393 const std::vector<Dune::FieldVector<T,dimworld> >& grid2Coords,
394 const std::vector<unsigned int>& grid2_elements,
395 const std::vector<Dune::GeometryType>& grid2_element_types
399 std::cout <<
"StandardMerge building merged grid..." << std::endl;
404 intersectionListProvider_->clear();
414 grid1ElementCorners_.resize(grid1_element_types.size());
416 unsigned int grid1CornerCounter = 0;
418 for (std::size_t i=0; i<grid1_element_types.size(); i++) {
421 int numVertices = Dune::ReferenceElements<T,grid1Dim>::general(grid1_element_types[i]).size(grid1Dim);
422 grid1ElementCorners_[i].resize(numVertices);
423 for (
int j=0; j<numVertices; j++)
424 grid1ElementCorners_[i][j] = grid1_elements[grid1CornerCounter++];
429 grid2ElementCorners_.resize(grid2_element_types.size());
431 unsigned int grid2CornerCounter = 0;
433 for (std::size_t i=0; i<grid2_element_types.size(); i++) {
436 int numVertices = Dune::ReferenceElements<T,grid2Dim>::general(grid2_element_types[i]).size(grid2Dim);
437 grid2ElementCorners_[i].resize(numVertices);
438 for (
int j=0; j<numVertices; j++)
439 grid2ElementCorners_[i][j] = grid2_elements[grid2CornerCounter++];
447 computeNeighborsPerElement<grid1Dim>(grid1_element_types, grid1ElementCorners_, elementNeighbors1_);
448 computeNeighborsPerElement<grid2Dim>(grid2_element_types, grid2ElementCorners_, elementNeighbors2_);
450 std::cout <<
"setup took " << watch.elapsed() <<
" seconds." << std::endl;
452 if (m_enableBruteForce)
453 buildBruteForce(grid1Coords, grid1_elements, grid1_element_types, grid2Coords, grid2_elements, grid2_element_types);
455 buildAdvancingFront(grid1Coords, grid1_elements, grid1_element_types, grid2Coords, grid2_elements, grid2_element_types);
458 std::cout <<
"intersection construction took " << watch.elapsed() <<
" seconds." << std::endl;
461template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
463 const std::vector<Dune::FieldVector<T,dimworld> >& grid1Coords,
464 const std::vector<unsigned int>& grid1_elements,
465 const std::vector<Dune::GeometryType>& grid1_element_types,
466 const std::vector<Dune::FieldVector<T,dimworld> >& grid2Coords,
467 const std::vector<unsigned int>& grid2_elements,
468 const std::vector<Dune::GeometryType>& grid2_element_types
475 std::stack<unsigned int> candidates1;
476 std::stack<unsigned int> candidates2;
478 std::vector<int> seeds(grid2_element_types.size(), -1);
486 Dune::BitSetVector<1> isHandled2(grid2_element_types.size());
489 Dune::BitSetVector<1> isCandidate2(grid2_element_types.size());
491 generateSeed(seeds, isHandled2, candidates2, grid1Coords, grid1_element_types, grid2Coords, grid2_element_types);
497 std::set<unsigned int> isHandled1;
499 std::set<unsigned int> isCandidate1;
501 while (!candidates2.empty()) {
504 unsigned int currentCandidate2 = candidates2.top();
505 int seed = seeds[currentCandidate2];
509 isHandled2[currentCandidate2] =
true;
513 candidates1.push(seed);
516 isCandidate1.clear();
518 while (!candidates1.empty()) {
520 unsigned int currentCandidate1 = candidates1.top();
522 isHandled1.insert(currentCandidate1);
525 std::bitset<(1<<grid1Dim)> neighborIntersects1;
526 std::bitset<(1<<grid2Dim)> neighborIntersects2;
527 bool intersectionFound = computeIntersection(currentCandidate1, currentCandidate2,
528 grid1Coords,grid1_element_types, neighborIntersects1,
529 grid2Coords,grid2_element_types, neighborIntersects2);
531 for (
size_t i=0; i<neighborIntersects2.size(); i++)
532 if (neighborIntersects2[i] && elementNeighbors2_[currentCandidate2][i] != -1)
533 seeds[elementNeighbors2_[currentCandidate2][i]] = currentCandidate1;
536 if (intersectionFound) {
538 for (
size_t i=0; i<elementNeighbors1_[currentCandidate1].size(); i++) {
540 int neighbor = elementNeighbors1_[currentCandidate1][i];
545 if (isHandled1.find(neighbor) == isHandled1.end()
546 && isCandidate1.find(neighbor) == isCandidate1.end()) {
547 candidates1.push(neighbor);
548 isCandidate1.insert(neighbor);
562 bool seedFound = !candidates2.empty();
563 for (
size_t i=0; i<elementNeighbors2_[currentCandidate2].size(); i++) {
565 int neighbor = elementNeighbors2_[currentCandidate2][i];
571 if (!isHandled2[neighbor][0] && !isCandidate2[neighbor][0] && seeds[neighbor]>-1) {
573 isCandidate2[neighbor][0] =
true;
574 candidates2.push(neighbor);
579 if (seedFound || !m_enableFallback)
584 for (
size_t i=0; i<elementNeighbors2_[currentCandidate2].size(); i++) {
586 int neighbor = elementNeighbors2_[currentCandidate2][i];
591 if (!isHandled2[neighbor][0] && !isCandidate2[neighbor][0]) {
598 for (
typename std::set<unsigned int>::iterator seedIt = isHandled1.begin();
599 seedIt != isHandled1.end(); ++seedIt) {
601 std::bitset<(1<<grid1Dim)> neighborIntersects1;
602 std::bitset<(1<<grid2Dim)> neighborIntersects2;
603 bool intersectionFound = computeIntersection(*seedIt, neighbor,
604 grid1Coords, grid1_element_types, neighborIntersects1,
605 grid2Coords, grid2_element_types, neighborIntersects2,
609 if (intersectionFound) {
611 Dune::dwarn <<
"Algorithm entered first fallback method and found a new seed in the build algorithm." <<
612 "Probably, the neighborIntersects bitsets computed in computeIntersection specialization is wrong." << std::endl;
621 seed = bruteForceSearch(neighbor,
622 grid1Coords,grid1_element_types,
623 grid2Coords,grid2_element_types);
624 Dune::dwarn <<
"Algorithm entered second fallback method. This probably should not happen." << std::endl;
629 isCandidate2[neighbor] =
true;
636 candidates2.push(neighbor);
637 seeds[neighbor] = seed;
647 if (!seedFound && candidates2.empty()) {
648 generateSeed(seeds, isHandled2, candidates2, grid1Coords, grid1_element_types, grid2Coords, grid2_element_types);
653template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
654void StandardMerge<T,grid1Dim,grid2Dim,dimworld>::buildBruteForce(
655 const std::vector<Dune::FieldVector<T,dimworld> >& grid1Coords,
656 const std::vector<unsigned int>& grid1_elements,
657 const std::vector<Dune::GeometryType>& grid1_element_types,
658 const std::vector<Dune::FieldVector<T,dimworld> >& grid2Coords,
659 const std::vector<unsigned int>& grid2_elements,
660 const std::vector<Dune::GeometryType>& grid2_element_types
663 std::bitset<(1<<grid1Dim)> neighborIntersects1;
664 std::bitset<(1<<grid2Dim)> neighborIntersects2;
666 for (
unsigned i = 0; i < grid1_element_types.size(); ++i) {
667 for (
unsigned j = 0; j < grid2_element_types.size(); ++j) {
668 (void) computeIntersection(i, j,
669 grid1Coords, grid1_element_types, neighborIntersects1,
670 grid2Coords, grid2_element_types, neighborIntersects2);
675template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
676void StandardMerge<T,grid1Dim,grid2Dim,dimworld>::generateSeed(std::vector<int>& seeds, Dune::BitSetVector<1>& isHandled2, std::stack<unsigned>& candidates2,
const std::vector<Dune::FieldVector<T, dimworld> >& grid1Coords,
const std::vector<Dune::GeometryType>& grid1_element_types,
const std::vector<Dune::FieldVector<T, dimworld> >& grid2Coords,
const std::vector<Dune::GeometryType>& grid2_element_types)
678 for (std::size_t j=0; j<grid2_element_types.size(); j++) {
680 if (seeds[j] > 0 || isHandled2[j][0])
683 int seed = bruteForceSearch(j,grid1Coords,grid1_element_types,grid2Coords,grid2_element_types);
690 isHandled2[j] =
true;
694template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
695int StandardMerge<T,grid1Dim,grid2Dim,dimworld>::insertIntersections(
unsigned int candidate1,
unsigned int candidate2,
698 typedef typename std::vector<SimplicialIntersection>::size_type size_t;
705 std::tie(found, index) = intersectionIndex(candidate1,candidate2,
intersections[i]);
715 for (
size_t j = 0; j <
intersections[i].parents0.size(); ++j) {
716 intersection.parents0.push_back(candidate1);
717 intersection.corners0.push_back(
intersections[i].corners0[j]);
721 for (
size_t j = 0; j <
intersections[i].parents1.size(); ++j) {
722 intersection.parents1.push_back(candidate2);
723 intersection.corners1.push_back(
intersections[i].corners1[j]);
728 Dune::dwarn <<
"Computed the same intersection twice!" << std::endl;
734template<
typename T,
int gr
id1Dim,
int gr
id2Dim,
int dimworld>
735std::pair<bool, unsigned int>
736StandardMerge<T,grid1Dim,grid2Dim,dimworld>::intersectionIndex(
unsigned int grid1Index,
unsigned int grid2Index,
737 SimplicialIntersection& intersection) {
744 if (grid1Dim == grid2Dim)
745 return {
true, n_intersections};
749 for (std::size_t i = 0; i < n_intersections; ++i) {
752 for (std::size_t ei = 0; ei < this->
intersections()[i].parents0.size(); ++ei)
756 for (std::size_t er = 0; er < intersection.parents0.size(); ++er)
758 bool found_all =
true;
760 for (std::size_t ci = 0; ci < this->
intersections()[i].corners0[ei].size(); ++ci)
762 Dune::FieldVector<T,grid1Dim> ni = this->
intersections()[i].corners0[ei][ci];
763 bool found_ni =
false;
764 for (std::size_t cr = 0; cr < intersection.corners0[er].size(); ++cr)
766 Dune::FieldVector<T,grid1Dim> nr = intersection.corners0[er][cr];
768 found_ni = found_ni || ((ni-nr).infinity_norm() < eps);
772 found_all = found_all && found_ni;
778 if (found_all && (this->
intersections()[i].parents1[ei] != grid2Index))
787 for (std::size_t ei = 0; ei < this->
intersections()[i].parents1.size(); ++ei)
791 for (std::size_t er = 0; er < intersection.parents1.size(); ++er)
793 bool found_all =
true;
795 for (std::size_t ci = 0; ci < this->
intersections()[i].corners1[ei].size(); ++ci)
797 Dune::FieldVector<T,grid2Dim> ni = this->
intersections()[i].corners1[ei][ci];
798 bool found_ni =
false;
799 for (std::size_t cr = 0; cr < intersection.corners1[er].size(); ++cr)
801 Dune::FieldVector<T,grid2Dim> nr = intersection.corners1[er][cr];
802 found_ni = found_ni || ((ni-nr).infinity_norm() < eps);
807 found_all = found_all && found_ni;
813 if (found_all && (this->
intersections()[i].parents0[ei] != grid1Index))
822 return {
true, n_intersections};
826#define STANDARD_MERGE_INSTANTIATE(T,A,B,C) \
828 void StandardMerge<T,A,B,C>::build(const std::vector<Dune::FieldVector<T,C> >& grid1Coords, \
829 const std::vector<unsigned int>& grid1_elements, \
830 const std::vector<Dune::GeometryType>& grid1_element_types, \
831 const std::vector<Dune::FieldVector<T,C> >& grid2Coords, \
832 const std::vector<unsigned int>& grid2_elements, \
833 const std::vector<Dune::GeometryType>& grid2_element_types \
839#undef STANDARD_MERGE_INSTANTIATE
#define STANDARD_MERGE_INSTANTIATE(T, A, B, C)
Definition: standardmerge.cc:11
Definition: gridglue.hh:35
IteratorRange<... > intersections(const GridGlue<... > &glue, const Reverse<... > &reverse=!reversed)
Iterate over all intersections of a GridGlue.
Definition: intersectionlist.hh:205
Definition: intersectionlist.hh:220
Abstract base for all classes that take extracted grids and build sets of intersections.
Definition: merger.hh:25
Dune::FieldVector< T, dimworld > WorldCoords
the coordinate type used in this interface
Definition: merger.hh:35
Dune::GridGlue::IntersectionList< Grid1Coords, Grid2Coords > IntersectionList
Definition: merger.hh:37
Dune::FieldVector< T, grid1Dim > Grid1Coords
the local coordinate type for the grid1 coordinates
Definition: merger.hh:29
Dune::FieldVector< T, grid2Dim > Grid2Coords
the local coordinate type for the grid2 coordinates
Definition: merger.hh:32
Common base class for many merger implementations: produce pairs of entities that may intersect.
Definition: standardmerge.hh:56
virtual void computeIntersections(const Dune::GeometryType &grid1ElementType, const std::vector< Dune::FieldVector< T, dimworld > > &grid1ElementCorners, std::bitset<(1<< grid1Dim)> &neighborIntersects1, unsigned int grid1Index, const Dune::GeometryType &grid2ElementType, const std::vector< Dune::FieldVector< T, dimworld > > &grid2ElementCorners, std::bitset<(1<< grid2Dim)> &neighborIntersects2, unsigned int grid2Index, std::vector< SimplicialIntersection > &intersections)=0
Compute the intersection between two overlapping elements.
std::shared_ptr< IntersectionList > intersectionList_
Definition: standardmerge.hh:122
typename Base::Grid1Coords Grid1Coords
Type used for local coordinates on the grid1 side.
Definition: standardmerge.hh:67
void enableFallback(bool fallback)
Definition: standardmerge.hh:164
std::vector< std::vector< int > > elementNeighbors2_
Definition: standardmerge.hh:129
std::vector< std::vector< int > > elementNeighbors1_
Definition: standardmerge.hh:128
T ctype
the numeric type used in this interface
Definition: standardmerge.hh:64
void clear() override
Definition: standardmerge.hh:148
typename Base::IntersectionList IntersectionList
Definition: standardmerge.hh:75
bool computeIntersection(unsigned int candidate0, unsigned int candidate1, const std::vector< Dune::FieldVector< T, dimworld > > &grid1Coords, const std::vector< Dune::GeometryType > &grid1_element_types, std::bitset<(1<< grid1Dim)> &neighborIntersects1, const std::vector< Dune::FieldVector< T, dimworld > > &grid2Coords, const std::vector< Dune::GeometryType > &grid2_element_types, std::bitset<(1<< grid2Dim)> &neighborIntersects2, bool insert=true)
Compute the intersection between two overlapping elements.
Definition: standardmerge.hh:261
void enableBruteForce(bool bruteForce)
Definition: standardmerge.hh:169
std::shared_ptr< IntersectionListProvider > intersectionListProvider_
Definition: standardmerge.hh:121
void build(const std::vector< Dune::FieldVector< T, dimworld > > &grid1_Coords, const std::vector< unsigned int > &grid1_elements, const std::vector< Dune::GeometryType > &grid1_element_types, const std::vector< Dune::FieldVector< T, dimworld > > &grid2_coords, const std::vector< unsigned int > &grid2_elements, const std::vector< Dune::GeometryType > &grid2_element_types) override
Definition: standardmerge.hh:390
std::vector< std::vector< unsigned int > > grid1ElementCorners_
Temporary internal data.
Definition: standardmerge.hh:125
std::vector< std::vector< unsigned int > > grid2ElementCorners_
Definition: standardmerge.hh:126
typename Base::Grid2Coords Grid2Coords
Type used for local coordinates on the grid2 side.
Definition: standardmerge.hh:70
std::shared_ptr< IntersectionList > intersectionList() const final
Definition: standardmerge.hh:158
virtual ~StandardMerge()=default
SimplicialIntersection RemoteSimplicialIntersection
Definition: standardmerge.hh:82
bool valid
Definition: standardmerge.hh:84
StandardMerge()
Definition: standardmerge.hh:86
typename IntersectionListProvider::SimplicialIntersection SimplicialIntersection
Definition: standardmerge.hh:81
typename Base::WorldCoords WorldCoords
the coordinate type used in this interface
Definition: standardmerge.hh:73