polychain_util.h

Go to the documentation of this file.

/*
 * Copyright (c) 2010-2015:  G-CSC, Goethe University Frankfurt
 * Author: Sebastian Reiter
 * 
 * This file is part of UG4.
 * 
 * UG4 is free software: you can redistribute it and/or modify it under the
 * terms of the GNU Lesser General Public License version 3 (as published by the
 * Free Software Foundation) with the following additional attribution
 * requirements (according to LGPL/GPL v3 §7):
 * 
 * (1) The following notice must be displayed in the Appropriate Legal Notices
 * of covered and combined works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (2) The following notice must be displayed at a prominent place in the
 * terminal output of covered works: "Based on UG4 (www.ug4.org/license)".
 * 
 * (3) The following bibliography is recommended for citation and must be
 * preserved in all covered files:
 * "Reiter, S., Vogel, A., Heppner, I., Rupp, M., and Wittum, G. A massively
 *   parallel geometric multigrid solver on hierarchically distributed grids.
 *   Computing and visualization in science 16, 4 (2013), 151-164"
 * "Vogel, A., Reiter, S., Rupp, M., Nägel, A., and Wittum, G. UG4 -- a novel
 *   flexible software system for simulating pde based models on high performance
 *   computers. Computing and visualization in science 16, 4 (2013), 165-179"
 * 
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
 * GNU Lesser General Public License for more details.
 */
 
#ifndef __H__LIB_GRID__POLYCHAIN_UTIL__
#define __H__LIB_GRID__POLYCHAIN_UTIL__
 
#include <utility>
#include "lib_grid/lg_base.h"
 
namespace ug
{
 
enum PolyChainTypes
{
  PCT_UNKNOWN = 0,
  PCT_CLOSED = 1,
  PCT_OPEN = 1 << 1,
  PCT_SEPARATED = 1 << 2,
  PCT_IRREGULAR = 1 << 3,
  PCT_EMPTY = 1 << 4
};
enum PolyChainTypes {…};
 
template <class TEdgeIterator>
size_t
GetPolyChainType(Grid& grid, TEdgeIterator edgesBegin,
          TEdgeIterator edgesEnd,
          Grid::edge_traits::callback cbEdgeIsInPolyChain);
          
 
template <class TEdgeIterator>
std::pair<Vertex*, Edge*>
GetFirstSectionOfPolyChain(Grid& grid, TEdgeIterator edgesBegin,
              TEdgeIterator edgesEnd,
              Grid::edge_traits::callback cbEdgeIsInPolyChain);
              
 
std::pair<Vertex*, Edge*>
GetNextSectionOfPolyChain(Grid& grid, std::pair<Vertex*, Edge*> lastSection,
              Grid::edge_traits::callback cbEdgeIsInPolyChain);
 
 
bool SplitIrregularPolyChain(SubsetHandler& sh, int srcIndex, int targetIndex);
 
 
 
template <class TEdgeIter>
bool CreatePolyChain(std::vector<Vertex*>& polyChainOut, Grid& grid,
          TEdgeIter edgesBegin, TEdgeIter edgesEnd);
 
 
}// end of namespace
 
 
//  include implementation
#include "polychain_util_impl.hpp"
 
#endif