/* Copyright (c) 1997-2006 Ewgenij Gawrilow, Michael Joswig (Technische Universitaet Berlin, Germany) http://www.math.tu-berlin.de/polymake, mailto:polymake@math.tu-berlin.de This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2, or (at your option) any later version: http://www.gnu.org/licenses/gpl.txt. 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 General Public License for more details. */ #ifndef _POLYMAKE_CONNECTED_SUM_H #define _POLYMAKE_CONNECTED_SUM_H "$Project: polymake $$Id: connected_sum.h 7315 2006-04-02 21:37:53Z gawrilow $" #include #include #include #include #include namespace polymake { namespace topaz { typedef std_ext::hash_map map; /// Computes the connected sum of two complexes and adjusts the labels. /// The client writes the new lables into L1. /// If the labels are empty, the client just ignores them. /// The automorphism P determines to which of the vertices of f1 the /// vertices of f2 get glued. /// If the map is empty, the trivial map is used. template std::list< Set > connected_sum(const Complex_1& C1, const Complex_2& C2, const int f1, const int f2, Array& L1, const Array& L2, map& P); /// Computes the connected sum of two complexes, /// using the first facet of each complex and the /// trivial map. template std::list< Set > connected_sum(const Complex_1& C1, const Complex_2& C2) { map P; Array L; return connected_sum(C1,C2,0,0,L,L,P); } } } #include #endif // _POLYMAKE_CONNECTED_SUM_H // Local Variables: // mode:C++ // c-basic-offset:3 // End: