/usr/include/sofa/component/topology/ManifoldEdgeSetTopologyContainer.h is in libsofa1-dev 1.0~beta4-10ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 | /******************************************************************************
* SOFA, Simulation Open-Framework Architecture, version 1.0 beta 4 *
* (c) 2006-2009 MGH, INRIA, USTL, UJF, CNRS *
* *
* 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. *
*******************************************************************************
* SOFA :: Modules *
* *
* Authors: The SOFA Team and external contributors (see Authors.txt) *
* *
* Contact information: contact@sofa-framework.org *
******************************************************************************/
#ifndef SOFA_COMPONENT_TOPOLOGY_MANIFOLDEDGESETTOPOLOGYCONTAINER_H
#define SOFA_COMPONENT_TOPOLOGY_MANIFOLDEDGESETTOPOLOGYCONTAINER_H
#include <sofa/component/topology/EdgeSetTopologyContainer.h>
namespace sofa
{
namespace component
{
namespace topology
{
class ManifoldEdgeSetTopologyModifier;
using core::componentmodel::topology::BaseMeshTopology;
typedef BaseMeshTopology::PointID PointID;
typedef BaseMeshTopology::EdgeID EdgeID;
typedef BaseMeshTopology::Edge Edge;
typedef BaseMeshTopology::SeqEdges SeqEdges;
typedef BaseMeshTopology::VertexEdges VertexEdges;
/** a class that stores a set of edges and provides access to the adjacency between points and edges.
this topology is constraint by the manifold property : each vertex is adjacent either to one vertex or to two vertices. */
class SOFA_COMPONENT_CONTAINER_API ManifoldEdgeSetTopologyContainer : public EdgeSetTopologyContainer
{
friend class ManifoldEdgeSetTopologyModifier;
public:
ManifoldEdgeSetTopologyContainer();
ManifoldEdgeSetTopologyContainer(const sofa::helper::vector< Edge > &edges);
virtual ~ManifoldEdgeSetTopologyContainer() {}
virtual void init();
virtual void clear();
/** \brief Checks if the topology is coherent
*
* Check if the shell arrays are coherent
*/
virtual bool checkTopology() const;
/** \brief Returns the number of connected components from the graph containing all edges and give, for each vertex, which component it belongs to (use BOOST GRAPH LIBRAIRY)
@param components the array containing the optimal vertex permutation according to the Reverse CuthillMckee algorithm
*/
virtual int getNumberConnectedComponents(sofa::helper::vector<unsigned int>& components);
protected:
/** \brief Creates the EdgeSetIndex.
*
* This function is only called if the EdgeShell member is required.
* EdgeShell[i] contains the indices of all edges having the ith DOF as
* one of their ends.
*/
virtual void createEdgeVertexShellArray();
private:
// Describe each connected component, which can be seen as an oriented line
class ConnectedComponent
{
public:
ConnectedComponent(unsigned int FirstVertexIndex=-1, unsigned int LastVertexIndex=-1, unsigned int size=0,unsigned int ccIndex=0)
: FirstVertexIndex(FirstVertexIndex), LastVertexIndex(LastVertexIndex), size(size), ccIndex(ccIndex)
{}
virtual ~ConnectedComponent() {}
public:
unsigned int FirstVertexIndex; // index of the first vertex on the line
unsigned int LastVertexIndex; // index of the last vertex on the line
unsigned int size; // number of the vertices on the line
unsigned int ccIndex; // index of the connected component stored in the m_ConnectedComponentArray
};
/** \brief Resets the array of connected components and the ComponentVertex array (which are not valide anymore).
*
*/
void resetConnectedComponent()
{
m_ComponentVertexArray.clear();
m_ConnectedComponentArray.clear();
}
/** \brief Returns true iff the array of connected components and the ComponentVertex array are valide (ie : not void)
*
*/
bool isvoid_ConnectedComponent()
{
return m_ConnectedComponentArray.size()==0;
}
/** \brief Computes the array of connected components and the ComponentVertex array (which makes them valide).
*
*/
void computeConnectedComponent();
/** \brief Returns the number of connected components.
*
*/
virtual int getNumberOfConnectedComponents()
{
computeConnectedComponent();
return m_ConnectedComponentArray.size();
}
/** \brief Returns the FirstVertexIndex of the ith connected component.
*
*/
virtual int getFirstVertexIndex(unsigned int i)
{
computeConnectedComponent();
assert(i<m_ConnectedComponentArray.size());
return m_ConnectedComponentArray[i].FirstVertexIndex;
}
/** \brief Returns the LastVertexIndex of the ith connected component.
*
*/
virtual int getLastVertexIndex(unsigned int i)
{
computeConnectedComponent();
assert(i<m_ConnectedComponentArray.size());
return m_ConnectedComponentArray[i].LastVertexIndex;
}
/** \brief Returns the size of the ith connected component.
*
*/
virtual int getComponentSize(unsigned int i)
{
computeConnectedComponent();
assert(i<m_ConnectedComponentArray.size());
return m_ConnectedComponentArray[i].size;
}
/** \brief Returns the index of the ith connected component.
*
*/
virtual int getComponentIndex(unsigned int i)
{
computeConnectedComponent();
assert(i<m_ConnectedComponentArray.size());
return m_ConnectedComponentArray[i].ccIndex;
}
/** \brief Returns true iff the ith connected component is closed (ie : iff FirstVertexIndex == LastVertexIndex).
*
*/
virtual bool isComponentClosed(unsigned int i)
{
computeConnectedComponent();
assert(i<m_ConnectedComponentArray.size());
return (m_ConnectedComponentArray[i].FirstVertexIndex == m_ConnectedComponentArray[i].LastVertexIndex);
}
/** \brief Returns the indice of the vertex which is next to the vertex indexed by i.
*/
int getNextVertex(const unsigned int i)
{
assert(getEdgeVertexShell(i).size()>0);
if((getEdgeVertexShell(i)).size()==1 && (getEdge((getEdgeVertexShell(i))[0]))[1]==i){
return -1;
}else{
return (getEdge((getEdgeVertexShell(i))[0]))[1];
}
}
/** \brief Returns the indice of the vertex which is previous to the vertex indexed by i.
*/
int getPreviousVertex(const unsigned int i)
{
assert(getEdgeVertexShell(i).size()>0);
if((getEdgeVertexShell(i)).size()==1 && (getEdge((getEdgeVertexShell(i))[0]))[0]==i){
return -1;
}else{
return (getEdge((getEdgeVertexShell(i))[0]))[0];
}
}
/** \brief Returns the indice of the edge which is next to the edge indexed by i.
*/
int getNextEdge(const unsigned int i)
{
if((getEdgeVertexShell(getEdge(i)[1])).size()==1){
return -1;
}else{
return (getEdgeVertexShell(getEdge(i)[1]))[1];
}
}
/** \brief Returns the indice of the edge which is previous to the edge indexed by i.
*/
int getPreviousEdge(const unsigned int i)
{
if((getEdgeVertexShell(getEdge(i)[0])).size()==1){
return -1;
}else{
return (getEdgeVertexShell(getEdge(i)[0]))[0];
}
}
/** \brief Returns the ComponentVertex array.
*
*/
const sofa::helper::vector< unsigned int > &getComponentVertexArray() const
{
return m_ComponentVertexArray;
}
/** \brief Returns the array of connected components.
*
*/
const sofa::helper::vector< ConnectedComponent > &getConnectedComponentArray() const
{
return m_ConnectedComponentArray;
}
private:
/** The array that stores for each vertex index, the connected component the vertex belongs to */
sofa::helper::vector< unsigned int > m_ComponentVertexArray;
/** The array that stores the connected components */
sofa::helper::vector< ConnectedComponent > m_ConnectedComponentArray;
};
} // namespace topology
} // namespace component
} // namespace sofa
#endif
|