simplex.cpp 2.76 KB
 Sylvain Thery committed May 26, 2015 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 ``````/******************************************************************************* * CGoGN: Combinatorial and Geometric modeling with Generic N-dimensional Maps * * version 0.1 * * Copyright (C) 2009-2012, IGG Team, LSIIT, University of Strasbourg * * * * 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. * * * * Web site: http://cgogn.unistra.fr/ * * Contact information: cgogn@unistra.fr * * * *******************************************************************************/ #ifndef __SIMPLEX__ #define __SIMPLEX__ #include "Topology/generic/cells.h" namespace CGoGN { namespace Algo { namespace Topo { template bool isSimplex(const MAP& map, Dart d) { if (ORBIT==VOLUME) { Dart d1 = map.phi2(d); Dart e = map.phi1(d); Dart d2 = map.phi2(e); e = map.phi1(e); Dart d3 = map.phi2(d); if (map.phi1(e) != d) // check that face of d is a triangle return false; if (map.phi_1(d1) != map.template phi<12>(d2)) return false; if (map.phi_1(d2) != map.template phi<12>(d3)) return false; if (map.phi_1(d3) != map.template phi<12>(d1)) return false; if (! map.isCycleTriangle(d1)) return false; if (! map.isCycleTriangle(d2)) return false; if (! map.isCycleTriangle(d3)) return false; return true; } if (ORBIT==FACE) { return map.isCycleTriangle(d); } return true; } } // namespace Topo } // namespace Algo } // namespace CGoGN #endif``````