* ** This library is free software; you can redistribute it and/or modify it ** under the terms of the GNU Lesser General Public License as published by the ** Free Software Foundation; either version 2.1 of the License, or (at your ** option) any later version. ** ** This library 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. ** ** You should have received a copy of the GNU Lesser General Public License ** along with this library; if not, write to the Free Software Foundation, ** Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. ** *

* Contact information: cgogn@unistra.fr ** ********************************************************************************/#ifndef __MAP3_H__#define __MAP3_H__#include "Topology/map/map2.h"namespaceCGoGN{/*! \brief The class of dual 3-dimensional combinatorial maps: * set of oriented volumes pairwise sewed by an adjacency relation. * A dual 3-map represents close or open oriented 3-manifolds (volume subdivisions). * - A dual 3-map is made of darts linked by the phi1 permutation * and/or the phi2 and phi3 one-to-one relation. * - In this class darts are interpreted as oriented edges. * - The phi1 relation defines oriented faces (see tMap1) * and faces may have arbitrary size (degenerated faces are accepted). * - The phi2 relation links oriented faces along oriented edges building * oriented surfaces. A close oriented surface define an oriented volume. * - Volume are linked along whole faces with the phi3 relation * - Faces that have no phi3-link are border faces. If there exists * such edges the maps is open. * - When every face is phi3-linked, the map is close. In this case * some optimizations are enable that speed up the processing of cells. * @param DART the type of dart used in the class */classMap3:publicMap2{protected:

//TODO deleteVertex : works only for boundary vertices//! Delete the vertex of d/*! All the faces around the vertex are merged into one face * @param d a dart of the vertex to delete * @return true if the deletion has been executed, false otherwise

//! Split a face inserting an edge between two vertices/*! \pre Dart d and e should belong to the same face and be distinct * @param d dart of first vertex * @param e dart of second vertex * @return the dart of the new edge lying in the vertex of d after the cut */virtualvoidsplitFace(Dartd,Darte);//! Cut the edge of d/*! @param d a dart of the edge to cut */virtualvoidcutEdge(Dartd);