1 // Copyright (C) 2007-2016 CEA/DEN, EDF R&D
3 // This library is free software; you can redistribute it and/or
4 // modify it under the terms of the GNU Lesser General Public
5 // License as published by the Free Software Foundation; either
6 // version 2.1 of the License, or (at your option) any later version.
8 // This library is distributed in the hope that it will be useful,
9 // but WITHOUT ANY WARRANTY; without even the implied warranty of
10 // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 // Lesser General Public License for more details.
13 // You should have received a copy of the GNU Lesser General Public
14 // License along with this library; if not, write to the Free Software
15 // Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
17 // See http://www.salome-platform.org/ or email : webmaster.salome@opencascade.com
19 // Author : Anthony Geay (EDF R&D)
21 #include "MEDCouplingUMesh.hxx"
22 #include "MEDCouplingCMesh.hxx"
23 #include "MEDCoupling1GTUMesh.hxx"
24 #include "MEDCouplingFieldDouble.hxx"
25 #include "MEDCouplingSkyLineArray.hxx"
26 #include "CellModel.hxx"
27 #include "VolSurfUser.txx"
28 #include "InterpolationUtils.hxx"
29 #include "PointLocatorAlgos.txx"
31 #include "BBTreeDst.txx"
32 #include "SplitterTetra.hxx"
33 #include "DiameterCalculator.hxx"
34 #include "DirectedBoundingBox.hxx"
35 #include "InterpKernelMatrixTools.hxx"
36 #include "InterpKernelMeshQuality.hxx"
37 #include "InterpKernelCellSimplify.hxx"
38 #include "InterpKernelGeo2DEdgeArcCircle.hxx"
39 #include "InterpKernelAutoPtr.hxx"
40 #include "InterpKernelGeo2DNode.hxx"
41 #include "InterpKernelGeo2DEdgeLin.hxx"
42 #include "InterpKernelGeo2DEdgeArcCircle.hxx"
43 #include "InterpKernelGeo2DQuadraticPolygon.hxx"
44 #include "OrientationInverter.hxx"
45 #include "MEDCouplingUMesh_internal.hxx"
54 using namespace MEDCoupling;
56 double MEDCouplingUMesh::EPS_FOR_POLYH_ORIENTATION=1.e-14;
59 const INTERP_KERNEL::NormalizedCellType MEDCouplingUMesh::MEDMEM_ORDER[N_MEDMEM_ORDER] = { INTERP_KERNEL::NORM_POINT1, INTERP_KERNEL::NORM_SEG2, INTERP_KERNEL::NORM_SEG3, INTERP_KERNEL::NORM_SEG4, INTERP_KERNEL::NORM_POLYL, INTERP_KERNEL::NORM_TRI3, INTERP_KERNEL::NORM_QUAD4, INTERP_KERNEL::NORM_TRI6, INTERP_KERNEL::NORM_TRI7, INTERP_KERNEL::NORM_QUAD8, INTERP_KERNEL::NORM_QUAD9, INTERP_KERNEL::NORM_POLYGON, INTERP_KERNEL::NORM_QPOLYG, INTERP_KERNEL::NORM_TETRA4, INTERP_KERNEL::NORM_PYRA5, INTERP_KERNEL::NORM_PENTA6, INTERP_KERNEL::NORM_HEXA8, INTERP_KERNEL::NORM_HEXGP12, INTERP_KERNEL::NORM_TETRA10, INTERP_KERNEL::NORM_PYRA13, INTERP_KERNEL::NORM_PENTA15, INTERP_KERNEL::NORM_PENTA18, INTERP_KERNEL::NORM_HEXA20, INTERP_KERNEL::NORM_HEXA27, INTERP_KERNEL::NORM_POLYHED };
60 const int MEDCouplingUMesh::MEDCOUPLING2VTKTYPETRADUCER[INTERP_KERNEL::NORM_MAXTYPE+1]={1,3,21,5,9,7,22,34,23,28,-1,-1,-1,-1,10,14,13,-1,12,-1,24,-1,16,27,-1,26,-1,29,32,-1,25,42,36,4};
63 MEDCouplingUMesh *MEDCouplingUMesh::New()
65 return new MEDCouplingUMesh;
68 MEDCouplingUMesh *MEDCouplingUMesh::New(const std::string& meshName, int meshDim)
70 MEDCouplingUMesh *ret=new MEDCouplingUMesh;
71 ret->setName(meshName);
72 ret->setMeshDimension(meshDim);
77 * Returns a new MEDCouplingUMesh which is a full copy of \a this one. No data is shared
78 * between \a this and the new mesh.
79 * \return MEDCouplingUMesh * - a new instance of MEDCouplingMesh. The caller is to
80 * delete this mesh using decrRef() as it is no more needed.
82 MEDCouplingUMesh *MEDCouplingUMesh::deepCopy() const
89 * Returns a new MEDCouplingUMesh which is a copy of \a this one.
90 * \param [in] recDeepCpy - if \a true, the copy is deep, else all data arrays of \a
91 * this mesh are shared by the new mesh.
92 * \return MEDCouplingUMesh * - a new instance of MEDCouplingMesh. The caller is to
93 * delete this mesh using decrRef() as it is no more needed.
95 MEDCouplingUMesh *MEDCouplingUMesh::clone(bool recDeepCpy) const
97 return new MEDCouplingUMesh(*this,recDeepCpy);
101 * This method behaves mostly like MEDCouplingUMesh::deepCopy method, except that only nodal connectivity arrays are deeply copied.
102 * The coordinates are shared between \a this and the returned instance.
104 * \return MEDCouplingUMesh * - A new object instance holding the copy of \a this (deep for connectivity, shallow for coordiantes)
105 * \sa MEDCouplingUMesh::deepCopy
107 MEDCouplingUMesh *MEDCouplingUMesh::deepCopyConnectivityOnly() const
109 checkConnectivityFullyDefined();
110 MCAuto<MEDCouplingUMesh> ret=clone(false);
111 MCAuto<DataArrayInt> c(getNodalConnectivity()->deepCopy()),ci(getNodalConnectivityIndex()->deepCopy());
112 ret->setConnectivity(c,ci);
116 void MEDCouplingUMesh::shallowCopyConnectivityFrom(const MEDCouplingPointSet *other)
119 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::shallowCopyConnectivityFrom : input pointer is null !");
120 const MEDCouplingUMesh *otherC=dynamic_cast<const MEDCouplingUMesh *>(other);
122 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::shallowCopyConnectivityFrom : input pointer is not an MEDCouplingUMesh instance !");
123 MEDCouplingUMesh *otherC2=const_cast<MEDCouplingUMesh *>(otherC);//sorry :(
124 setConnectivity(otherC2->getNodalConnectivity(),otherC2->getNodalConnectivityIndex(),true);
127 std::size_t MEDCouplingUMesh::getHeapMemorySizeWithoutChildren() const
129 std::size_t ret(MEDCouplingPointSet::getHeapMemorySizeWithoutChildren());
133 std::vector<const BigMemoryObject *> MEDCouplingUMesh::getDirectChildrenWithNull() const
135 std::vector<const BigMemoryObject *> ret(MEDCouplingPointSet::getDirectChildrenWithNull());
136 ret.push_back(_nodal_connec);
137 ret.push_back(_nodal_connec_index);
141 void MEDCouplingUMesh::updateTime() const
143 MEDCouplingPointSet::updateTime();
146 updateTimeWith(*_nodal_connec);
148 if(_nodal_connec_index)
150 updateTimeWith(*_nodal_connec_index);
154 MEDCouplingUMesh::MEDCouplingUMesh():_mesh_dim(-2),_nodal_connec(0),_nodal_connec_index(0)
159 * Checks if \a this mesh is well defined. If no exception is thrown by this method,
160 * then \a this mesh is most probably is writable, exchangeable and available for most
161 * of algorithms. When a mesh is constructed from scratch, it is a good habit to call
162 * this method to check that all is in order with \a this mesh.
163 * \throw If the mesh dimension is not set.
164 * \throw If the coordinates array is not set (if mesh dimension != -1 ).
165 * \throw If \a this mesh contains elements of dimension different from the mesh dimension.
166 * \throw If the connectivity data array has more than one component.
167 * \throw If the connectivity data array has a named component.
168 * \throw If the connectivity index data array has more than one component.
169 * \throw If the connectivity index data array has a named component.
171 void MEDCouplingUMesh::checkConsistencyLight() const
174 throw INTERP_KERNEL::Exception("No mesh dimension specified !");
176 MEDCouplingPointSet::checkConsistencyLight();
177 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator iter=_types.begin();iter!=_types.end();iter++)
179 if((int)INTERP_KERNEL::CellModel::GetCellModel(*iter).getDimension()!=_mesh_dim)
181 std::ostringstream message;
182 message << "Mesh invalid because dimension is " << _mesh_dim << " and there is presence of cell(s) with type " << (*iter);
183 throw INTERP_KERNEL::Exception(message.str().c_str());
188 if(_nodal_connec->getNumberOfComponents()!=1)
189 throw INTERP_KERNEL::Exception("Nodal connectivity array is expected to be with number of components set to one !");
190 if(_nodal_connec->getInfoOnComponent(0)!="")
191 throw INTERP_KERNEL::Exception("Nodal connectivity array is expected to have no info on its single component !");
195 throw INTERP_KERNEL::Exception("Nodal connectivity array is not defined !");
196 if(_nodal_connec_index)
198 if(_nodal_connec_index->getNumberOfComponents()!=1)
199 throw INTERP_KERNEL::Exception("Nodal connectivity index array is expected to be with number of components set to one !");
200 if(_nodal_connec_index->getInfoOnComponent(0)!="")
201 throw INTERP_KERNEL::Exception("Nodal connectivity index array is expected to have no info on its single component !");
205 throw INTERP_KERNEL::Exception("Nodal connectivity index array is not defined !");
209 * Checks if \a this mesh is well defined. If no exception is thrown by this method,
210 * then \a this mesh is most probably is writable, exchangeable and available for all
211 * algorithms. <br> In addition to the checks performed by checkConsistencyLight(), this
212 * method thoroughly checks the nodal connectivity.
213 * \param [in] eps - a not used parameter.
214 * \throw If the mesh dimension is not set.
215 * \throw If the coordinates array is not set (if mesh dimension != -1 ).
216 * \throw If \a this mesh contains elements of dimension different from the mesh dimension.
217 * \throw If the connectivity data array has more than one component.
218 * \throw If the connectivity data array has a named component.
219 * \throw If the connectivity index data array has more than one component.
220 * \throw If the connectivity index data array has a named component.
221 * \throw If number of nodes defining an element does not correspond to the type of element.
222 * \throw If the nodal connectivity includes an invalid node id.
224 void MEDCouplingUMesh::checkConsistency(double eps) const
226 checkConsistencyLight();
229 int meshDim=getMeshDimension();
230 int nbOfNodes=getNumberOfNodes();
231 int nbOfCells=getNumberOfCells();
232 const int *ptr=_nodal_connec->getConstPointer();
233 const int *ptrI=_nodal_connec_index->getConstPointer();
234 for(int i=0;i<nbOfCells;i++)
236 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)ptr[ptrI[i]]);
237 if((int)cm.getDimension()!=meshDim)
239 std::ostringstream oss;
240 oss << "MEDCouplingUMesh::checkConsistency : cell << #" << i<< " with type Type " << cm.getRepr() << " in 'this' whereas meshdim == " << meshDim << " !";
241 throw INTERP_KERNEL::Exception(oss.str());
243 int nbOfNodesInCell=ptrI[i+1]-ptrI[i]-1;
245 if(nbOfNodesInCell!=(int)cm.getNumberOfNodes())
247 std::ostringstream oss;
248 oss << "MEDCouplingUMesh::checkConsistency : cell #" << i << " with static Type '" << cm.getRepr() << "' has " << cm.getNumberOfNodes();
249 oss << " nodes whereas in connectivity there is " << nbOfNodesInCell << " nodes ! Looks very bad !";
250 throw INTERP_KERNEL::Exception(oss.str());
252 if(cm.isQuadratic() && cm.isDynamic() && meshDim == 2)
253 if (nbOfNodesInCell % 2 || nbOfNodesInCell < 4)
255 std::ostringstream oss;
256 oss << "MEDCouplingUMesh::checkConsistency : cell #" << i << " with quadratic type '" << cm.getRepr() << "' has " << nbOfNodesInCell;
257 oss << " nodes. This should be even, and greater or equal than 4!! Looks very bad!";
258 throw INTERP_KERNEL::Exception(oss.str());
260 for(const int *w=ptr+ptrI[i]+1;w!=ptr+ptrI[i+1];w++)
265 if(nodeId>=nbOfNodes)
267 std::ostringstream oss; oss << "Cell #" << i << " is built with node #" << nodeId << " whereas there are only " << nbOfNodes << " nodes in the mesh !";
268 throw INTERP_KERNEL::Exception(oss.str());
273 std::ostringstream oss; oss << "Cell #" << i << " is built with node #" << nodeId << " in connectivity ! sounds bad !";
274 throw INTERP_KERNEL::Exception(oss.str());
278 if((INTERP_KERNEL::NormalizedCellType)(ptr[ptrI[i]])!=INTERP_KERNEL::NORM_POLYHED)
280 std::ostringstream oss; oss << "Cell #" << i << " is built with node #-1 in connectivity ! sounds bad !";
281 throw INTERP_KERNEL::Exception(oss.str());
289 * Sets dimension of \a this mesh. The mesh dimension in general depends on types of
290 * elements contained in the mesh. For more info on the mesh dimension see
291 * \ref MEDCouplingUMeshPage.
292 * \param [in] meshDim - a new mesh dimension.
293 * \throw If \a meshDim is invalid. A valid range is <em> -1 <= meshDim <= 3</em>.
295 void MEDCouplingUMesh::setMeshDimension(int meshDim)
297 if(meshDim<-1 || meshDim>3)
298 throw INTERP_KERNEL::Exception("Invalid meshDim specified ! Must be greater or equal to -1 and lower or equal to 3 !");
304 * Allocates memory to store an estimation of the given number of cells.
305 * The closer the estimation to the number of cells effectively inserted, the less need the library requires
306 * to reallocate memory. If the number of cells to be inserted is not known simply assign 0 to this parameter.
307 * If a nodal connectivity previously existed before the call of this method, it will be reset.
309 * \param [in] nbOfCells - estimation of the number of cell \a this mesh will contain.
311 * \if ENABLE_EXAMPLES
312 * \ref medcouplingcppexamplesUmeshStdBuild1 "Here is a C++ example".<br>
313 * \ref medcouplingpyexamplesUmeshStdBuild1 "Here is a Python example".
316 void MEDCouplingUMesh::allocateCells(int nbOfCells)
319 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::allocateCells : the input number of cells should be >= 0 !");
320 if(_nodal_connec_index)
322 _nodal_connec_index->decrRef();
326 _nodal_connec->decrRef();
328 _nodal_connec_index=DataArrayInt::New();
329 _nodal_connec_index->reserve(nbOfCells+1);
330 _nodal_connec_index->pushBackSilent(0);
331 _nodal_connec=DataArrayInt::New();
332 _nodal_connec->reserve(2*nbOfCells);
338 * Appends a cell to the connectivity array. For deeper understanding what is
339 * happening see \ref MEDCouplingUMeshNodalConnectivity.
340 * \param [in] type - type of cell to add.
341 * \param [in] size - number of nodes constituting this cell.
342 * \param [in] nodalConnOfCell - the connectivity of the cell to add.
344 * \if ENABLE_EXAMPLES
345 * \ref medcouplingcppexamplesUmeshStdBuild1 "Here is a C++ example".<br>
346 * \ref medcouplingpyexamplesUmeshStdBuild1 "Here is a Python example".
349 void MEDCouplingUMesh::insertNextCell(INTERP_KERNEL::NormalizedCellType type, int size, const int *nodalConnOfCell)
351 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(type);
352 if(_nodal_connec_index==0)
353 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::insertNextCell : nodal connectivity not set ! invoke allocateCells before calling insertNextCell !");
354 if((int)cm.getDimension()==_mesh_dim)
357 if(size!=(int)cm.getNumberOfNodes())
359 std::ostringstream oss; oss << "MEDCouplingUMesh::insertNextCell : Trying to push a " << cm.getRepr() << " cell with a size of " << size;
360 oss << " ! Expecting " << cm.getNumberOfNodes() << " !";
361 throw INTERP_KERNEL::Exception(oss.str());
363 int idx=_nodal_connec_index->back();
365 _nodal_connec_index->pushBackSilent(val);
366 _nodal_connec->writeOnPlace(idx,type,nodalConnOfCell,size);
371 std::ostringstream oss; oss << "MEDCouplingUMesh::insertNextCell : cell type " << cm.getRepr() << " has a dimension " << cm.getDimension();
372 oss << " whereas Mesh Dimension of current UMesh instance is set to " << _mesh_dim << " ! Please invoke \"setMeshDimension\" method before or invoke ";
373 oss << "\"MEDCouplingUMesh::New\" static method with 2 parameters name and meshDimension !";
374 throw INTERP_KERNEL::Exception(oss.str());
379 * Compacts data arrays to release unused memory. This method is to be called after
380 * finishing cell insertion using \a this->insertNextCell().
382 * \if ENABLE_EXAMPLES
383 * \ref medcouplingcppexamplesUmeshStdBuild1 "Here is a C++ example".<br>
384 * \ref medcouplingpyexamplesUmeshStdBuild1 "Here is a Python example".
387 void MEDCouplingUMesh::finishInsertingCells()
389 _nodal_connec->pack();
390 _nodal_connec_index->pack();
391 _nodal_connec->declareAsNew();
392 _nodal_connec_index->declareAsNew();
397 * Entry point for iteration over cells of this. Warning the returned cell iterator should be deallocated.
398 * Useful for python users.
400 MEDCouplingUMeshCellIterator *MEDCouplingUMesh::cellIterator()
402 return new MEDCouplingUMeshCellIterator(this);
406 * Entry point for iteration over cells groups geo types per geotypes. Warning the returned cell iterator should be deallocated.
407 * If \a this is not so that that cells are grouped by geo types this method will throw an exception.
408 * In this case MEDCouplingUMesh::sortCellsInMEDFileFrmt or MEDCouplingUMesh::rearrange2ConsecutiveCellTypes methods for example can be called before invoking this method.
409 * Useful for python users.
411 MEDCouplingUMeshCellByTypeEntry *MEDCouplingUMesh::cellsByType()
413 if(!checkConsecutiveCellTypes())
414 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::cellsByType : this mesh is not sorted by type !");
415 return new MEDCouplingUMeshCellByTypeEntry(this);
419 * Returns a set of all cell types available in \a this mesh.
420 * \return std::set<INTERP_KERNEL::NormalizedCellType> - the set of cell types.
421 * \warning this method does not throw any exception even if \a this is not defined.
422 * \sa MEDCouplingUMesh::getAllGeoTypesSorted
424 std::set<INTERP_KERNEL::NormalizedCellType> MEDCouplingUMesh::getAllGeoTypes() const
430 * This method returns the sorted list of geometric types in \a this.
431 * Sorted means in the same order than the cells in \a this. A single entry in return vector means the maximal chunk of consecutive cells in \a this
432 * having the same geometric type. So a same geometric type can appear more than once if the cells are not sorted per geometric type.
434 * \throw if connectivity in \a this is not correctly defined.
436 * \sa MEDCouplingMesh::getAllGeoTypes
438 std::vector<INTERP_KERNEL::NormalizedCellType> MEDCouplingUMesh::getAllGeoTypesSorted() const
440 std::vector<INTERP_KERNEL::NormalizedCellType> ret;
441 checkConnectivityFullyDefined();
442 int nbOfCells(getNumberOfCells());
445 if(getNodalConnectivityArrayLen()<1)
446 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getAllGeoTypesSorted : the connectivity in this seems invalid !");
447 const int *c(_nodal_connec->begin()),*ci(_nodal_connec_index->begin());
448 ret.push_back((INTERP_KERNEL::NormalizedCellType)c[*ci++]);
449 for(int i=1;i<nbOfCells;i++,ci++)
450 if(ret.back()!=((INTERP_KERNEL::NormalizedCellType)c[*ci]))
451 ret.push_back((INTERP_KERNEL::NormalizedCellType)c[*ci]);
456 * This method is a method that compares \a this and \a other.
457 * This method compares \b all attributes, even names and component names.
459 bool MEDCouplingUMesh::isEqualIfNotWhy(const MEDCouplingMesh *other, double prec, std::string& reason) const
462 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::isEqualIfNotWhy : input other pointer is null !");
463 std::ostringstream oss; oss.precision(15);
464 const MEDCouplingUMesh *otherC=dynamic_cast<const MEDCouplingUMesh *>(other);
467 reason="mesh given in input is not castable in MEDCouplingUMesh !";
470 if(!MEDCouplingPointSet::isEqualIfNotWhy(other,prec,reason))
472 if(_mesh_dim!=otherC->_mesh_dim)
474 oss << "umesh dimension mismatch : this mesh dimension=" << _mesh_dim << " other mesh dimension=" << otherC->_mesh_dim;
478 if(_types!=otherC->_types)
480 oss << "umesh geometric type mismatch :\nThis geometric types are :";
481 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator iter=_types.begin();iter!=_types.end();iter++)
482 { const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(*iter); oss << cm.getRepr() << ", "; }
483 oss << "\nOther geometric types are :";
484 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator iter=otherC->_types.begin();iter!=otherC->_types.end();iter++)
485 { const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(*iter); oss << cm.getRepr() << ", "; }
489 if(_nodal_connec!=0 || otherC->_nodal_connec!=0)
490 if(_nodal_connec==0 || otherC->_nodal_connec==0)
492 reason="Only one UMesh between the two this and other has its nodal connectivity DataArrayInt defined !";
495 if(_nodal_connec!=otherC->_nodal_connec)
496 if(!_nodal_connec->isEqualIfNotWhy(*otherC->_nodal_connec,reason))
498 reason.insert(0,"Nodal connectivity DataArrayInt differ : ");
501 if(_nodal_connec_index!=0 || otherC->_nodal_connec_index!=0)
502 if(_nodal_connec_index==0 || otherC->_nodal_connec_index==0)
504 reason="Only one UMesh between the two this and other has its nodal connectivity index DataArrayInt defined !";
507 if(_nodal_connec_index!=otherC->_nodal_connec_index)
508 if(!_nodal_connec_index->isEqualIfNotWhy(*otherC->_nodal_connec_index,reason))
510 reason.insert(0,"Nodal connectivity index DataArrayInt differ : ");
517 * Checks if data arrays of this mesh (node coordinates, nodal
518 * connectivity of cells, etc) of two meshes are same. Textual data like name etc. are
520 * \param [in] other - the mesh to compare with.
521 * \param [in] prec - precision value used to compare node coordinates.
522 * \return bool - \a true if the two meshes are same.
524 bool MEDCouplingUMesh::isEqualWithoutConsideringStr(const MEDCouplingMesh *other, double prec) const
526 const MEDCouplingUMesh *otherC=dynamic_cast<const MEDCouplingUMesh *>(other);
529 if(!MEDCouplingPointSet::isEqualWithoutConsideringStr(other,prec))
531 if(_mesh_dim!=otherC->_mesh_dim)
533 if(_types!=otherC->_types)
535 if(_nodal_connec!=0 || otherC->_nodal_connec!=0)
536 if(_nodal_connec==0 || otherC->_nodal_connec==0)
538 if(_nodal_connec!=otherC->_nodal_connec)
539 if(!_nodal_connec->isEqualWithoutConsideringStr(*otherC->_nodal_connec))
541 if(_nodal_connec_index!=0 || otherC->_nodal_connec_index!=0)
542 if(_nodal_connec_index==0 || otherC->_nodal_connec_index==0)
544 if(_nodal_connec_index!=otherC->_nodal_connec_index)
545 if(!_nodal_connec_index->isEqualWithoutConsideringStr(*otherC->_nodal_connec_index))
551 * Checks if \a this and \a other meshes are geometrically equivalent with high
552 * probability, else an exception is thrown. The meshes are considered equivalent if
553 * (1) meshes contain the same number of nodes and the same number of elements of the
554 * same types (2) three cells of the two meshes (first, last and middle) are based
555 * on coincident nodes (with a specified precision).
556 * \param [in] other - the mesh to compare with.
557 * \param [in] prec - the precision used to compare nodes of the two meshes.
558 * \throw If the two meshes do not match.
560 void MEDCouplingUMesh::checkFastEquivalWith(const MEDCouplingMesh *other, double prec) const
562 MEDCouplingPointSet::checkFastEquivalWith(other,prec);
563 const MEDCouplingUMesh *otherC=dynamic_cast<const MEDCouplingUMesh *>(other);
565 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkFastEquivalWith : Two meshes are not not unstructured !");
569 * Returns the reverse nodal connectivity. The reverse nodal connectivity enumerates
570 * cells each node belongs to.
571 * \warning For speed reasons, this method does not check if node ids in the nodal
572 * connectivity correspond to the size of node coordinates array.
573 * \param [in,out] revNodal - an array holding ids of cells sharing each node.
574 * \param [in,out] revNodalIndx - an array, of length \a this->getNumberOfNodes() + 1,
575 * dividing cell ids in \a revNodal into groups each referring to one
576 * node. Its every element (except the last one) is an index pointing to the
577 * first id of a group of cells. For example cells sharing the node #1 are
578 * described by following range of indices:
579 * [ \a revNodalIndx[1], \a revNodalIndx[2] ) and the cell ids are
580 * \a revNodal[ \a revNodalIndx[1] ], \a revNodal[ \a revNodalIndx[1] + 1], ...
581 * Number of cells sharing the *i*-th node is
582 * \a revNodalIndx[ *i*+1 ] - \a revNodalIndx[ *i* ].
583 * \throw If the coordinates array is not set.
584 * \throw If the nodal connectivity of cells is not defined.
586 * \if ENABLE_EXAMPLES
587 * \ref cpp_mcumesh_getReverseNodalConnectivity "Here is a C++ example".<br>
588 * \ref py_mcumesh_getReverseNodalConnectivity "Here is a Python example".
591 void MEDCouplingUMesh::getReverseNodalConnectivity(DataArrayInt *revNodal, DataArrayInt *revNodalIndx) const
594 int nbOfNodes(getNumberOfNodes());
595 int *revNodalIndxPtr=(int *)malloc((nbOfNodes+1)*sizeof(int));
596 revNodalIndx->useArray(revNodalIndxPtr,true,C_DEALLOC,nbOfNodes+1,1);
597 std::fill(revNodalIndxPtr,revNodalIndxPtr+nbOfNodes+1,0);
598 const int *conn(_nodal_connec->begin()),*connIndex(_nodal_connec_index->begin());
599 int nbOfCells(getNumberOfCells()),nbOfEltsInRevNodal(0);
600 for(int eltId=0;eltId<nbOfCells;eltId++)
602 const int *strtNdlConnOfCurCell(conn+connIndex[eltId]+1),*endNdlConnOfCurCell(conn+connIndex[eltId+1]);
603 for(const int *iter=strtNdlConnOfCurCell;iter!=endNdlConnOfCurCell;iter++)
604 if(*iter>=0)//for polyhedrons
606 nbOfEltsInRevNodal++;
607 revNodalIndxPtr[(*iter)+1]++;
610 std::transform(revNodalIndxPtr+1,revNodalIndxPtr+nbOfNodes+1,revNodalIndxPtr,revNodalIndxPtr+1,std::plus<int>());
611 int *revNodalPtr=(int *)malloc((nbOfEltsInRevNodal)*sizeof(int));
612 revNodal->useArray(revNodalPtr,true,C_DEALLOC,nbOfEltsInRevNodal,1);
613 std::fill(revNodalPtr,revNodalPtr+nbOfEltsInRevNodal,-1);
614 for(int eltId=0;eltId<nbOfCells;eltId++)
616 const int *strtNdlConnOfCurCell=conn+connIndex[eltId]+1;
617 const int *endNdlConnOfCurCell=conn+connIndex[eltId+1];
618 for(const int *iter=strtNdlConnOfCurCell;iter!=endNdlConnOfCurCell;iter++)
619 if(*iter>=0)//for polyhedrons
620 *std::find_if(revNodalPtr+revNodalIndxPtr[*iter],revNodalPtr+revNodalIndxPtr[*iter+1],std::bind2nd(std::equal_to<int>(),-1))=eltId;
625 * Creates a new MEDCouplingUMesh containing cells, of dimension one less than \a
626 * this->getMeshDimension(), that bound cells of \a this mesh. In addition arrays
627 * describing correspondence between cells of \a this and the result meshes are
628 * returned. The arrays \a desc and \a descIndx (\ref numbering-indirect) describe the descending connectivity,
629 * i.e. enumerate cells of the result mesh bounding each cell of \a this mesh. The
630 * arrays \a revDesc and \a revDescIndx (\ref numbering-indirect) describe the reverse descending connectivity,
631 * i.e. enumerate cells of \a this mesh bounded by each cell of the result mesh.
632 * \warning For speed reasons, this method does not check if node ids in the nodal
633 * connectivity correspond to the size of node coordinates array.
634 * \warning Cells of the result mesh are \b not sorted by geometric type, hence,
635 * to write this mesh to the MED file, its cells must be sorted using
636 * sortCellsInMEDFileFrmt().
637 * \param [in,out] desc - the array containing cell ids of the result mesh bounding
638 * each cell of \a this mesh.
639 * \param [in,out] descIndx - the array, of length \a this->getNumberOfCells() + 1,
640 * dividing cell ids in \a desc into groups each referring to one
641 * cell of \a this mesh. Its every element (except the last one) is an index
642 * pointing to the first id of a group of cells. For example cells of the
643 * result mesh bounding the cell #1 of \a this mesh are described by following
645 * [ \a descIndx[1], \a descIndx[2] ) and the cell ids are
646 * \a desc[ \a descIndx[1] ], \a desc[ \a descIndx[1] + 1], ...
647 * Number of cells of the result mesh sharing the *i*-th cell of \a this mesh is
648 * \a descIndx[ *i*+1 ] - \a descIndx[ *i* ].
649 * \param [in,out] revDesc - the array containing cell ids of \a this mesh bounded
650 * by each cell of the result mesh.
651 * \param [in,out] revDescIndx - the array, of length one more than number of cells
652 * in the result mesh,
653 * dividing cell ids in \a revDesc into groups each referring to one
654 * cell of the result mesh the same way as \a descIndx divides \a desc.
655 * \return MEDCouplingUMesh * - a new instance of MEDCouplingUMesh. The caller is to
656 * delete this mesh using decrRef() as it is no more needed.
657 * \throw If the coordinates array is not set.
658 * \throw If the nodal connectivity of cells is node defined.
659 * \throw If \a desc == NULL || \a descIndx == NULL || \a revDesc == NULL || \a
660 * revDescIndx == NULL.
662 * \if ENABLE_EXAMPLES
663 * \ref cpp_mcumesh_buildDescendingConnectivity "Here is a C++ example".<br>
664 * \ref py_mcumesh_buildDescendingConnectivity "Here is a Python example".
666 * \sa buildDescendingConnectivity2()
668 MEDCouplingUMesh *MEDCouplingUMesh::buildDescendingConnectivity(DataArrayInt *desc, DataArrayInt *descIndx, DataArrayInt *revDesc, DataArrayInt *revDescIndx) const
670 return buildDescendingConnectivityGen<MinusOneSonsGenerator>(desc,descIndx,revDesc,revDescIndx,MEDCouplingFastNbrer);
674 * \a this has to have a mesh dimension equal to 3. If it is not the case an INTERP_KERNEL::Exception will be thrown.
675 * This behaves exactly as MEDCouplingUMesh::buildDescendingConnectivity does except that this method compute directly the transition from mesh dimension 3 to sub edges (dimension 1)
676 * in one shot. That is to say that this method is equivalent to 2 successive calls to MEDCouplingUMesh::buildDescendingConnectivity.
677 * This method returns 4 arrays and a mesh as MEDCouplingUMesh::buildDescendingConnectivity does.
678 * \sa MEDCouplingUMesh::buildDescendingConnectivity
680 MEDCouplingUMesh *MEDCouplingUMesh::explode3DMeshTo1D(DataArrayInt *desc, DataArrayInt *descIndx, DataArrayInt *revDesc, DataArrayInt *revDescIndx) const
683 if(getMeshDimension()!=3)
684 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::explode3DMeshTo1D : This has to have a mesh dimension to 3 !");
685 return buildDescendingConnectivityGen<MinusTwoSonsGenerator>(desc,descIndx,revDesc,revDescIndx,MEDCouplingFastNbrer);
689 * This method computes the micro edges constituting each cell in \a this. Micro edge is an edge for non quadratic cells. Micro edge is an half edge for quadratic cells.
690 * This method works for both meshes with mesh dimenstion equal to 2 or 3. Dynamical cells are not supported (polygons, polyhedrons...)
692 * \sa explode3DMeshTo1D, buildDescendingConnectiviy
694 MEDCouplingUMesh *MEDCouplingUMesh::explodeMeshIntoMicroEdges(DataArrayInt *desc, DataArrayInt *descIndx, DataArrayInt *revDesc, DataArrayInt *revDescIndx) const
697 switch(getMeshDimension())
700 return buildDescendingConnectivityGen<MicroEdgesGenerator2D>(desc,descIndx,revDesc,revDescIndx,MEDCouplingFastNbrer);
702 return buildDescendingConnectivityGen<MicroEdgesGenerator2D>(desc,descIndx,revDesc,revDescIndx,MEDCouplingFastNbrer);
704 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::explodeMeshIntoMicroEdges : Only 2D and 3D supported !");
709 * Creates a new MEDCouplingUMesh containing cells, of dimension one less than \a
710 * this->getMeshDimension(), that bound cells of \a this mesh. In
711 * addition arrays describing correspondence between cells of \a this and the result
712 * meshes are returned. The arrays \a desc and \a descIndx (\ref numbering-indirect) describe the descending
713 * connectivity, i.e. enumerate cells of the result mesh bounding each cell of \a this
714 * mesh. This method differs from buildDescendingConnectivity() in that apart
715 * from cell ids, \a desc returns mutual orientation of cells in \a this and the
716 * result meshes. So a positive id means that order of nodes in corresponding cells
717 * of two meshes is same, and a negative id means a reverse order of nodes. Since a
718 * cell with id #0 can't be negative, the array \a desc returns ids in FORTRAN mode,
719 * i.e. cell ids are one-based.
720 * Arrays \a revDesc and \a revDescIndx (\ref numbering-indirect) describe the reverse descending connectivity,
721 * i.e. enumerate cells of \a this mesh bounded by each cell of the result mesh.
722 * \warning For speed reasons, this method does not check if node ids in the nodal
723 * connectivity correspond to the size of node coordinates array.
724 * \warning Cells of the result mesh are \b not sorted by geometric type, hence,
725 * to write this mesh to the MED file, its cells must be sorted using
726 * sortCellsInMEDFileFrmt().
727 * \param [in,out] desc - the array containing cell ids of the result mesh bounding
728 * each cell of \a this mesh.
729 * \param [in,out] descIndx - the array, of length \a this->getNumberOfCells() + 1,
730 * dividing cell ids in \a desc into groups each referring to one
731 * cell of \a this mesh. Its every element (except the last one) is an index
732 * pointing to the first id of a group of cells. For example cells of the
733 * result mesh bounding the cell #1 of \a this mesh are described by following
735 * [ \a descIndx[1], \a descIndx[2] ) and the cell ids are
736 * \a desc[ \a descIndx[1] ], \a desc[ \a descIndx[1] + 1], ...
737 * Number of cells of the result mesh sharing the *i*-th cell of \a this mesh is
738 * \a descIndx[ *i*+1 ] - \a descIndx[ *i* ].
739 * \param [in,out] revDesc - the array containing cell ids of \a this mesh bounded
740 * by each cell of the result mesh.
741 * \param [in,out] revDescIndx - the array, of length one more than number of cells
742 * in the result mesh,
743 * dividing cell ids in \a revDesc into groups each referring to one
744 * cell of the result mesh the same way as \a descIndx divides \a desc.
745 * \return MEDCouplingUMesh * - a new instance of MEDCouplingUMesh. This result mesh
746 * shares the node coordinates array with \a this mesh. The caller is to
747 * delete this mesh using decrRef() as it is no more needed.
748 * \throw If the coordinates array is not set.
749 * \throw If the nodal connectivity of cells is node defined.
750 * \throw If \a desc == NULL || \a descIndx == NULL || \a revDesc == NULL || \a
751 * revDescIndx == NULL.
753 * \if ENABLE_EXAMPLES
754 * \ref cpp_mcumesh_buildDescendingConnectivity2 "Here is a C++ example".<br>
755 * \ref py_mcumesh_buildDescendingConnectivity2 "Here is a Python example".
757 * \sa buildDescendingConnectivity()
759 MEDCouplingUMesh *MEDCouplingUMesh::buildDescendingConnectivity2(DataArrayInt *desc, DataArrayInt *descIndx, DataArrayInt *revDesc, DataArrayInt *revDescIndx) const
761 return buildDescendingConnectivityGen<MinusOneSonsGenerator>(desc,descIndx,revDesc,revDescIndx,MEDCouplingOrientationSensitiveNbrer);
765 * \b WARNING this method do the assumption that connectivity lies on the coordinates set.
766 * For speed reasons no check of this will be done. This method calls
767 * MEDCouplingUMesh::buildDescendingConnectivity to compute the result.
768 * This method lists cell by cell in \b this which are its neighbors. To compute the result
769 * only connectivities are considered.
770 * The neighbor cells of cell having id 'cellId' are neighbors[neighborsIndx[cellId]:neighborsIndx[cellId+1]].
771 * The format of return is hence \ref numbering-indirect.
773 * \param [out] neighbors is an array storing all the neighbors of all cells in \b this. This array is newly
774 * allocated and should be dealt by the caller. \b neighborsIndx 2nd output
775 * parameter allows to select the right part in this array (\ref numbering-indirect). The number of tuples
776 * is equal to the last values in \b neighborsIndx.
777 * \param [out] neighborsIndx is an array of size this->getNumberOfCells()+1 newly allocated and should be
778 * dealt by the caller. This arrays allow to use the first output parameter \b neighbors (\ref numbering-indirect).
780 void MEDCouplingUMesh::computeNeighborsOfCells(DataArrayInt *&neighbors, DataArrayInt *&neighborsIndx) const
782 MCAuto<DataArrayInt> desc=DataArrayInt::New();
783 MCAuto<DataArrayInt> descIndx=DataArrayInt::New();
784 MCAuto<DataArrayInt> revDesc=DataArrayInt::New();
785 MCAuto<DataArrayInt> revDescIndx=DataArrayInt::New();
786 MCAuto<MEDCouplingUMesh> meshDM1=buildDescendingConnectivity(desc,descIndx,revDesc,revDescIndx);
788 ComputeNeighborsOfCellsAdv(desc,descIndx,revDesc,revDescIndx,neighbors,neighborsIndx);
791 void MEDCouplingUMesh::computeCellNeighborhoodFromNodesOne(const DataArrayInt *nodeNeigh, const DataArrayInt *nodeNeighI, MCAuto<DataArrayInt>& cellNeigh, MCAuto<DataArrayInt>& cellNeighIndex) const
793 if(!nodeNeigh || !nodeNeighI)
794 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::computeCellNeighborhoodFromNodesOne : null pointer !");
795 checkConsistencyLight();
796 nodeNeigh->checkAllocated(); nodeNeighI->checkAllocated();
797 nodeNeigh->checkNbOfComps(1,"MEDCouplingUMesh::computeCellNeighborhoodFromNodesOne : node neigh");
798 nodeNeighI->checkNbOfComps(1,"MEDCouplingUMesh::computeCellNeighborhoodFromNodesOne : node neigh index");
799 nodeNeighI->checkNbOfTuples(1+getNumberOfNodes(),"MEDCouplingUMesh::computeCellNeighborhoodFromNodesOne : invalid length");
800 int nbCells(getNumberOfCells());
801 const int *c(_nodal_connec->begin()),*ci(_nodal_connec_index->begin()),*ne(nodeNeigh->begin()),*nei(nodeNeighI->begin());
802 cellNeigh=DataArrayInt::New(); cellNeigh->alloc(0,1); cellNeighIndex=DataArrayInt::New(); cellNeighIndex->alloc(1,1); cellNeighIndex->setIJ(0,0,0);
803 for(int i=0;i<nbCells;i++)
806 for(const int *it=c+ci[i]+1;it!=c+ci[i+1];it++)
808 s.insert(ne+nei[*it],ne+nei[*it+1]);
810 cellNeigh->insertAtTheEnd(s.begin(),s.end());
811 cellNeighIndex->pushBackSilent(cellNeigh->getNumberOfTuples());
816 * This method is called by MEDCouplingUMesh::computeNeighborsOfCells. This methods performs the algorithm
817 * of MEDCouplingUMesh::computeNeighborsOfCells.
818 * This method is useful for users that want to reduce along a criterion the set of neighbours cell. This is
819 * typically the case to extract a set a neighbours,
820 * excluding a set of meshdim-1 cells in input descending connectivity.
821 * Typically \b desc, \b descIndx, \b revDesc and \b revDescIndx (\ref numbering-indirect) input params are
822 * the result of MEDCouplingUMesh::buildDescendingConnectivity.
823 * This method lists cell by cell in \b this which are its neighbors. To compute the result only connectivities
825 * The neighbor cells of cell having id 'cellId' are neighbors[neighborsIndx[cellId]:neighborsIndx[cellId+1]].
827 * \param [in] desc descending connectivity array.
828 * \param [in] descIndx descending connectivity index array used to walk through \b desc (\ref numbering-indirect).
829 * \param [in] revDesc reverse descending connectivity array.
830 * \param [in] revDescIndx reverse descending connectivity index array used to walk through \b revDesc (\ref numbering-indirect).
831 * \param [out] neighbors is an array storing all the neighbors of all cells in \b this. This array is newly allocated and should be dealt by the caller. \b neighborsIndx 2nd output
832 * parameter allows to select the right part in this array. The number of tuples is equal to the last values in \b neighborsIndx.
833 * \param [out] neighborsIndx is an array of size this->getNumberOfCells()+1 newly allocated and should be dealt by the caller. This arrays allow to use the first output parameter \b neighbors.
835 void MEDCouplingUMesh::ComputeNeighborsOfCellsAdv(const DataArrayInt *desc, const DataArrayInt *descIndx, const DataArrayInt *revDesc, const DataArrayInt *revDescIndx,
836 DataArrayInt *&neighbors, DataArrayInt *&neighborsIndx)
838 if(!desc || !descIndx || !revDesc || !revDescIndx)
839 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ComputeNeighborsOfCellsAdv some input array is empty !");
840 const int *descPtr=desc->begin();
841 const int *descIPtr=descIndx->begin();
842 const int *revDescPtr=revDesc->begin();
843 const int *revDescIPtr=revDescIndx->begin();
845 int nbCells=descIndx->getNumberOfTuples()-1;
846 MCAuto<DataArrayInt> out0=DataArrayInt::New();
847 MCAuto<DataArrayInt> out1=DataArrayInt::New(); out1->alloc(nbCells+1,1);
848 int *out1Ptr=out1->getPointer();
850 out0->reserve(desc->getNumberOfTuples());
851 for(int i=0;i<nbCells;i++,descIPtr++,out1Ptr++)
853 for(const int *w1=descPtr+descIPtr[0];w1!=descPtr+descIPtr[1];w1++)
855 std::set<int> s(revDescPtr+revDescIPtr[*w1],revDescPtr+revDescIPtr[(*w1)+1]);
857 out0->insertAtTheEnd(s.begin(),s.end());
859 *out1Ptr=out0->getNumberOfTuples();
861 neighbors=out0.retn();
862 neighborsIndx=out1.retn();
866 * Explodes \a this into edges whatever its dimension.
868 MCAuto<MEDCouplingUMesh> MEDCouplingUMesh::explodeIntoEdges(MCAuto<DataArrayInt>& desc, MCAuto<DataArrayInt>& descIndex, MCAuto<DataArrayInt>& revDesc, MCAuto<DataArrayInt>& revDescIndx) const
871 int mdim(getMeshDimension());
872 desc=DataArrayInt::New(); descIndex=DataArrayInt::New(); revDesc=DataArrayInt::New(); revDescIndx=DataArrayInt::New();
873 MCAuto<MEDCouplingUMesh> mesh1D;
878 mesh1D=explode3DMeshTo1D(desc,descIndex,revDesc,revDescIndx);
883 mesh1D=buildDescendingConnectivity(desc,descIndex,revDesc,revDescIndx);
888 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::computeNeighborsOfNodes : Mesh dimension supported are [3,2] !");
895 * \b WARNING this method do the assumption that connectivity lies on the coordinates set.
896 * For speed reasons no check of this will be done. This method calls
897 * MEDCouplingUMesh::buildDescendingConnectivity to compute the result.
898 * This method lists node by node in \b this which are its neighbors. To compute the result
899 * only connectivities are considered.
900 * The neighbor nodes of node having id 'nodeId' are neighbors[neighborsIndx[cellId]:neighborsIndx[cellId+1]].
902 * \param [out] neighbors is an array storing all the neighbors of all nodes in \b this. This array
903 * is newly allocated and should be dealt by the caller. \b neighborsIndx 2nd output
904 * parameter allows to select the right part in this array (\ref numbering-indirect).
905 * The number of tuples is equal to the last values in \b neighborsIndx.
906 * \param [out] neighborsIdx is an array of size this->getNumberOfCells()+1 newly allocated and should
907 * be dealt by the caller. This arrays allow to use the first output parameter \b neighbors.
909 * \sa MEDCouplingUMesh::computeEnlargedNeighborsOfNodes
911 void MEDCouplingUMesh::computeNeighborsOfNodes(DataArrayInt *&neighbors, DataArrayInt *&neighborsIdx) const
914 int mdim(getMeshDimension()),nbNodes(getNumberOfNodes());
915 MCAuto<DataArrayInt> desc(DataArrayInt::New()),descIndx(DataArrayInt::New()),revDesc(DataArrayInt::New()),revDescIndx(DataArrayInt::New());
916 MCConstAuto<MEDCouplingUMesh> mesh1D;
921 mesh1D=explode3DMeshTo1D(desc,descIndx,revDesc,revDescIndx);
926 mesh1D=buildDescendingConnectivity(desc,descIndx,revDesc,revDescIndx);
931 mesh1D.takeRef(this);
936 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::computeNeighborsOfNodes : Mesh dimension supported are [3,2,1] !");
939 desc=DataArrayInt::New(); descIndx=DataArrayInt::New(); revDesc=0; revDescIndx=0;
940 mesh1D->getReverseNodalConnectivity(desc,descIndx);
941 MCAuto<DataArrayInt> ret0(DataArrayInt::New());
942 ret0->alloc(desc->getNumberOfTuples(),1);
943 int *r0Pt(ret0->getPointer());
944 const int *c1DPtr(mesh1D->getNodalConnectivity()->begin()),*rn(desc->begin()),*rni(descIndx->begin());
945 for(int i=0;i<nbNodes;i++,rni++)
947 for(const int *oneDCellIt=rn+rni[0];oneDCellIt!=rn+rni[1];oneDCellIt++)
948 *r0Pt++=c1DPtr[3*(*oneDCellIt)+1]==i?c1DPtr[3*(*oneDCellIt)+2]:c1DPtr[3*(*oneDCellIt)+1];
950 neighbors=ret0.retn();
951 neighborsIdx=descIndx.retn();
955 * Computes enlarged neighbors for each nodes in \a this. The behavior of this method is close to MEDCouplingUMesh::computeNeighborsOfNodes except that the neighborhood of each node is wider here.
956 * A node j is considered to be in the neighborhood of i if and only if there is a cell in \a this containing in its nodal connectivity both i and j.
957 * This method is useful to find ghost cells of a part of a mesh with a code based on fields on nodes.
959 * \sa MEDCouplingUMesh::computeNeighborsOfNodes
961 void MEDCouplingUMesh::computeEnlargedNeighborsOfNodes(MCAuto<DataArrayInt> &neighbors, MCAuto<DataArrayInt>& neighborsIdx) const
964 int nbOfNodes(getNumberOfNodes());
965 const int *conn(_nodal_connec->begin()),*connIndex(_nodal_connec_index->begin());
966 int nbOfCells(getNumberOfCells());
967 std::vector< std::set<int> > st0(nbOfNodes);
968 for(int eltId=0;eltId<nbOfCells;eltId++)
970 const int *strtNdlConnOfCurCell(conn+connIndex[eltId]+1),*endNdlConnOfCurCell(conn+connIndex[eltId+1]);
971 std::set<int> s(strtNdlConnOfCurCell,endNdlConnOfCurCell); s.erase(-1); //for polyhedrons
972 for(std::set<int>::const_iterator iter2=s.begin();iter2!=s.end();iter2++)
973 st0[*iter2].insert(s.begin(),s.end());
975 neighborsIdx=DataArrayInt::New(); neighborsIdx->alloc(nbOfNodes+1,1); neighborsIdx->setIJ(0,0,0);
977 int *neighIdx(neighborsIdx->getPointer());
978 for(std::vector< std::set<int> >::const_iterator it=st0.begin();it!=st0.end();it++,neighIdx++)
981 neighIdx[1]=neighIdx[0];
983 neighIdx[1]=neighIdx[0]+(*it).size()-1;
986 neighbors=DataArrayInt::New(); neighbors->alloc(neighborsIdx->back(),1);
988 const int *neighIdx(neighborsIdx->begin());
989 int *neigh(neighbors->getPointer()),nodeId(0);
990 for(std::vector< std::set<int> >::const_iterator it=st0.begin();it!=st0.end();it++,neighIdx++,nodeId++)
992 std::set<int> s(*it); s.erase(nodeId);
993 std::copy(s.begin(),s.end(),neigh+*neighIdx);
999 * Converts specified cells to either polygons (if \a this is a 2D mesh) or
1000 * polyhedrons (if \a this is a 3D mesh). The cells to convert are specified by an
1001 * array of cell ids. Pay attention that after conversion all algorithms work slower
1002 * with \a this mesh than before conversion. <br> If an exception is thrown during the
1003 * conversion due presence of invalid ids in the array of cells to convert, as a
1004 * result \a this mesh contains some already converted elements. In this case the 2D
1005 * mesh remains valid but 3D mesh becomes \b inconsistent!
1006 * \warning This method can significantly modify the order of geometric types in \a this,
1007 * hence, to write this mesh to the MED file, its cells must be sorted using
1008 * sortCellsInMEDFileFrmt().
1009 * \param [in] cellIdsToConvertBg - the array holding ids of cells to convert.
1010 * \param [in] cellIdsToConvertEnd - a pointer to the last-plus-one-th element of \a
1011 * cellIdsToConvertBg.
1012 * \throw If the coordinates array is not set.
1013 * \throw If the nodal connectivity of cells is node defined.
1014 * \throw If dimension of \a this mesh is not either 2 or 3.
1016 * \if ENABLE_EXAMPLES
1017 * \ref cpp_mcumesh_convertToPolyTypes "Here is a C++ example".<br>
1018 * \ref py_mcumesh_convertToPolyTypes "Here is a Python example".
1021 void MEDCouplingUMesh::convertToPolyTypes(const int *cellIdsToConvertBg, const int *cellIdsToConvertEnd)
1023 checkFullyDefined();
1024 int dim=getMeshDimension();
1026 throw INTERP_KERNEL::Exception("Invalid mesh dimension : must be 2 or 3 !");
1027 int nbOfCells(getNumberOfCells());
1030 const int *connIndex=_nodal_connec_index->begin();
1031 int *conn=_nodal_connec->getPointer();
1032 for(const int *iter=cellIdsToConvertBg;iter!=cellIdsToConvertEnd;iter++)
1034 if(*iter>=0 && *iter<nbOfCells)
1036 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[connIndex[*iter]]);
1037 if(!cm.isQuadratic())
1038 conn[connIndex[*iter]]=INTERP_KERNEL::NORM_POLYGON;
1040 conn[connIndex[*iter]]=INTERP_KERNEL::NORM_QPOLYG;
1044 std::ostringstream oss; oss << "MEDCouplingUMesh::convertToPolyTypes : On rank #" << std::distance(cellIdsToConvertBg,iter) << " value is " << *iter << " which is not";
1045 oss << " in range [0," << nbOfCells << ") !";
1046 throw INTERP_KERNEL::Exception(oss.str());
1052 int *connIndex(_nodal_connec_index->getPointer());
1053 const int *connOld(_nodal_connec->getConstPointer());
1054 MCAuto<DataArrayInt> connNew(DataArrayInt::New()),connNewI(DataArrayInt::New()); connNew->alloc(0,1); connNewI->alloc(1,1); connNewI->setIJ(0,0,0);
1055 std::vector<bool> toBeDone(nbOfCells,false);
1056 for(const int *iter=cellIdsToConvertBg;iter!=cellIdsToConvertEnd;iter++)
1058 if(*iter>=0 && *iter<nbOfCells)
1059 toBeDone[*iter]=true;
1062 std::ostringstream oss; oss << "MEDCouplingUMesh::convertToPolyTypes : On rank #" << std::distance(cellIdsToConvertBg,iter) << " value is " << *iter << " which is not";
1063 oss << " in range [0," << nbOfCells << ") !";
1064 throw INTERP_KERNEL::Exception(oss.str());
1067 for(int cellId=0;cellId<nbOfCells;cellId++)
1069 int pos(connIndex[cellId]),posP1(connIndex[cellId+1]);
1070 int lgthOld(posP1-pos-1);
1071 if(toBeDone[cellId])
1073 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)connOld[pos]);
1074 unsigned nbOfFaces(cm.getNumberOfSons2(connOld+pos+1,lgthOld));
1075 int *tmp(new int[nbOfFaces*lgthOld+1]);
1076 int *work=tmp; *work++=INTERP_KERNEL::NORM_POLYHED;
1077 for(unsigned j=0;j<nbOfFaces;j++)
1079 INTERP_KERNEL::NormalizedCellType type;
1080 unsigned offset=cm.fillSonCellNodalConnectivity2(j,connOld+pos+1,lgthOld,work,type);
1084 std::size_t newLgth(std::distance(tmp,work)-1);//-1 for last -1
1085 connNew->pushBackValsSilent(tmp,tmp+newLgth);
1086 connNewI->pushBackSilent(connNewI->back()+(int)newLgth);
1091 connNew->pushBackValsSilent(connOld+pos,connOld+posP1);
1092 connNewI->pushBackSilent(connNewI->back()+posP1-pos);
1095 setConnectivity(connNew,connNewI,false);//false because computeTypes called just behind.
1101 * Converts all cells to either polygons (if \a this is a 2D mesh) or
1102 * polyhedrons (if \a this is a 3D mesh).
1103 * \warning As this method is purely for user-friendliness and no optimization is
1104 * done to avoid construction of a useless vector, this method can be costly
1106 * \throw If the coordinates array is not set.
1107 * \throw If the nodal connectivity of cells is node defined.
1108 * \throw If dimension of \a this mesh is not either 2 or 3.
1110 void MEDCouplingUMesh::convertAllToPoly()
1112 int nbOfCells=getNumberOfCells();
1113 std::vector<int> cellIds(nbOfCells);
1114 for(int i=0;i<nbOfCells;i++)
1116 convertToPolyTypes(&cellIds[0],&cellIds[0]+cellIds.size());
1120 * Fixes nodal connectivity of invalid cells of type NORM_POLYHED. This method
1121 * expects that all NORM_POLYHED cells have connectivity similar to that of prismatic
1122 * volumes like NORM_HEXA8, NORM_PENTA6 etc., i.e. the first half of nodes describes a
1123 * base facet of the volume and the second half of nodes describes an opposite facet
1124 * having the same number of nodes as the base one. This method converts such
1125 * connectivity to a valid polyhedral format where connectivity of each facet is
1126 * explicitly described and connectivity of facets are separated by -1. If \a this mesh
1127 * contains a NORM_POLYHED cell with a valid connectivity, or an invalid connectivity is
1128 * not as expected, an exception is thrown and the mesh remains unchanged. Care of
1129 * a correct orientation of the first facet of a polyhedron, else orientation of a
1130 * corrected cell is reverse.<br>
1131 * This method is useful to build an extruded unstructured mesh with polyhedrons as
1132 * it releases the user from boring description of polyhedra connectivity in the valid
1134 * \throw If \a this->getMeshDimension() != 3.
1135 * \throw If \a this->getSpaceDimension() != 3.
1136 * \throw If the nodal connectivity of cells is not defined.
1137 * \throw If the coordinates array is not set.
1138 * \throw If \a this mesh contains polyhedrons with the valid connectivity.
1139 * \throw If \a this mesh contains polyhedrons with odd number of nodes.
1141 * \if ENABLE_EXAMPLES
1142 * \ref cpp_mcumesh_arePolyhedronsNotCorrectlyOriented "Here is a C++ example".<br>
1143 * \ref py_mcumesh_arePolyhedronsNotCorrectlyOriented "Here is a Python example".
1146 void MEDCouplingUMesh::convertExtrudedPolyhedra()
1148 checkFullyDefined();
1149 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
1150 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertExtrudedPolyhedra works on umeshes with meshdim equal to 3 and spaceDim equal to 3 too!");
1151 int nbOfCells=getNumberOfCells();
1152 MCAuto<DataArrayInt> newCi=DataArrayInt::New();
1153 newCi->alloc(nbOfCells+1,1);
1154 int *newci=newCi->getPointer();
1155 const int *ci=_nodal_connec_index->getConstPointer();
1156 const int *c=_nodal_connec->getConstPointer();
1158 for(int i=0;i<nbOfCells;i++)
1160 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)c[ci[i]];
1161 if(type==INTERP_KERNEL::NORM_POLYHED)
1163 if(std::count(c+ci[i]+1,c+ci[i+1],-1)!=0)
1165 std::ostringstream oss; oss << "MEDCouplingUMesh::convertExtrudedPolyhedra : cell # " << i << " is a polhedron BUT it has NOT exactly 1 face !";
1166 throw INTERP_KERNEL::Exception(oss.str());
1168 std::size_t n2=std::distance(c+ci[i]+1,c+ci[i+1]);
1171 std::ostringstream oss; oss << "MEDCouplingUMesh::convertExtrudedPolyhedra : cell # " << i << " is a polhedron with 1 face but there is a mismatch of number of nodes in face should be even !";
1172 throw INTERP_KERNEL::Exception(oss.str());
1175 newci[i+1]=7*n1+2+newci[i];//6*n1 (nodal length) + n1+2 (number of faces) - 1 (number of '-1' separator is equal to number of faces -1) + 1 (for cell type)
1178 newci[i+1]=(ci[i+1]-ci[i])+newci[i];
1180 MCAuto<DataArrayInt> newC=DataArrayInt::New();
1181 newC->alloc(newci[nbOfCells],1);
1182 int *newc=newC->getPointer();
1183 for(int i=0;i<nbOfCells;i++)
1185 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)c[ci[i]];
1186 if(type==INTERP_KERNEL::NORM_POLYHED)
1188 std::size_t n1=std::distance(c+ci[i]+1,c+ci[i+1])/2;
1189 newc=std::copy(c+ci[i],c+ci[i]+n1+1,newc);
1191 for(std::size_t j=0;j<n1;j++)
1193 newc[j]=c[ci[i]+1+n1+(n1-j)%n1];
1195 newc[n1+5*j+1]=c[ci[i]+1+j];
1196 newc[n1+5*j+2]=c[ci[i]+1+j+n1];
1197 newc[n1+5*j+3]=c[ci[i]+1+(j+1)%n1+n1];
1198 newc[n1+5*j+4]=c[ci[i]+1+(j+1)%n1];
1203 newc=std::copy(c+ci[i],c+ci[i+1],newc);
1205 _nodal_connec_index->decrRef(); _nodal_connec_index=newCi.retn();
1206 _nodal_connec->decrRef(); _nodal_connec=newC.retn();
1211 * Converts all polygons (if \a this is a 2D mesh) or polyhedrons (if \a this is a 3D
1212 * mesh) to cells of classical types. This method is opposite to convertToPolyTypes().
1213 * \warning Cells of the result mesh are \b not sorted by geometric type, hence,
1214 * to write this mesh to the MED file, its cells must be sorted using
1215 * sortCellsInMEDFileFrmt().
1216 * \warning Cells (and most notably polyhedrons) must be correctly oriented for this to work
1217 * properly. See orientCorrectlyPolyhedrons() and arePolyhedronsNotCorrectlyOriented().
1218 * \return \c true if at least one cell has been converted, \c false else. In the
1219 * last case the nodal connectivity remains unchanged.
1220 * \throw If the coordinates array is not set.
1221 * \throw If the nodal connectivity of cells is not defined.
1222 * \throw If \a this->getMeshDimension() < 0.
1224 bool MEDCouplingUMesh::unPolyze()
1226 checkFullyDefined();
1227 int mdim=getMeshDimension();
1229 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::unPolyze works on umeshes with meshdim equals to 0, 1 2 or 3 !");
1232 int nbOfCells=getNumberOfCells();
1235 int initMeshLgth=getNodalConnectivityArrayLen();
1236 int *conn=_nodal_connec->getPointer();
1237 int *index=_nodal_connec_index->getPointer();
1242 for(int i=0;i<nbOfCells;i++)
1244 lgthOfCurCell=index[i+1]-posOfCurCell;
1245 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)conn[posOfCurCell];
1246 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(type);
1247 INTERP_KERNEL::NormalizedCellType newType=INTERP_KERNEL::NORM_ERROR;
1251 switch(cm.getDimension())
1255 INTERP_KERNEL::AutoPtr<int> tmp=new int[lgthOfCurCell-1];
1256 std::copy(conn+posOfCurCell+1,conn+posOfCurCell+lgthOfCurCell,(int *)tmp);
1257 newType=INTERP_KERNEL::CellSimplify::tryToUnPoly2D(cm.isQuadratic(),tmp,lgthOfCurCell-1,conn+newPos+1,newLgth);
1262 int nbOfFaces,lgthOfPolyhConn;
1263 INTERP_KERNEL::AutoPtr<int> zipFullReprOfPolyh=INTERP_KERNEL::CellSimplify::getFullPolyh3DCell(type,conn+posOfCurCell+1,lgthOfCurCell-1,nbOfFaces,lgthOfPolyhConn);
1264 newType=INTERP_KERNEL::CellSimplify::tryToUnPoly3D(zipFullReprOfPolyh,nbOfFaces,lgthOfPolyhConn,conn+newPos+1,newLgth);
1269 newType=(lgthOfCurCell==3)?INTERP_KERNEL::NORM_SEG2:INTERP_KERNEL::NORM_POLYL;
1273 ret=ret || (newType!=type);
1274 conn[newPos]=newType;
1276 posOfCurCell=index[i+1];
1281 std::copy(conn+posOfCurCell,conn+posOfCurCell+lgthOfCurCell,conn+newPos);
1282 newPos+=lgthOfCurCell;
1283 posOfCurCell+=lgthOfCurCell;
1287 if(newPos!=initMeshLgth)
1288 _nodal_connec->reAlloc(newPos);
1295 * This method expects that spaceDimension is equal to 3 and meshDimension equal to 3.
1296 * This method performs operation only on polyhedrons in \b this. If no polyhedrons exists in \b this, \b this remains unchanged.
1297 * This method allows to merge if any coplanar 3DSurf cells that may appear in some polyhedrons cells.
1299 * \param [in] eps is a relative precision that allows to establish if some 3D plane are coplanar or not. This epsilon is used to recenter around origin to have maximal
1302 void MEDCouplingUMesh::simplifyPolyhedra(double eps)
1304 checkFullyDefined();
1305 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
1306 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::simplifyPolyhedra : works on meshdimension 3 and spaceDimension 3 !");
1307 MCAuto<DataArrayDouble> coords=getCoords()->deepCopy();
1308 coords->recenterForMaxPrecision(eps);
1310 int nbOfCells=getNumberOfCells();
1311 const int *conn=_nodal_connec->getConstPointer();
1312 const int *index=_nodal_connec_index->getConstPointer();
1313 MCAuto<DataArrayInt> connINew=DataArrayInt::New();
1314 connINew->alloc(nbOfCells+1,1);
1315 int *connINewPtr=connINew->getPointer(); *connINewPtr++=0;
1316 MCAuto<DataArrayInt> connNew=DataArrayInt::New(); connNew->alloc(0,1);
1317 MCAuto<DataArrayInt> E_Fi(DataArrayInt::New()), E_F(DataArrayInt::New()), F_Ei(DataArrayInt::New()), F_E(DataArrayInt::New());
1318 MCAuto<MEDCouplingUMesh> m_faces(buildDescendingConnectivity(E_F, E_Fi, F_E, F_Ei));
1320 for(int i=0;i<nbOfCells;i++,connINewPtr++)
1322 if(conn[index[i]]==(int)INTERP_KERNEL::NORM_POLYHED)
1324 SimplifyPolyhedronCell(eps,coords, i,connNew, m_faces, E_Fi, E_F, F_Ei, F_E);
1328 connNew->insertAtTheEnd(conn+index[i],conn+index[i+1]);
1329 *connINewPtr=connNew->getNumberOfTuples();
1332 setConnectivity(connNew,connINew,false);
1336 * This method returns all node ids used in the connectivity of \b this. The data array returned has to be dealt by the caller.
1337 * The returned node ids are sorted ascendingly. This method is close to MEDCouplingUMesh::getNodeIdsInUse except
1338 * the format of the returned DataArrayInt instance.
1340 * \return a newly allocated DataArrayInt sorted ascendingly of fetched node ids.
1341 * \sa MEDCouplingUMesh::getNodeIdsInUse, areAllNodesFetched
1343 DataArrayInt *MEDCouplingUMesh::computeFetchedNodeIds() const
1345 checkConnectivityFullyDefined();
1346 const int *maxEltPt(std::max_element(_nodal_connec->begin(),_nodal_connec->end()));
1347 int maxElt(maxEltPt==_nodal_connec->end()?0:std::abs(*maxEltPt)+1);
1348 std::vector<bool> retS(maxElt,false);
1349 computeNodeIdsAlg(retS);
1350 return DataArrayInt::BuildListOfSwitchedOn(retS);
1354 * \param [in,out] nodeIdsInUse an array of size typically equal to nbOfNodes.
1355 * \sa MEDCouplingUMesh::getNodeIdsInUse, areAllNodesFetched
1357 void MEDCouplingUMesh::computeNodeIdsAlg(std::vector<bool>& nodeIdsInUse) const
1359 int nbOfNodes((int)nodeIdsInUse.size()),nbOfCells(getNumberOfCells());
1360 const int *connIndex(_nodal_connec_index->getConstPointer()),*conn(_nodal_connec->getConstPointer());
1361 for(int i=0;i<nbOfCells;i++)
1362 for(int j=connIndex[i]+1;j<connIndex[i+1];j++)
1365 if(conn[j]<nbOfNodes)
1366 nodeIdsInUse[conn[j]]=true;
1369 std::ostringstream oss; oss << "MEDCouplingUMesh::computeNodeIdsAlg : In cell #" << i << " presence of node id " << conn[j] << " not in [0," << nbOfNodes << ") !";
1370 throw INTERP_KERNEL::Exception(oss.str());
1377 struct MEDCouplingAccVisit
1379 MEDCouplingAccVisit():_new_nb_of_nodes(0) { }
1380 int operator()(int val) { if(val!=-1) return _new_nb_of_nodes++; else return -1; }
1381 int _new_nb_of_nodes;
1387 * Finds nodes not used in any cell and returns an array giving a new id to every node
1388 * by excluding the unused nodes, for which the array holds -1. The result array is
1389 * a mapping in "Old to New" mode.
1390 * \param [out] nbrOfNodesInUse - number of node ids present in the nodal connectivity.
1391 * \return DataArrayInt * - a new instance of DataArrayInt. Its length is \a
1392 * this->getNumberOfNodes(). It holds for each node of \a this mesh either -1
1393 * if the node is unused or a new id else. The caller is to delete this
1394 * array using decrRef() as it is no more needed.
1395 * \throw If the coordinates array is not set.
1396 * \throw If the nodal connectivity of cells is not defined.
1397 * \throw If the nodal connectivity includes an invalid id.
1399 * \if ENABLE_EXAMPLES
1400 * \ref cpp_mcumesh_getNodeIdsInUse "Here is a C++ example".<br>
1401 * \ref py_mcumesh_getNodeIdsInUse "Here is a Python example".
1403 * \sa computeFetchedNodeIds, computeNodeIdsAlg()
1405 DataArrayInt *MEDCouplingUMesh::getNodeIdsInUse(int& nbrOfNodesInUse) const
1408 int nbOfNodes(getNumberOfNodes());
1409 MCAuto<DataArrayInt> ret=DataArrayInt::New();
1410 ret->alloc(nbOfNodes,1);
1411 int *traducer=ret->getPointer();
1412 std::fill(traducer,traducer+nbOfNodes,-1);
1413 int nbOfCells=getNumberOfCells();
1414 const int *connIndex=_nodal_connec_index->getConstPointer();
1415 const int *conn=_nodal_connec->getConstPointer();
1416 for(int i=0;i<nbOfCells;i++)
1417 for(int j=connIndex[i]+1;j<connIndex[i+1];j++)
1420 if(conn[j]<nbOfNodes)
1421 traducer[conn[j]]=1;
1424 std::ostringstream oss; oss << "MEDCouplingUMesh::getNodeIdsInUse : In cell #" << i << " presence of node id " << conn[j] << " not in [0," << nbOfNodes << ") !";
1425 throw INTERP_KERNEL::Exception(oss.str());
1428 nbrOfNodesInUse=(int)std::count(traducer,traducer+nbOfNodes,1);
1429 std::transform(traducer,traducer+nbOfNodes,traducer,MEDCouplingAccVisit());
1434 * This method returns a newly allocated array containing this->getNumberOfCells() tuples and 1 component.
1435 * For each cell in \b this the number of nodes constituting cell is computed.
1436 * For each polyhedron cell, the sum of the number of nodes of each face constituting polyhedron cell is returned.
1437 * So for pohyhedrons some nodes can be counted several times in the returned result.
1439 * \return a newly allocated array
1440 * \sa MEDCouplingUMesh::computeEffectiveNbOfNodesPerCell
1442 DataArrayInt *MEDCouplingUMesh::computeNbOfNodesPerCell() const
1444 checkConnectivityFullyDefined();
1445 int nbOfCells=getNumberOfCells();
1446 MCAuto<DataArrayInt> ret=DataArrayInt::New();
1447 ret->alloc(nbOfCells,1);
1448 int *retPtr=ret->getPointer();
1449 const int *conn=getNodalConnectivity()->getConstPointer();
1450 const int *connI=getNodalConnectivityIndex()->getConstPointer();
1451 for(int i=0;i<nbOfCells;i++,retPtr++)
1453 if(conn[connI[i]]!=(int)INTERP_KERNEL::NORM_POLYHED)
1454 *retPtr=connI[i+1]-connI[i]-1;
1456 *retPtr=connI[i+1]-connI[i]-1-std::count(conn+connI[i]+1,conn+connI[i+1],-1);
1462 * This method computes effective number of nodes per cell. That is to say nodes appearing several times in nodal connectivity of a cell,
1463 * will be counted only once here whereas it will be counted several times in MEDCouplingUMesh::computeNbOfNodesPerCell method.
1465 * \return DataArrayInt * - new object to be deallocated by the caller.
1466 * \sa MEDCouplingUMesh::computeNbOfNodesPerCell
1468 DataArrayInt *MEDCouplingUMesh::computeEffectiveNbOfNodesPerCell() const
1470 checkConnectivityFullyDefined();
1471 int nbOfCells=getNumberOfCells();
1472 MCAuto<DataArrayInt> ret=DataArrayInt::New();
1473 ret->alloc(nbOfCells,1);
1474 int *retPtr=ret->getPointer();
1475 const int *conn=getNodalConnectivity()->getConstPointer();
1476 const int *connI=getNodalConnectivityIndex()->getConstPointer();
1477 for(int i=0;i<nbOfCells;i++,retPtr++)
1479 std::set<int> s(conn+connI[i]+1,conn+connI[i+1]);
1480 if(conn[connI[i]]!=(int)INTERP_KERNEL::NORM_POLYHED)
1481 *retPtr=(int)s.size();
1485 *retPtr=(int)s.size();
1492 * This method returns a newly allocated array containing this->getNumberOfCells() tuples and 1 component.
1493 * For each cell in \b this the number of faces constituting (entity of dimension this->getMeshDimension()-1) cell is computed.
1495 * \return a newly allocated array
1497 DataArrayInt *MEDCouplingUMesh::computeNbOfFacesPerCell() const
1499 checkConnectivityFullyDefined();
1500 int nbOfCells=getNumberOfCells();
1501 MCAuto<DataArrayInt> ret=DataArrayInt::New();
1502 ret->alloc(nbOfCells,1);
1503 int *retPtr=ret->getPointer();
1504 const int *conn=getNodalConnectivity()->getConstPointer();
1505 const int *connI=getNodalConnectivityIndex()->getConstPointer();
1506 for(int i=0;i<nbOfCells;i++,retPtr++,connI++)
1508 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[*connI]);
1509 *retPtr=cm.getNumberOfSons2(conn+connI[0]+1,connI[1]-connI[0]-1);
1515 * Removes unused nodes (the node coordinates array is shorten) and returns an array
1516 * mapping between new and old node ids in "Old to New" mode. -1 values in the returned
1517 * array mean that the corresponding old node is no more used.
1518 * \return DataArrayInt * - a new instance of DataArrayInt of length \a
1519 * this->getNumberOfNodes() before call of this method. The caller is to
1520 * delete this array using decrRef() as it is no more needed.
1521 * \throw If the coordinates array is not set.
1522 * \throw If the nodal connectivity of cells is not defined.
1523 * \throw If the nodal connectivity includes an invalid id.
1524 * \sa areAllNodesFetched
1526 * \if ENABLE_EXAMPLES
1527 * \ref cpp_mcumesh_zipCoordsTraducer "Here is a C++ example".<br>
1528 * \ref py_mcumesh_zipCoordsTraducer "Here is a Python example".
1531 DataArrayInt *MEDCouplingUMesh::zipCoordsTraducer()
1533 return MEDCouplingPointSet::zipCoordsTraducer();
1537 * This method stands if 'cell1' and 'cell2' are equals regarding 'compType' policy.
1538 * The semantic of 'compType' is specified in MEDCouplingPointSet::zipConnectivityTraducer method.
1540 int MEDCouplingUMesh::AreCellsEqual(const int *conn, const int *connI, int cell1, int cell2, int compType)
1545 return AreCellsEqualPolicy0(conn,connI,cell1,cell2);
1547 return AreCellsEqualPolicy1(conn,connI,cell1,cell2);
1549 return AreCellsEqualPolicy2(conn,connI,cell1,cell2);
1551 return AreCellsEqualPolicy2NoType(conn,connI,cell1,cell2);
1553 return AreCellsEqualPolicy7(conn,connI,cell1,cell2);
1555 throw INTERP_KERNEL::Exception("Unknown comparison asked ! Must be in 0,1,2,3 or 7.");
1559 * This method is the last step of the MEDCouplingPointSet::zipConnectivityTraducer with policy 0.
1561 int MEDCouplingUMesh::AreCellsEqualPolicy0(const int *conn, const int *connI, int cell1, int cell2)
1563 if(connI[cell1+1]-connI[cell1]==connI[cell2+1]-connI[cell2])
1564 return std::equal(conn+connI[cell1]+1,conn+connI[cell1+1],conn+connI[cell2]+1)?1:0;
1569 * This method is the last step of the MEDCouplingPointSet::zipConnectivityTraducer with policy 1.
1571 int MEDCouplingUMesh::AreCellsEqualPolicy1(const int *conn, const int *connI, int cell1, int cell2)
1573 int sz=connI[cell1+1]-connI[cell1];
1574 if(sz==connI[cell2+1]-connI[cell2])
1576 if(conn[connI[cell1]]==conn[connI[cell2]])
1578 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[connI[cell1]]);
1579 unsigned dim=cm.getDimension();
1585 INTERP_KERNEL::AutoPtr<int> tmp=new int[sz1];
1586 int *work=std::copy(conn+connI[cell1]+1,conn+connI[cell1+1],(int *)tmp);
1587 std::copy(conn+connI[cell1]+1,conn+connI[cell1+1],work);
1588 work=std::search((int *)tmp,(int *)tmp+sz1,conn+connI[cell2]+1,conn+connI[cell2+1]);
1589 return work!=tmp+sz1?1:0;
1592 return std::equal(conn+connI[cell1]+1,conn+connI[cell1+1],conn+connI[cell2]+1)?1:0;//case of SEG2 and SEG3
1595 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::AreCellsEqualPolicy1 : not implemented yet for meshdim == 3 !");
1602 * This method is the last step of the MEDCouplingPointSet::zipConnectivityTraducer with policy 2.
1604 int MEDCouplingUMesh::AreCellsEqualPolicy2(const int *conn, const int *connI, int cell1, int cell2)
1606 if(connI[cell1+1]-connI[cell1]==connI[cell2+1]-connI[cell2])
1608 if(conn[connI[cell1]]==conn[connI[cell2]])
1610 std::set<int> s1(conn+connI[cell1]+1,conn+connI[cell1+1]);
1611 std::set<int> s2(conn+connI[cell2]+1,conn+connI[cell2+1]);
1619 * This method is less restrictive than AreCellsEqualPolicy2. Here the geometric type is absolutely not taken into account !
1621 int MEDCouplingUMesh::AreCellsEqualPolicy2NoType(const int *conn, const int *connI, int cell1, int cell2)
1623 if(connI[cell1+1]-connI[cell1]==connI[cell2+1]-connI[cell2])
1625 std::set<int> s1(conn+connI[cell1]+1,conn+connI[cell1+1]);
1626 std::set<int> s2(conn+connI[cell2]+1,conn+connI[cell2+1]);
1633 * This method is the last step of the MEDCouplingPointSet::zipConnectivityTraducer with policy 7.
1635 int MEDCouplingUMesh::AreCellsEqualPolicy7(const int *conn, const int *connI, int cell1, int cell2)
1637 int sz=connI[cell1+1]-connI[cell1];
1638 if(sz==connI[cell2+1]-connI[cell2])
1640 if(conn[connI[cell1]]==conn[connI[cell2]])
1642 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[connI[cell1]]);
1643 unsigned dim=cm.getDimension();
1649 INTERP_KERNEL::AutoPtr<int> tmp=new int[sz1];
1650 int *work=std::copy(conn+connI[cell1]+1,conn+connI[cell1+1],(int *)tmp);
1651 std::copy(conn+connI[cell1]+1,conn+connI[cell1+1],work);
1652 work=std::search((int *)tmp,(int *)tmp+sz1,conn+connI[cell2]+1,conn+connI[cell2+1]);
1657 std::reverse_iterator<int *> it1((int *)tmp+sz1);
1658 std::reverse_iterator<int *> it2((int *)tmp);
1659 if(std::search(it1,it2,conn+connI[cell2]+1,conn+connI[cell2+1])!=it2)
1665 return work!=tmp+sz1?1:0;
1668 {//case of SEG2 and SEG3
1669 if(std::equal(conn+connI[cell1]+1,conn+connI[cell1+1],conn+connI[cell2]+1))
1671 if(!cm.isQuadratic())
1673 std::reverse_iterator<const int *> it1(conn+connI[cell1+1]);
1674 std::reverse_iterator<const int *> it2(conn+connI[cell1]+1);
1675 if(std::equal(it1,it2,conn+connI[cell2]+1))
1681 if(conn[connI[cell1]+1]==conn[connI[cell2]+2] && conn[connI[cell1]+2]==conn[connI[cell2]+1] && conn[connI[cell1]+3]==conn[connI[cell2]+3])
1688 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::AreCellsEqualPolicy7 : not implemented yet for meshdim == 3 !");
1696 * This method find cells that are equal (regarding \a compType) in \a this. The comparison is specified
1698 * This method keeps the coordiantes of \a this. This method is time consuming.
1700 * \param [in] compType input specifying the technique used to compare cells each other.
1701 * - 0 : exactly. A cell is detected to be the same if and only if the connectivity is exactly the same without permutation and types same too. This is the strongest policy.
1702 * - 1 : permutation same orientation. cell1 and cell2 are considered equal if the connectivity of cell2 can be deduced by those of cell1 by direct permutation (with exactly the same orientation)
1703 * and their type equal. For 1D mesh the policy 1 is equivalent to 0.
1704 * - 2 : nodal. cell1 and cell2 are equal if and only if cell1 and cell2 have same type and have the same nodes constituting connectivity. This is the laziest policy. This policy
1705 * can be used for users not sensitive to orientation of cell
1706 * \param [in] startCellId specifies the cellId starting from which the equality computation will be carried out. By default it is 0, which it means that all cells in \a this will be scanned.
1707 * \param [out] commonCellsArr common cells ids (\ref numbering-indirect)
1708 * \param [out] commonCellsIArr common cells ids (\ref numbering-indirect)
1709 * \return the correspondence array old to new in a newly allocated array.
1712 void MEDCouplingUMesh::findCommonCells(int compType, int startCellId, DataArrayInt *& commonCellsArr, DataArrayInt *& commonCellsIArr) const
1714 MCAuto<DataArrayInt> revNodal=DataArrayInt::New(),revNodalI=DataArrayInt::New();
1715 getReverseNodalConnectivity(revNodal,revNodalI);
1716 FindCommonCellsAlg(compType,startCellId,_nodal_connec,_nodal_connec_index,revNodal,revNodalI,commonCellsArr,commonCellsIArr);
1719 void MEDCouplingUMesh::FindCommonCellsAlg(int compType, int startCellId, const DataArrayInt *nodal, const DataArrayInt *nodalI, const DataArrayInt *revNodal, const DataArrayInt *revNodalI,
1720 DataArrayInt *& commonCellsArr, DataArrayInt *& commonCellsIArr)
1722 MCAuto<DataArrayInt> commonCells=DataArrayInt::New(),commonCellsI=DataArrayInt::New(); commonCells->alloc(0,1);
1723 int nbOfCells=nodalI->getNumberOfTuples()-1;
1724 commonCellsI->reserve(1); commonCellsI->pushBackSilent(0);
1725 const int *revNodalPtr=revNodal->getConstPointer(),*revNodalIPtr=revNodalI->getConstPointer();
1726 const int *connPtr=nodal->getConstPointer(),*connIPtr=nodalI->getConstPointer();
1727 std::vector<bool> isFetched(nbOfCells,false);
1730 for(int i=0;i<nbOfCells;i++)
1734 const int *connOfNode=std::find_if(connPtr+connIPtr[i]+1,connPtr+connIPtr[i+1],std::bind2nd(std::not_equal_to<int>(),-1));
1735 std::vector<int> v,v2;
1736 if(connOfNode!=connPtr+connIPtr[i+1])
1738 const int *locRevNodal=std::find(revNodalPtr+revNodalIPtr[*connOfNode],revNodalPtr+revNodalIPtr[*connOfNode+1],i);
1739 v2.insert(v2.end(),locRevNodal,revNodalPtr+revNodalIPtr[*connOfNode+1]);
1742 for(;connOfNode!=connPtr+connIPtr[i+1] && v2.size()>1;connOfNode++)
1746 const int *locRevNodal=std::find(revNodalPtr+revNodalIPtr[*connOfNode],revNodalPtr+revNodalIPtr[*connOfNode+1],i);
1747 std::vector<int>::iterator it=std::set_intersection(v.begin(),v.end(),locRevNodal,revNodalPtr+revNodalIPtr[*connOfNode+1],v2.begin());
1748 v2.resize(std::distance(v2.begin(),it));
1752 if(AreCellsEqualInPool(v2,compType,connPtr,connIPtr,commonCells))
1754 int pos=commonCellsI->back();
1755 commonCellsI->pushBackSilent(commonCells->getNumberOfTuples());
1756 for(const int *it=commonCells->begin()+pos;it!=commonCells->end();it++)
1757 isFetched[*it]=true;
1765 for(int i=startCellId;i<nbOfCells;i++)
1769 const int *connOfNode=std::find_if(connPtr+connIPtr[i]+1,connPtr+connIPtr[i+1],std::bind2nd(std::not_equal_to<int>(),-1));
1770 std::vector<int> v,v2;
1771 if(connOfNode!=connPtr+connIPtr[i+1])
1773 v2.insert(v2.end(),revNodalPtr+revNodalIPtr[*connOfNode],revNodalPtr+revNodalIPtr[*connOfNode+1]);
1776 for(;connOfNode!=connPtr+connIPtr[i+1] && v2.size()>1;connOfNode++)
1780 std::vector<int>::iterator it=std::set_intersection(v.begin(),v.end(),revNodalPtr+revNodalIPtr[*connOfNode],revNodalPtr+revNodalIPtr[*connOfNode+1],v2.begin());
1781 v2.resize(std::distance(v2.begin(),it));
1785 if(AreCellsEqualInPool(v2,compType,connPtr,connIPtr,commonCells))
1787 int pos=commonCellsI->back();
1788 commonCellsI->pushBackSilent(commonCells->getNumberOfTuples());
1789 for(const int *it=commonCells->begin()+pos;it!=commonCells->end();it++)
1790 isFetched[*it]=true;
1796 commonCellsArr=commonCells.retn();
1797 commonCellsIArr=commonCellsI.retn();
1801 * Checks if \a this mesh includes all cells of an \a other mesh, and returns an array
1802 * giving for each cell of the \a other an id of a cell in \a this mesh. A value larger
1803 * than \a this->getNumberOfCells() in the returned array means that there is no
1804 * corresponding cell in \a this mesh.
1805 * It is expected that \a this and \a other meshes share the same node coordinates
1806 * array, if it is not so an exception is thrown.
1807 * \param [in] other - the mesh to compare with.
1808 * \param [in] compType - specifies a cell comparison technique. For meaning of its
1809 * valid values [0,1,2], see zipConnectivityTraducer().
1810 * \param [out] arr - a new instance of DataArrayInt returning correspondence
1811 * between cells of the two meshes. It contains \a other->getNumberOfCells()
1812 * values. The caller is to delete this array using
1813 * decrRef() as it is no more needed.
1814 * \return bool - \c true if all cells of \a other mesh are present in the \a this
1817 * \if ENABLE_EXAMPLES
1818 * \ref cpp_mcumesh_areCellsIncludedIn "Here is a C++ example".<br>
1819 * \ref py_mcumesh_areCellsIncludedIn "Here is a Python example".
1821 * \sa checkDeepEquivalOnSameNodesWith()
1822 * \sa checkGeoEquivalWith()
1824 bool MEDCouplingUMesh::areCellsIncludedIn(const MEDCouplingUMesh *other, int compType, DataArrayInt *& arr) const
1826 MCAuto<MEDCouplingUMesh> mesh=MergeUMeshesOnSameCoords(this,other);
1827 int nbOfCells=getNumberOfCells();
1828 static const int possibleCompType[]={0,1,2};
1829 if(std::find(possibleCompType,possibleCompType+sizeof(possibleCompType)/sizeof(int),compType)==possibleCompType+sizeof(possibleCompType)/sizeof(int))
1831 std::ostringstream oss; oss << "MEDCouplingUMesh::areCellsIncludedIn : only following policies are possible : ";
1832 std::copy(possibleCompType,possibleCompType+sizeof(possibleCompType)/sizeof(int),std::ostream_iterator<int>(oss," "));
1834 throw INTERP_KERNEL::Exception(oss.str());
1836 MCAuto<DataArrayInt> o2n=mesh->zipConnectivityTraducer(compType,nbOfCells);
1837 arr=o2n->subArray(nbOfCells);
1838 arr->setName(other->getName());
1840 if(other->getNumberOfCells()==0)
1842 return arr->getMaxValue(tmp)<nbOfCells;
1846 * This method makes the assumption that \a this and \a other share the same coords. If not an exception will be thrown !
1847 * This method tries to determine if \b other is fully included in \b this.
1848 * The main difference is that this method is not expected to throw exception.
1849 * This method has two outputs :
1851 * \param other other mesh
1852 * \param arr is an output parameter that returns a \b newly created instance. This array is of size 'other->getNumberOfCells()'.
1853 * \return If \a other is fully included in 'this 'true is returned. If not false is returned.
1855 bool MEDCouplingUMesh::areCellsIncludedInPolicy7(const MEDCouplingUMesh *other, DataArrayInt *& arr) const
1857 MCAuto<MEDCouplingUMesh> mesh=MergeUMeshesOnSameCoords(this,other);
1858 DataArrayInt *commonCells=0,*commonCellsI=0;
1859 int thisNbCells=getNumberOfCells();
1860 mesh->findCommonCells(7,thisNbCells,commonCells,commonCellsI);
1861 MCAuto<DataArrayInt> commonCellsTmp(commonCells),commonCellsITmp(commonCellsI);
1862 const int *commonCellsPtr=commonCells->getConstPointer(),*commonCellsIPtr=commonCellsI->getConstPointer();
1863 int otherNbCells=other->getNumberOfCells();
1864 MCAuto<DataArrayInt> arr2=DataArrayInt::New();
1865 arr2->alloc(otherNbCells,1);
1866 arr2->fillWithZero();
1867 int *arr2Ptr=arr2->getPointer();
1868 int nbOfCommon=commonCellsI->getNumberOfTuples()-1;
1869 for(int i=0;i<nbOfCommon;i++)
1871 int start=commonCellsPtr[commonCellsIPtr[i]];
1872 if(start<thisNbCells)
1874 for(int j=commonCellsIPtr[i]+1;j!=commonCellsIPtr[i+1];j++)
1876 int sig=commonCellsPtr[j]>0?1:-1;
1877 int val=std::abs(commonCellsPtr[j])-1;
1878 if(val>=thisNbCells)
1879 arr2Ptr[val-thisNbCells]=sig*(start+1);
1883 arr2->setName(other->getName());
1884 if(arr2->presenceOfValue(0))
1890 MEDCouplingUMesh *MEDCouplingUMesh::mergeMyselfWithOnSameCoords(const MEDCouplingPointSet *other) const
1893 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::mergeMyselfWithOnSameCoords : input other is null !");
1894 const MEDCouplingUMesh *otherC=dynamic_cast<const MEDCouplingUMesh *>(other);
1896 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::mergeMyselfWithOnSameCoords : the input other mesh is not of type unstructured !");
1897 std::vector<const MEDCouplingUMesh *> ms(2);
1900 return MergeUMeshesOnSameCoords(ms);
1904 * Build a sub part of \b this lying or not on the same coordinates than \b this (regarding value of \b keepCoords).
1905 * By default coordinates are kept. This method is close to MEDCouplingUMesh::buildPartOfMySelf except that here input
1906 * cellIds is not given explicitly but by a range python like.
1911 * \param keepCoords that specifies if you want or not to keep coords as this or zip it (see MEDCoupling::MEDCouplingUMesh::zipCoords). If true zipCoords is \b NOT called, if false, zipCoords is called.
1912 * \return a newly allocated
1914 * \warning This method modifies can generate an unstructured mesh whose cells are not sorted by geometric type order.
1915 * In view of the MED file writing, a renumbering of cells of returned unstructured mesh (using MEDCouplingUMesh::sortCellsInMEDFileFrmt) should be necessary.
1917 MEDCouplingUMesh *MEDCouplingUMesh::buildPartOfMySelfSlice(int start, int end, int step, bool keepCoords) const
1919 if(getMeshDimension()!=-1)
1920 return static_cast<MEDCouplingUMesh *>(MEDCouplingPointSet::buildPartOfMySelfSlice(start,end,step,keepCoords));
1923 int newNbOfCells=DataArray::GetNumberOfItemGivenBESRelative(start,end,step,"MEDCouplingUMesh::buildPartOfMySelfSlice for -1 dimension mesh ");
1925 throw INTERP_KERNEL::Exception("-1D mesh has only one cell !");
1927 throw INTERP_KERNEL::Exception("-1D mesh has only one cell : 0 !");
1929 return const_cast<MEDCouplingUMesh *>(this);
1934 * Creates a new MEDCouplingUMesh containing specified cells of \a this mesh.
1935 * The result mesh shares or not the node coordinates array with \a this mesh depending
1936 * on \a keepCoords parameter.
1937 * \warning Cells of the result mesh can be \b not sorted by geometric type, hence,
1938 * to write this mesh to the MED file, its cells must be sorted using
1939 * sortCellsInMEDFileFrmt().
1940 * \param [in] begin - an array of cell ids to include to the new mesh.
1941 * \param [in] end - a pointer to last-plus-one-th element of \a begin.
1942 * \param [in] keepCoords - if \c true, the result mesh shares the node coordinates
1943 * array of \a this mesh, else "free" nodes are removed from the result mesh
1944 * by calling zipCoords().
1945 * \return MEDCouplingUMesh * - a new instance of MEDCouplingUMesh. The caller is
1946 * to delete this mesh using decrRef() as it is no more needed.
1947 * \throw If the coordinates array is not set.
1948 * \throw If the nodal connectivity of cells is not defined.
1949 * \throw If any cell id in the array \a begin is not valid.
1951 * \if ENABLE_EXAMPLES
1952 * \ref cpp_mcumesh_buildPartOfMySelf "Here is a C++ example".<br>
1953 * \ref py_mcumesh_buildPartOfMySelf "Here is a Python example".
1956 MEDCouplingUMesh *MEDCouplingUMesh::buildPartOfMySelf(const int *begin, const int *end, bool keepCoords) const
1958 if(getMeshDimension()!=-1)
1959 return static_cast<MEDCouplingUMesh *>(MEDCouplingPointSet::buildPartOfMySelf(begin,end,keepCoords));
1963 throw INTERP_KERNEL::Exception("-1D mesh has only one cell !");
1965 throw INTERP_KERNEL::Exception("-1D mesh has only one cell : 0 !");
1967 return const_cast<MEDCouplingUMesh *>(this);
1972 * This method operates only on nodal connectivity on \b this. Coordinates of \b this is completely ignored here.
1974 * This method allows to partially modify some cells in \b this (whose list is specified by [ \b cellIdsBg, \b cellIdsEnd ) ) with cells coming in \b otherOnSameCoordsThanThis.
1975 * Size of [ \b cellIdsBg, \b cellIdsEnd ) ) must be equal to the number of cells of otherOnSameCoordsThanThis.
1976 * The number of cells of \b this will remain the same with this method.
1978 * \param [in] cellIdsBg begin of cell ids (included) of cells in this to assign
1979 * \param [in] cellIdsEnd end of cell ids (excluded) of cells in this to assign
1980 * \param [in] otherOnSameCoordsThanThis an another mesh with same meshdimension than \b this with exactly the same number of cells than cell ids list in [\b cellIdsBg, \b cellIdsEnd ).
1981 * Coordinate pointer of \b this and those of \b otherOnSameCoordsThanThis must be the same
1983 void MEDCouplingUMesh::setPartOfMySelf(const int *cellIdsBg, const int *cellIdsEnd, const MEDCouplingUMesh& otherOnSameCoordsThanThis)
1985 checkConnectivityFullyDefined();
1986 otherOnSameCoordsThanThis.checkConnectivityFullyDefined();
1987 if(getCoords()!=otherOnSameCoordsThanThis.getCoords())
1988 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::setPartOfMySelf : coordinates pointer are not the same ! Invoke setCoords or call tryToShareSameCoords method !");
1989 if(getMeshDimension()!=otherOnSameCoordsThanThis.getMeshDimension())
1991 std::ostringstream oss; oss << "MEDCouplingUMesh::setPartOfMySelf : Mismatch of meshdimensions ! this is equal to " << getMeshDimension();
1992 oss << ", whereas other mesh dimension is set equal to " << otherOnSameCoordsThanThis.getMeshDimension() << " !";
1993 throw INTERP_KERNEL::Exception(oss.str());
1995 std::size_t nbOfCellsToModify(std::distance(cellIdsBg,cellIdsEnd));
1996 if(nbOfCellsToModify!=otherOnSameCoordsThanThis.getNumberOfCells())
1998 std::ostringstream oss; oss << "MEDCouplingUMesh::setPartOfMySelf : cells ids length (" << nbOfCellsToModify << ") do not match the number of cells of other mesh (" << otherOnSameCoordsThanThis.getNumberOfCells() << ") !";
1999 throw INTERP_KERNEL::Exception(oss.str());
2001 std::size_t nbOfCells(getNumberOfCells());
2002 bool easyAssign(true);
2003 const int *connI(_nodal_connec_index->begin());
2004 const int *connIOther=otherOnSameCoordsThanThis._nodal_connec_index->begin();
2005 for(const int *it=cellIdsBg;it!=cellIdsEnd && easyAssign;it++,connIOther++)
2007 if(*it>=0 && *it<(int)nbOfCells)
2009 easyAssign=(connIOther[1]-connIOther[0])==(connI[*it+1]-connI[*it]);
2013 std::ostringstream oss; oss << "MEDCouplingUMesh::setPartOfMySelf : On pos #" << std::distance(cellIdsBg,it) << " id is equal to " << *it << " which is not in [0," << nbOfCells << ") !";
2014 throw INTERP_KERNEL::Exception(oss.str());
2019 MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx(cellIdsBg,cellIdsEnd,_nodal_connec,_nodal_connec_index,otherOnSameCoordsThanThis._nodal_connec,otherOnSameCoordsThanThis._nodal_connec_index);
2024 DataArrayInt *arrOut=0,*arrIOut=0;
2025 MEDCouplingUMesh::SetPartOfIndexedArrays(cellIdsBg,cellIdsEnd,_nodal_connec,_nodal_connec_index,otherOnSameCoordsThanThis._nodal_connec,otherOnSameCoordsThanThis._nodal_connec_index,
2027 MCAuto<DataArrayInt> arrOutAuto(arrOut),arrIOutAuto(arrIOut);
2028 setConnectivity(arrOut,arrIOut,true);
2032 void MEDCouplingUMesh::setPartOfMySelfSlice(int start, int end, int step, const MEDCouplingUMesh& otherOnSameCoordsThanThis)
2034 checkConnectivityFullyDefined();
2035 otherOnSameCoordsThanThis.checkConnectivityFullyDefined();
2036 if(getCoords()!=otherOnSameCoordsThanThis.getCoords())
2037 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::setPartOfMySelfSlice : coordinates pointer are not the same ! Invoke setCoords or call tryToShareSameCoords method !");
2038 if(getMeshDimension()!=otherOnSameCoordsThanThis.getMeshDimension())
2040 std::ostringstream oss; oss << "MEDCouplingUMesh::setPartOfMySelfSlice : Mismatch of meshdimensions ! this is equal to " << getMeshDimension();
2041 oss << ", whereas other mesh dimension is set equal to " << otherOnSameCoordsThanThis.getMeshDimension() << " !";
2042 throw INTERP_KERNEL::Exception(oss.str());
2044 int nbOfCellsToModify=DataArray::GetNumberOfItemGivenBESRelative(start,end,step,"MEDCouplingUMesh::setPartOfMySelfSlice : ");
2045 if(nbOfCellsToModify!=(int)otherOnSameCoordsThanThis.getNumberOfCells())
2047 std::ostringstream oss; oss << "MEDCouplingUMesh::setPartOfMySelfSlice : cells ids length (" << nbOfCellsToModify << ") do not match the number of cells of other mesh (" << otherOnSameCoordsThanThis.getNumberOfCells() << ") !";
2048 throw INTERP_KERNEL::Exception(oss.str());
2050 int nbOfCells=getNumberOfCells();
2051 bool easyAssign=true;
2052 const int *connI=_nodal_connec_index->getConstPointer();
2053 const int *connIOther=otherOnSameCoordsThanThis._nodal_connec_index->getConstPointer();
2055 for(int i=0;i<nbOfCellsToModify && easyAssign;i++,it+=step,connIOther++)
2057 if(it>=0 && it<nbOfCells)
2059 easyAssign=(connIOther[1]-connIOther[0])==(connI[it+1]-connI[it]);
2063 std::ostringstream oss; oss << "MEDCouplingUMesh::setPartOfMySelfSlice : On pos #" << i << " id is equal to " << it << " which is not in [0," << nbOfCells << ") !";
2064 throw INTERP_KERNEL::Exception(oss.str());
2069 MEDCouplingUMesh::SetPartOfIndexedArraysSameIdxSlice(start,end,step,_nodal_connec,_nodal_connec_index,otherOnSameCoordsThanThis._nodal_connec,otherOnSameCoordsThanThis._nodal_connec_index);
2074 DataArrayInt *arrOut=0,*arrIOut=0;
2075 MEDCouplingUMesh::SetPartOfIndexedArraysSlice(start,end,step,_nodal_connec,_nodal_connec_index,otherOnSameCoordsThanThis._nodal_connec,otherOnSameCoordsThanThis._nodal_connec_index,
2077 MCAuto<DataArrayInt> arrOutAuto(arrOut),arrIOutAuto(arrIOut);
2078 setConnectivity(arrOut,arrIOut,true);
2084 * Creates a new MEDCouplingUMesh containing cells, of dimension one less than \a
2085 * this->getMeshDimension(), that bound some cells of \a this mesh.
2086 * The cells of lower dimension to include to the result mesh are selected basing on
2087 * specified node ids and the value of \a fullyIn parameter. If \a fullyIn ==\c true, a
2088 * cell is copied if its all nodes are in the array \a begin of node ids. If \a fullyIn
2089 * ==\c false, a cell is copied if any its node is in the array of node ids. The
2090 * created mesh shares the node coordinates array with \a this mesh.
2091 * \param [in] begin - the array of node ids.
2092 * \param [in] end - a pointer to the (last+1)-th element of \a begin.
2093 * \param [in] fullyIn - if \c true, then cells whose all nodes are in the
2094 * array \a begin are added, else cells whose any node is in the
2095 * array \a begin are added.
2096 * \return MEDCouplingUMesh * - new instance of MEDCouplingUMesh. The caller is
2097 * to delete this mesh using decrRef() as it is no more needed.
2098 * \throw If the coordinates array is not set.
2099 * \throw If the nodal connectivity of cells is not defined.
2100 * \throw If any node id in \a begin is not valid.
2102 * \if ENABLE_EXAMPLES
2103 * \ref cpp_mcumesh_buildFacePartOfMySelfNode "Here is a C++ example".<br>
2104 * \ref py_mcumesh_buildFacePartOfMySelfNode "Here is a Python example".
2107 MEDCouplingUMesh *MEDCouplingUMesh::buildFacePartOfMySelfNode(const int *begin, const int *end, bool fullyIn) const
2109 MCAuto<DataArrayInt> desc,descIndx,revDesc,revDescIndx;
2110 desc=DataArrayInt::New(); descIndx=DataArrayInt::New(); revDesc=DataArrayInt::New(); revDescIndx=DataArrayInt::New();
2111 MCAuto<MEDCouplingUMesh> subMesh=buildDescendingConnectivity(desc,descIndx,revDesc,revDescIndx);
2112 desc=0; descIndx=0; revDesc=0; revDescIndx=0;
2113 return static_cast<MEDCouplingUMesh*>(subMesh->buildPartOfMySelfNode(begin,end,fullyIn));
2117 * Creates a new MEDCouplingUMesh containing cells, of dimension one less than \a
2118 * this->getMeshDimension(), which bound only one cell of \a this mesh.
2119 * \param [in] keepCoords - if \c true, the result mesh shares the node coordinates
2120 * array of \a this mesh, else "free" nodes are removed from the result mesh
2121 * by calling zipCoords().
2122 * \return MEDCouplingUMesh * - a new instance of MEDCouplingUMesh. The caller is
2123 * to delete this mesh using decrRef() as it is no more needed.
2124 * \throw If the coordinates array is not set.
2125 * \throw If the nodal connectivity of cells is not defined.
2127 * \if ENABLE_EXAMPLES
2128 * \ref cpp_mcumesh_buildBoundaryMesh "Here is a C++ example".<br>
2129 * \ref py_mcumesh_buildBoundaryMesh "Here is a Python example".
2132 MEDCouplingUMesh *MEDCouplingUMesh::buildBoundaryMesh(bool keepCoords) const
2134 DataArrayInt *desc=DataArrayInt::New();
2135 DataArrayInt *descIndx=DataArrayInt::New();
2136 DataArrayInt *revDesc=DataArrayInt::New();
2137 DataArrayInt *revDescIndx=DataArrayInt::New();
2139 MCAuto<MEDCouplingUMesh> meshDM1=buildDescendingConnectivity(desc,descIndx,revDesc,revDescIndx);
2142 descIndx->decrRef();
2143 int nbOfCells=meshDM1->getNumberOfCells();
2144 const int *revDescIndxC=revDescIndx->getConstPointer();
2145 std::vector<int> boundaryCells;
2146 for(int i=0;i<nbOfCells;i++)
2147 if(revDescIndxC[i+1]-revDescIndxC[i]==1)
2148 boundaryCells.push_back(i);
2149 revDescIndx->decrRef();
2150 MEDCouplingUMesh *ret=meshDM1->buildPartOfMySelf(&boundaryCells[0],&boundaryCells[0]+boundaryCells.size(),keepCoords);
2155 * This method returns a newly created DataArrayInt instance containing ids of cells located in boundary.
2156 * A cell is detected to be on boundary if it contains one or more than one face having only one father.
2157 * This method makes the assumption that \a this is fully defined (coords,connectivity). If not an exception will be thrown.
2159 DataArrayInt *MEDCouplingUMesh::findCellIdsOnBoundary() const
2161 checkFullyDefined();
2162 MCAuto<DataArrayInt> desc=DataArrayInt::New();
2163 MCAuto<DataArrayInt> descIndx=DataArrayInt::New();
2164 MCAuto<DataArrayInt> revDesc=DataArrayInt::New();
2165 MCAuto<DataArrayInt> revDescIndx=DataArrayInt::New();
2167 buildDescendingConnectivity(desc,descIndx,revDesc,revDescIndx)->decrRef();
2168 desc=(DataArrayInt*)0; descIndx=(DataArrayInt*)0;
2170 MCAuto<DataArrayInt> tmp=revDescIndx->deltaShiftIndex();
2171 MCAuto<DataArrayInt> faceIds=tmp->findIdsEqual(1); tmp=(DataArrayInt*)0;
2172 const int *revDescPtr=revDesc->getConstPointer();
2173 const int *revDescIndxPtr=revDescIndx->getConstPointer();
2174 int nbOfCells=getNumberOfCells();
2175 std::vector<bool> ret1(nbOfCells,false);
2177 for(const int *pt=faceIds->begin();pt!=faceIds->end();pt++)
2178 if(!ret1[revDescPtr[revDescIndxPtr[*pt]]])
2179 { ret1[revDescPtr[revDescIndxPtr[*pt]]]=true; sz++; }
2181 DataArrayInt *ret2=DataArrayInt::New();
2183 int *ret2Ptr=ret2->getPointer();
2185 for(std::vector<bool>::const_iterator it=ret1.begin();it!=ret1.end();it++,sz++)
2188 ret2->setName("BoundaryCells");
2193 * This method finds in \b this the cell ids that lie on mesh \b otherDimM1OnSameCoords.
2194 * \b this and \b otherDimM1OnSameCoords have to lie on the same coordinate array pointer. The coherency of that coords array with connectivity
2195 * of \b this and \b otherDimM1OnSameCoords is not important here because this method works only on connectivity.
2196 * this->getMeshDimension() - 1 must be equal to otherDimM1OnSameCoords.getMeshDimension()
2198 * s0 is the cell ids set in \b this lying on at least one node in the fetched nodes in \b otherDimM1OnSameCoords.
2199 * This method also returns the cells ids set s1 which contains the cell ids in \b this for which one of the dim-1 constituent
2200 * equals a cell in \b otherDimM1OnSameCoords.
2202 * \throw if \b otherDimM1OnSameCoords is not part of constituent of \b this, or if coordinate pointer of \b this and \b otherDimM1OnSameCoords
2203 * are not same, or if this->getMeshDimension()-1!=otherDimM1OnSameCoords.getMeshDimension()
2205 * \param [in] otherDimM1OnSameCoords
2206 * \param [out] cellIdsRk0 a newly allocated array containing the cell ids of s0 (which are cell ids of \b this) in the above algorithm.
2207 * \param [out] cellIdsRk1 a newly allocated array containing the cell ids of s1 \b indexed into the \b cellIdsRk0 subset. To get the absolute ids of s1, simply invoke
2208 * cellIdsRk1->transformWithIndArr(cellIdsRk0->begin(),cellIdsRk0->end());
2210 void MEDCouplingUMesh::findCellIdsLyingOn(const MEDCouplingUMesh& otherDimM1OnSameCoords, DataArrayInt *&cellIdsRk0, DataArrayInt *&cellIdsRk1) const
2212 if(getCoords()!=otherDimM1OnSameCoords.getCoords())
2213 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::findCellIdsLyingOn : coordinates pointer are not the same ! Use tryToShareSameCoords method !");
2214 checkConnectivityFullyDefined();
2215 otherDimM1OnSameCoords.checkConnectivityFullyDefined();
2216 if(getMeshDimension()-1!=otherDimM1OnSameCoords.getMeshDimension())
2217 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::findCellIdsLyingOn : invalid mesh dimension of input mesh regarding meshdimesion of this !");
2218 MCAuto<DataArrayInt> fetchedNodeIds1=otherDimM1OnSameCoords.computeFetchedNodeIds();
2219 MCAuto<DataArrayInt> s0arr=getCellIdsLyingOnNodes(fetchedNodeIds1->begin(),fetchedNodeIds1->end(),false);
2220 MCAuto<MEDCouplingUMesh> thisPart=static_cast<MEDCouplingUMesh *>(buildPartOfMySelf(s0arr->begin(),s0arr->end(),true));
2221 MCAuto<DataArrayInt> descThisPart=DataArrayInt::New(),descIThisPart=DataArrayInt::New(),revDescThisPart=DataArrayInt::New(),revDescIThisPart=DataArrayInt::New();
2222 MCAuto<MEDCouplingUMesh> thisPartConsti=thisPart->buildDescendingConnectivity(descThisPart,descIThisPart,revDescThisPart,revDescIThisPart);
2223 const int *revDescThisPartPtr=revDescThisPart->getConstPointer(),*revDescIThisPartPtr=revDescIThisPart->getConstPointer();
2224 DataArrayInt *idsOtherInConsti=0;
2225 bool b=thisPartConsti->areCellsIncludedIn(&otherDimM1OnSameCoords,2,idsOtherInConsti);
2226 MCAuto<DataArrayInt> idsOtherInConstiAuto(idsOtherInConsti);
2228 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::findCellIdsLyingOn : the given mdim-1 mesh in other is not a constituent of this !");
2230 for(const int *idOther=idsOtherInConsti->begin();idOther!=idsOtherInConsti->end();idOther++)
2231 s1.insert(revDescThisPartPtr+revDescIThisPartPtr[*idOther],revDescThisPartPtr+revDescIThisPartPtr[*idOther+1]);
2232 MCAuto<DataArrayInt> s1arr_renum1=DataArrayInt::New(); s1arr_renum1->alloc((int)s1.size(),1); std::copy(s1.begin(),s1.end(),s1arr_renum1->getPointer());
2233 s1arr_renum1->sort();
2234 cellIdsRk0=s0arr.retn();
2235 //cellIdsRk1=s_renum1.retn();
2236 cellIdsRk1=s1arr_renum1.retn();
2240 * This method computes the skin of \b this. That is to say the consituting meshdim-1 mesh is built and only the boundary subpart is
2241 * returned. This subpart of meshdim-1 mesh is built using meshdim-1 cells in it shared only one cell in \b this.
2243 * \return a newly allocated mesh lying on the same coordinates than \b this. The caller has to deal with returned mesh.
2245 MEDCouplingUMesh *MEDCouplingUMesh::computeSkin() const
2247 MCAuto<DataArrayInt> desc=DataArrayInt::New();
2248 MCAuto<DataArrayInt> descIndx=DataArrayInt::New();
2249 MCAuto<DataArrayInt> revDesc=DataArrayInt::New();
2250 MCAuto<DataArrayInt> revDescIndx=DataArrayInt::New();
2252 MCAuto<MEDCouplingUMesh> meshDM1=buildDescendingConnectivity(desc,descIndx,revDesc,revDescIndx);
2253 revDesc=0; desc=0; descIndx=0;
2254 MCAuto<DataArrayInt> revDescIndx2=revDescIndx->deltaShiftIndex();
2255 MCAuto<DataArrayInt> part=revDescIndx2->findIdsEqual(1);
2256 return static_cast<MEDCouplingUMesh *>(meshDM1->buildPartOfMySelf(part->begin(),part->end(),true));
2260 * Finds nodes lying on the boundary of \a this mesh.
2261 * \return DataArrayInt * - a new instance of DataArrayInt holding ids of found
2262 * nodes. The caller is to delete this array using decrRef() as it is no
2264 * \throw If the coordinates array is not set.
2265 * \throw If the nodal connectivity of cells is node defined.
2267 * \if ENABLE_EXAMPLES
2268 * \ref cpp_mcumesh_findBoundaryNodes "Here is a C++ example".<br>
2269 * \ref py_mcumesh_findBoundaryNodes "Here is a Python example".
2272 DataArrayInt *MEDCouplingUMesh::findBoundaryNodes() const
2274 MCAuto<MEDCouplingUMesh> skin=computeSkin();
2275 return skin->computeFetchedNodeIds();
2278 MEDCouplingUMesh *MEDCouplingUMesh::buildUnstructured() const
2281 return const_cast<MEDCouplingUMesh *>(this);
2285 * This method expects that \b this and \b otherDimM1OnSameCoords share the same coordinates array.
2286 * otherDimM1OnSameCoords->getMeshDimension() is expected to be equal to this->getMeshDimension()-1.
2287 * This method searches for nodes needed to be duplicated. These nodes are nodes fetched by \b otherDimM1OnSameCoords which are not part of the boundary of \b otherDimM1OnSameCoords.
2288 * If a node is in the boundary of \b this \b and in the boundary of \b otherDimM1OnSameCoords this node is considered as needed to be duplicated.
2289 * When the set of node ids \b nodeIdsToDuplicate is computed, cell ids in \b this is searched so that their connectivity includes at least 1 node in \b nodeIdsToDuplicate.
2291 * \param [in] otherDimM1OnSameCoords a mesh lying on the same coords than \b this and with a mesh dimension equal to those of \b this minus 1. WARNING this input
2292 * parameter is altered during the call.
2293 * \param [out] nodeIdsToDuplicate node ids needed to be duplicated following the algorithm explain above.
2294 * \param [out] cellIdsNeededToBeRenum cell ids in \b this in which the renumber of nodes should be performed.
2295 * \param [out] cellIdsNotModified cell ids int \b this that lies on \b otherDimM1OnSameCoords mesh whose connectivity do \b not need to be modified as it is the case for \b cellIdsNeededToBeRenum.
2297 * \warning This method modifies param \b otherDimM1OnSameCoords (for speed reasons).
2299 void MEDCouplingUMesh::findNodesToDuplicate(const MEDCouplingUMesh& otherDimM1OnSameCoords, DataArrayInt *& nodeIdsToDuplicate,
2300 DataArrayInt *& cellIdsNeededToBeRenum, DataArrayInt *& cellIdsNotModified) const
2302 typedef MCAuto<DataArrayInt> DAInt;
2303 typedef MCAuto<MEDCouplingUMesh> MCUMesh;
2305 checkFullyDefined();
2306 otherDimM1OnSameCoords.checkFullyDefined();
2307 if(getCoords()!=otherDimM1OnSameCoords.getCoords())
2308 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::findNodesToDuplicate : meshes do not share the same coords array !");
2309 if(otherDimM1OnSameCoords.getMeshDimension()!=getMeshDimension()-1)
2310 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::findNodesToDuplicate : the mesh given in other parameter must have this->getMeshDimension()-1 !");
2312 // Checking star-shaped M1 group:
2313 DAInt dt0=DataArrayInt::New(),dit0=DataArrayInt::New(),rdt0=DataArrayInt::New(),rdit0=DataArrayInt::New();
2314 MCUMesh meshM2 = otherDimM1OnSameCoords.buildDescendingConnectivity(dt0, dit0, rdt0, rdit0);
2315 DAInt dsi = rdit0->deltaShiftIndex();
2316 DAInt idsTmp0 = dsi->findIdsNotInRange(-1, 3);
2317 if(idsTmp0->getNumberOfTuples())
2318 throw INTERP_KERNEL::Exception("MEDFileUMesh::buildInnerBoundaryAlongM1Group: group is too complex: some points (or edges) have more than two connected segments (or faces)!");
2319 dt0=0; dit0=0; rdt0=0; rdit0=0; idsTmp0=0;
2321 // Get extreme nodes from the group (they won't be duplicated), ie nodes belonging to boundary cells of M1
2322 DAInt xtremIdsM2 = dsi->findIdsEqual(1); dsi = 0;
2323 MCUMesh meshM2Part = static_cast<MEDCouplingUMesh *>(meshM2->buildPartOfMySelf(xtremIdsM2->begin(), xtremIdsM2->end(),true));
2324 DAInt xtrem = meshM2Part->computeFetchedNodeIds();
2325 // Remove from the list points on the boundary of the M0 mesh (those need duplication!)
2326 dt0=DataArrayInt::New(),dit0=DataArrayInt::New(),rdt0=DataArrayInt::New(),rdit0=DataArrayInt::New();
2327 MCUMesh m0desc = buildDescendingConnectivity(dt0, dit0, rdt0, rdit0); dt0=0; dit0=0; rdt0=0;
2328 dsi = rdit0->deltaShiftIndex();
2329 DAInt boundSegs = dsi->findIdsEqual(1); // boundary segs/faces of the M0 mesh
2330 MCUMesh m0descSkin = static_cast<MEDCouplingUMesh *>(m0desc->buildPartOfMySelf(boundSegs->begin(),boundSegs->end(), true));
2331 DAInt fNodes = m0descSkin->computeFetchedNodeIds();
2332 // In 3D, some points on the boundary of M0 still need duplication:
2334 if (getMeshDimension() == 3)
2336 DAInt dnu1=DataArrayInt::New(), dnu2=DataArrayInt::New(), dnu3=DataArrayInt::New(), dnu4=DataArrayInt::New();
2337 MCUMesh m0descSkinDesc = m0descSkin->buildDescendingConnectivity(dnu1, dnu2, dnu3, dnu4);
2338 dnu1=0;dnu2=0;dnu3=0;dnu4=0;
2339 DataArrayInt * corresp=0;
2340 meshM2->areCellsIncludedIn(m0descSkinDesc,2,corresp);
2341 DAInt validIds = corresp->findIdsInRange(0, meshM2->getNumberOfCells());
2343 if (validIds->getNumberOfTuples())
2345 MCUMesh m1IntersecSkin = static_cast<MEDCouplingUMesh *>(m0descSkinDesc->buildPartOfMySelf(validIds->begin(), validIds->end(), true));
2346 DAInt notDuplSkin = m1IntersecSkin->findBoundaryNodes();
2347 DAInt fNodes1 = fNodes->buildSubstraction(notDuplSkin);
2348 notDup = xtrem->buildSubstraction(fNodes1);
2351 notDup = xtrem->buildSubstraction(fNodes);
2354 notDup = xtrem->buildSubstraction(fNodes);
2356 // Now compute cells around group (i.e. cells where we will do the propagation to identify the two sub-sets delimited by the group)
2357 DAInt m1Nodes = otherDimM1OnSameCoords.computeFetchedNodeIds();
2358 DAInt dupl = m1Nodes->buildSubstraction(notDup);
2359 DAInt cellsAroundGroup = getCellIdsLyingOnNodes(dupl->begin(), dupl->end(), false); // false= take cell in, even if not all nodes are in notDup
2362 MCUMesh m0Part2=static_cast<MEDCouplingUMesh *>(buildPartOfMySelf(cellsAroundGroup->begin(),cellsAroundGroup->end(),true));
2363 int nCells2 = m0Part2->getNumberOfCells();
2364 DAInt desc00=DataArrayInt::New(),descI00=DataArrayInt::New(),revDesc00=DataArrayInt::New(),revDescI00=DataArrayInt::New();
2365 MCUMesh m01=m0Part2->buildDescendingConnectivity(desc00,descI00,revDesc00,revDescI00);
2367 // Neighbor information of the mesh without considering the crack (serves to count how many connex pieces it is made of)
2368 DataArrayInt *tmp00=0,*tmp11=0;
2369 MEDCouplingUMesh::ComputeNeighborsOfCellsAdv(desc00,descI00,revDesc00,revDescI00, tmp00, tmp11);
2370 DAInt neighInit00(tmp00);
2371 DAInt neighIInit00(tmp11);
2372 // Neighbor information of the mesh WITH the crack (some neighbors are removed):
2373 DataArrayInt *idsTmp=0;
2374 m01->areCellsIncludedIn(&otherDimM1OnSameCoords,2,idsTmp);
2376 // In the neighbor information remove the connection between high dimension cells and its low level constituents which are part
2377 // of the frontier given in parameter (i.e. the cells of low dimension from the group delimiting the crack):
2378 MEDCouplingUMesh::RemoveIdsFromIndexedArrays(ids->begin(),ids->end(),desc00,descI00);
2379 DataArrayInt *tmp0=0,*tmp1=0;
2380 // Compute the neighbor of each cell in m0Part2, taking into account the broken link above. Two
2381 // cells on either side of the crack (defined by the mesh of low dimension) are not neighbor anymore.
2382 ComputeNeighborsOfCellsAdv(desc00,descI00,revDesc00,revDescI00,tmp0,tmp1);
2383 DAInt neigh00(tmp0);
2384 DAInt neighI00(tmp1);
2386 // For each initial connex part of the sub-mesh (or said differently for each independent crack):
2387 int seed = 0, nIter = 0;
2388 int nIterMax = nCells2+1; // Safety net for the loop
2389 DAInt hitCells = DataArrayInt::New(); hitCells->alloc(nCells2);
2390 hitCells->fillWithValue(-1);
2391 DAInt cellsToModifyConn0_torenum = DataArrayInt::New();
2392 cellsToModifyConn0_torenum->alloc(0,1);
2393 while (nIter < nIterMax)
2395 DAInt t = hitCells->findIdsEqual(-1);
2396 if (!t->getNumberOfTuples())
2398 // Connex zone without the crack (to compute the next seed really)
2400 DAInt connexCheck = MEDCouplingUMesh::ComputeSpreadZoneGraduallyFromSeed(&seed, &seed+1, neighInit00,neighIInit00, -1, dnu);
2402 for (int * ptr = connexCheck->getPointer(); cnt < connexCheck->getNumberOfTuples(); ptr++, cnt++)
2403 hitCells->setIJ(*ptr,0,1);
2404 // Connex zone WITH the crack (to identify cells lying on either part of the crack)
2405 DAInt spreadZone = MEDCouplingUMesh::ComputeSpreadZoneGraduallyFromSeed(&seed, &seed+1, neigh00,neighI00, -1, dnu);
2406 cellsToModifyConn0_torenum = DataArrayInt::Aggregate(cellsToModifyConn0_torenum, spreadZone, 0);
2407 // Compute next seed, i.e. a cell in another connex part, which was not covered by the previous iterations
2408 DAInt comple = cellsToModifyConn0_torenum->buildComplement(nCells2);
2409 DAInt nonHitCells = hitCells->findIdsEqual(-1);
2410 DAInt intersec = nonHitCells->buildIntersection(comple);
2411 if (intersec->getNumberOfTuples())
2412 { seed = intersec->getIJ(0,0); }
2417 if (nIter >= nIterMax)
2418 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::findNodesToDuplicate(): internal error - too many iterations.");
2420 DAInt cellsToModifyConn1_torenum=cellsToModifyConn0_torenum->buildComplement(neighI00->getNumberOfTuples()-1);
2421 cellsToModifyConn0_torenum->transformWithIndArr(cellsAroundGroup->begin(),cellsAroundGroup->end());
2422 cellsToModifyConn1_torenum->transformWithIndArr(cellsAroundGroup->begin(),cellsAroundGroup->end());
2424 cellIdsNeededToBeRenum=cellsToModifyConn0_torenum.retn();
2425 cellIdsNotModified=cellsToModifyConn1_torenum.retn();
2426 nodeIdsToDuplicate=dupl.retn();
2430 * This method operates a modification of the connectivity and coords in \b this.
2431 * Every time that a node id in [ \b nodeIdsToDuplicateBg, \b nodeIdsToDuplicateEnd ) will append in nodal connectivity of \b this
2432 * its ids will be modified to id this->getNumberOfNodes()+std::distance(nodeIdsToDuplicateBg,std::find(nodeIdsToDuplicateBg,nodeIdsToDuplicateEnd,id)).
2433 * More explicitly the renumber array in nodes is not explicitly given in old2new to avoid to build a big array of renumbering whereas typically few node ids needs to be
2434 * renumbered. The node id nodeIdsToDuplicateBg[0] will have id this->getNumberOfNodes()+0, node id nodeIdsToDuplicateBg[1] will have id this->getNumberOfNodes()+1,
2435 * node id nodeIdsToDuplicateBg[2] will have id this->getNumberOfNodes()+2...
2437 * As a consequence nodal connectivity array length will remain unchanged by this method, and nodal connectivity index array will remain unchanged by this method.
2439 * \param [in] nodeIdsToDuplicateBg begin of node ids (included) to be duplicated in connectivity only
2440 * \param [in] nodeIdsToDuplicateEnd end of node ids (excluded) to be duplicated in connectivity only
2442 void MEDCouplingUMesh::duplicateNodes(const int *nodeIdsToDuplicateBg, const int *nodeIdsToDuplicateEnd)
2444 int nbOfNodes=getNumberOfNodes();
2445 duplicateNodesInCoords(nodeIdsToDuplicateBg,nodeIdsToDuplicateEnd);
2446 duplicateNodesInConn(nodeIdsToDuplicateBg,nodeIdsToDuplicateEnd,nbOfNodes);
2450 * This method renumbers only nodal connectivity in \a this. The renumbering is only an offset applied. So this method is a specialization of
2451 * \a renumberNodesInConn. \b WARNING, this method does not check that the resulting node ids in the nodal connectivity is in a valid range !
2453 * \param [in] offset - specifies the offset to be applied on each element of connectivity.
2455 * \sa renumberNodesInConn
2457 void MEDCouplingUMesh::renumberNodesWithOffsetInConn(int offset)
2459 checkConnectivityFullyDefined();
2460 int *conn(getNodalConnectivity()->getPointer());
2461 const int *connIndex(getNodalConnectivityIndex()->getConstPointer());
2462 int nbOfCells(getNumberOfCells());
2463 for(int i=0;i<nbOfCells;i++)
2464 for(int iconn=connIndex[i]+1;iconn!=connIndex[i+1];iconn++)
2466 int& node=conn[iconn];
2467 if(node>=0)//avoid polyhedron separator
2472 _nodal_connec->declareAsNew();
2477 * Same than renumberNodesInConn(const int *) except that here the format of old-to-new traducer is using map instead
2478 * of array. This method is dedicated for renumbering from a big set of nodes the a tiny set of nodes which is the case during extraction
2481 void MEDCouplingUMesh::renumberNodesInConn(const INTERP_KERNEL::HashMap<int,int>& newNodeNumbersO2N)
2483 checkConnectivityFullyDefined();
2484 int *conn(getNodalConnectivity()->getPointer());
2485 const int *connIndex(getNodalConnectivityIndex()->getConstPointer());
2486 int nbOfCells(getNumberOfCells());
2487 for(int i=0;i<nbOfCells;i++)
2488 for(int iconn=connIndex[i]+1;iconn!=connIndex[i+1];iconn++)
2490 int& node=conn[iconn];
2491 if(node>=0)//avoid polyhedron separator
2493 INTERP_KERNEL::HashMap<int,int>::const_iterator it(newNodeNumbersO2N.find(node));
2494 if(it!=newNodeNumbersO2N.end())
2500 std::ostringstream oss; oss << "MEDCouplingUMesh::renumberNodesInConn(map) : presence in connectivity for cell #" << i << " of node #" << node << " : Not in map !";
2501 throw INTERP_KERNEL::Exception(oss.str());
2505 _nodal_connec->declareAsNew();
2510 * Changes ids of nodes within the nodal connectivity arrays according to a permutation
2511 * array in "Old to New" mode. The node coordinates array is \b not changed by this method.
2512 * This method is a generalization of shiftNodeNumbersInConn().
2513 * \warning This method performs no check of validity of new ids. **Use it with care !**
2514 * \param [in] newNodeNumbersO2N - a permutation array, of length \a
2515 * this->getNumberOfNodes(), in "Old to New" mode.
2516 * See \ref numbering for more info on renumbering modes.
2517 * \throw If the nodal connectivity of cells is not defined.
2519 * \if ENABLE_EXAMPLES
2520 * \ref cpp_mcumesh_renumberNodesInConn "Here is a C++ example".<br>
2521 * \ref py_mcumesh_renumberNodesInConn "Here is a Python example".
2524 void MEDCouplingUMesh::renumberNodesInConn(const int *newNodeNumbersO2N)
2526 checkConnectivityFullyDefined();
2527 int *conn=getNodalConnectivity()->getPointer();
2528 const int *connIndex=getNodalConnectivityIndex()->getConstPointer();
2529 int nbOfCells(getNumberOfCells());
2530 for(int i=0;i<nbOfCells;i++)
2531 for(int iconn=connIndex[i]+1;iconn!=connIndex[i+1];iconn++)
2533 int& node=conn[iconn];
2534 if(node>=0)//avoid polyhedron separator
2536 node=newNodeNumbersO2N[node];
2539 _nodal_connec->declareAsNew();
2544 * This method renumbers nodes \b in \b connectivity \b only \b without \b any \b reference \b to \b coords.
2545 * This method performs no check on the fact that new coordinate ids are valid. \b Use \b it \b with \b care !
2546 * This method is an specialization of \ref MEDCoupling::MEDCouplingUMesh::renumberNodesInConn "renumberNodesInConn method".
2548 * \param [in] delta specifies the shift size applied to nodeId in nodal connectivity in \b this.
2550 void MEDCouplingUMesh::shiftNodeNumbersInConn(int delta)
2552 checkConnectivityFullyDefined();
2553 int *conn=getNodalConnectivity()->getPointer();
2554 const int *connIndex=getNodalConnectivityIndex()->getConstPointer();
2555 int nbOfCells=getNumberOfCells();
2556 for(int i=0;i<nbOfCells;i++)
2557 for(int iconn=connIndex[i]+1;iconn!=connIndex[i+1];iconn++)
2559 int& node=conn[iconn];
2560 if(node>=0)//avoid polyhedron separator
2565 _nodal_connec->declareAsNew();
2570 * This method operates a modification of the connectivity in \b this.
2571 * Coordinates are \b NOT considered here and will remain unchanged by this method. this->_coords can ever been null for the needs of this method.
2572 * Every time that a node id in [ \b nodeIdsToDuplicateBg, \b nodeIdsToDuplicateEnd ) will append in nodal connectivity of \b this
2573 * its ids will be modified to id offset+std::distance(nodeIdsToDuplicateBg,std::find(nodeIdsToDuplicateBg,nodeIdsToDuplicateEnd,id)).
2574 * More explicitly the renumber array in nodes is not explicitly given in old2new to avoid to build a big array of renumbering whereas typically few node ids needs to be
2575 * renumbered. The node id nodeIdsToDuplicateBg[0] will have id offset+0, node id nodeIdsToDuplicateBg[1] will have id offset+1,
2576 * node id nodeIdsToDuplicateBg[2] will have id offset+2...
2578 * As a consequence nodal connectivity array length will remain unchanged by this method, and nodal connectivity index array will remain unchanged by this method.
2579 * As an another consequense after the call of this method \b this can be transiently non cohrent.
2581 * \param [in] nodeIdsToDuplicateBg begin of node ids (included) to be duplicated in connectivity only
2582 * \param [in] nodeIdsToDuplicateEnd end of node ids (excluded) to be duplicated in connectivity only
2583 * \param [in] offset the offset applied to all node ids in connectivity that are in [ \a nodeIdsToDuplicateBg, \a nodeIdsToDuplicateEnd ).
2585 void MEDCouplingUMesh::duplicateNodesInConn(const int *nodeIdsToDuplicateBg, const int *nodeIdsToDuplicateEnd, int offset)
2587 checkConnectivityFullyDefined();
2588 std::map<int,int> m;
2590 for(const int *work=nodeIdsToDuplicateBg;work!=nodeIdsToDuplicateEnd;work++,val++)
2592 int *conn=getNodalConnectivity()->getPointer();
2593 const int *connIndex=getNodalConnectivityIndex()->getConstPointer();
2594 int nbOfCells=getNumberOfCells();
2595 for(int i=0;i<nbOfCells;i++)
2596 for(int iconn=connIndex[i]+1;iconn!=connIndex[i+1];iconn++)
2598 int& node=conn[iconn];
2599 if(node>=0)//avoid polyhedron separator
2601 std::map<int,int>::iterator it=m.find(node);
2610 * This method renumbers cells of \a this using the array specified by [old2NewBg;old2NewBg+getNumberOfCells())
2612 * Contrary to MEDCouplingPointSet::renumberNodes, this method makes a permutation without any fuse of cell.
2613 * After the call of this method the number of cells remains the same as before.
2615 * If 'check' equals true the method will check that any elements in [ \a old2NewBg; \a old2NewEnd ) is unique ; if not
2616 * an INTERP_KERNEL::Exception will be thrown. When 'check' equals true [ \a old2NewBg ; \a old2NewEnd ) is not expected to
2617 * be strictly in [0;this->getNumberOfCells()).
2619 * If 'check' equals false the method will not check the content of [ \a old2NewBg ; \a old2NewEnd ).
2620 * To avoid any throw of SIGSEGV when 'check' equals false, the elements in [ \a old2NewBg ; \a old2NewEnd ) should be unique and
2621 * should be contained in[0;this->getNumberOfCells()).
2623 * \param [in] old2NewBg is expected to be a dynamically allocated pointer of size at least equal to this->getNumberOfCells()
2626 void MEDCouplingUMesh::renumberCells(const int *old2NewBg, bool check)
2628 checkConnectivityFullyDefined();
2629 int nbCells=getNumberOfCells();
2630 const int *array=old2NewBg;
2632 array=DataArrayInt::CheckAndPreparePermutation(old2NewBg,old2NewBg+nbCells);
2634 const int *conn=_nodal_connec->getConstPointer();
2635 const int *connI=_nodal_connec_index->getConstPointer();
2636 MCAuto<DataArrayInt> o2n=DataArrayInt::New(); o2n->useArray(array,false,C_DEALLOC,nbCells,1);
2637 MCAuto<DataArrayInt> n2o=o2n->invertArrayO2N2N2O(nbCells);
2638 const int *n2oPtr=n2o->begin();
2639 MCAuto<DataArrayInt> newConn=DataArrayInt::New();
2640 newConn->alloc(_nodal_connec->getNumberOfTuples(),_nodal_connec->getNumberOfComponents());
2641 newConn->copyStringInfoFrom(*_nodal_connec);
2642 MCAuto<DataArrayInt> newConnI=DataArrayInt::New();
2643 newConnI->alloc(_nodal_connec_index->getNumberOfTuples(),_nodal_connec_index->getNumberOfComponents());
2644 newConnI->copyStringInfoFrom(*_nodal_connec_index);
2646 int *newC=newConn->getPointer();
2647 int *newCI=newConnI->getPointer();
2650 for(int i=0;i<nbCells;i++)
2653 int nbOfElts=connI[pos+1]-connI[pos];
2654 newC=std::copy(conn+connI[pos],conn+connI[pos+1],newC);
2659 setConnectivity(newConn,newConnI);
2661 free(const_cast<int *>(array));
2665 * Finds cells whose bounding boxes intersect a given bounding box.
2666 * \param [in] bbox - an array defining the bounding box via coordinates of its
2667 * extremum points in "no interlace" mode, i.e. xMin, xMax, yMin, yMax, zMin,
2669 * \param [in] eps - a factor used to increase size of the bounding box of cell
2670 * before comparing it with \a bbox. This factor is multiplied by the maximal
2671 * extent of the bounding box of cell to produce an addition to this bounding box.
2672 * \return DataArrayInt * - a new instance of DataArrayInt holding ids for found
2673 * cells. The caller is to delete this array using decrRef() as it is no more
2675 * \throw If the coordinates array is not set.
2676 * \throw If the nodal connectivity of cells is not defined.
2678 * \if ENABLE_EXAMPLES
2679 * \ref cpp_mcumesh_getCellsInBoundingBox "Here is a C++ example".<br>
2680 * \ref py_mcumesh_getCellsInBoundingBox "Here is a Python example".
2683 DataArrayInt *MEDCouplingUMesh::getCellsInBoundingBox(const double *bbox, double eps) const
2685 MCAuto<DataArrayInt> elems=DataArrayInt::New(); elems->alloc(0,1);
2686 if(getMeshDimension()==-1)
2688 elems->pushBackSilent(0);
2689 return elems.retn();
2691 int dim=getSpaceDimension();
2692 INTERP_KERNEL::AutoPtr<double> elem_bb=new double[2*dim];
2693 const int* conn = getNodalConnectivity()->getConstPointer();
2694 const int* conn_index= getNodalConnectivityIndex()->getConstPointer();
2695 const double* coords = getCoords()->getConstPointer();
2696 int nbOfCells=getNumberOfCells();
2697 for ( int ielem=0; ielem<nbOfCells;ielem++ )
2699 for (int i=0; i<dim; i++)
2701 elem_bb[i*2]=std::numeric_limits<double>::max();
2702 elem_bb[i*2+1]=-std::numeric_limits<double>::max();
2705 for (int inode=conn_index[ielem]+1; inode<conn_index[ielem+1]; inode++)//+1 due to offset of cell type.
2707 int node= conn[inode];
2708 if(node>=0)//avoid polyhedron separator
2710 for (int idim=0; idim<dim; idim++)
2712 if ( coords[node*dim+idim] < elem_bb[idim*2] )
2714 elem_bb[idim*2] = coords[node*dim+idim] ;
2716 if ( coords[node*dim+idim] > elem_bb[idim*2+1] )
2718 elem_bb[idim*2+1] = coords[node*dim+idim] ;
2723 if (intersectsBoundingBox(elem_bb, bbox, dim, eps))
2724 elems->pushBackSilent(ielem);
2726 return elems.retn();
2730 * Given a boundary box 'bbox' returns elements 'elems' contained in this 'bbox' or touching 'bbox' (within 'eps' distance).
2731 * Warning 'elems' is incremented during the call so if elems is not empty before call returned elements will be
2732 * added in 'elems' parameter.
2734 DataArrayInt *MEDCouplingUMesh::getCellsInBoundingBox(const INTERP_KERNEL::DirectedBoundingBox& bbox, double eps)
2736 MCAuto<DataArrayInt> elems=DataArrayInt::New(); elems->alloc(0,1);
2737 if(getMeshDimension()==-1)
2739 elems->pushBackSilent(0);
2740 return elems.retn();
2742 int dim=getSpaceDimension();
2743 INTERP_KERNEL::AutoPtr<double> elem_bb=new double[2*dim];
2744 const int* conn = getNodalConnectivity()->getConstPointer();
2745 const int* conn_index= getNodalConnectivityIndex()->getConstPointer();
2746 const double* coords = getCoords()->getConstPointer();
2747 int nbOfCells=getNumberOfCells();
2748 for ( int ielem=0; ielem<nbOfCells;ielem++ )
2750 for (int i=0; i<dim; i++)
2752 elem_bb[i*2]=std::numeric_limits<double>::max();
2753 elem_bb[i*2+1]=-std::numeric_limits<double>::max();
2756 for (int inode=conn_index[ielem]+1; inode<conn_index[ielem+1]; inode++)//+1 due to offset of cell type.
2758 int node= conn[inode];
2759 if(node>=0)//avoid polyhedron separator
2761 for (int idim=0; idim<dim; idim++)
2763 if ( coords[node*dim+idim] < elem_bb[idim*2] )
2765 elem_bb[idim*2] = coords[node*dim+idim] ;
2767 if ( coords[node*dim+idim] > elem_bb[idim*2+1] )
2769 elem_bb[idim*2+1] = coords[node*dim+idim] ;
2774 if(intersectsBoundingBox(bbox, elem_bb, dim, eps))
2775 elems->pushBackSilent(ielem);
2777 return elems.retn();
2781 * Returns a type of a cell by its id.
2782 * \param [in] cellId - the id of the cell of interest.
2783 * \return INTERP_KERNEL::NormalizedCellType - enumeration item describing the cell type.
2784 * \throw If \a cellId is invalid. Valid range is [0, \a this->getNumberOfCells() ).
2786 INTERP_KERNEL::NormalizedCellType MEDCouplingUMesh::getTypeOfCell(std::size_t cellId) const
2788 const int *ptI(_nodal_connec_index->begin()),*pt(_nodal_connec->begin());
2789 if(cellId<_nodal_connec_index->getNbOfElems()-1)
2790 return (INTERP_KERNEL::NormalizedCellType) pt[ptI[cellId]];
2793 std::ostringstream oss; oss << "MEDCouplingUMesh::getTypeOfCell : Requesting type of cell #" << cellId << " but it should be in [0," << _nodal_connec_index->getNbOfElems()-1 << ") !";
2794 throw INTERP_KERNEL::Exception(oss.str());
2799 * This method returns a newly allocated array containing cell ids (ascendingly sorted) whose geometric type are equal to type.
2800 * This method does not throw exception if geometric type \a type is not in \a this.
2801 * This method throws an INTERP_KERNEL::Exception if meshdimension of \b this is not equal to those of \b type.
2802 * The coordinates array is not considered here.
2804 * \param [in] type the geometric type
2805 * \return cell ids in this having geometric type \a type.
2807 DataArrayInt *MEDCouplingUMesh::giveCellsWithType(INTERP_KERNEL::NormalizedCellType type) const
2810 MCAuto<DataArrayInt> ret=DataArrayInt::New();
2812 checkConnectivityFullyDefined();
2813 int nbCells=getNumberOfCells();
2814 int mdim=getMeshDimension();
2815 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(type);
2816 if(mdim!=(int)cm.getDimension())
2817 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::giveCellsWithType : Mismatch between mesh dimension and dimension of the cell !");
2818 const int *ptI=_nodal_connec_index->getConstPointer();
2819 const int *pt=_nodal_connec->getConstPointer();
2820 for(int i=0;i<nbCells;i++)
2822 if((INTERP_KERNEL::NormalizedCellType)pt[ptI[i]]==type)
2823 ret->pushBackSilent(i);
2829 * Returns nb of cells having the geometric type \a type. No throw if no cells in \a this has the geometric type \a type.
2831 std::size_t MEDCouplingUMesh::getNumberOfCellsWithType(INTERP_KERNEL::NormalizedCellType type) const
2833 const int *ptI(_nodal_connec_index->begin()),*pt(_nodal_connec->begin());
2834 std::size_t nbOfCells(getNumberOfCells()),ret(0);
2835 for(std::size_t i=0;i<nbOfCells;i++)
2836 if((INTERP_KERNEL::NormalizedCellType) pt[ptI[i]]==type)
2842 * Returns the nodal connectivity of a given cell.
2843 * The separator of faces within polyhedron connectivity (-1) is not returned, thus
2844 * all returned node ids can be used in getCoordinatesOfNode().
2845 * \param [in] cellId - an id of the cell of interest.
2846 * \param [in,out] conn - a vector where the node ids are appended. It is not
2847 * cleared before the appending.
2848 * \throw If \a cellId is invalid. Valid range is [0, \a this->getNumberOfCells() ).
2850 void MEDCouplingUMesh::getNodeIdsOfCell(std::size_t cellId, std::vector<int>& conn) const
2852 const int *ptI(_nodal_connec_index->begin()),*pt(_nodal_connec->begin());
2853 for(const int *w=pt+ptI[cellId]+1;w!=pt+ptI[cellId+1];w++)
2858 std::string MEDCouplingUMesh::simpleRepr() const
2860 static const char msg0[]="No coordinates specified !";
2861 std::ostringstream ret;
2862 ret << "Unstructured mesh with name : \"" << getName() << "\"\n";
2863 ret << "Description of mesh : \"" << getDescription() << "\"\n";
2865 double tt=getTime(tmpp1,tmpp2);
2866 ret << "Time attached to the mesh [unit] : " << tt << " [" << getTimeUnit() << "]\n";
2867 ret << "Iteration : " << tmpp1 << " Order : " << tmpp2 << "\n";
2869 { ret << "Mesh dimension : " << _mesh_dim << "\nSpace dimension : "; }
2871 { ret << " Mesh dimension has not been set or is invalid !"; }
2874 const int spaceDim=getSpaceDimension();
2875 ret << spaceDim << "\nInfo attached on space dimension : ";
2876 for(int i=0;i<spaceDim;i++)
2877 ret << "\"" << _coords->getInfoOnComponent(i) << "\" ";
2881 ret << msg0 << "\n";
2882 ret << "Number of nodes : ";
2884 ret << getNumberOfNodes() << "\n";
2886 ret << msg0 << "\n";
2887 ret << "Number of cells : ";
2888 if(_nodal_connec!=0 && _nodal_connec_index!=0)
2889 ret << getNumberOfCells() << "\n";
2891 ret << "No connectivity specified !" << "\n";
2892 ret << "Cell types present : ";
2893 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator iter=_types.begin();iter!=_types.end();iter++)
2895 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(*iter);
2896 ret << cm.getRepr() << " ";
2902 std::string MEDCouplingUMesh::advancedRepr() const
2904 std::ostringstream ret;
2905 ret << simpleRepr();
2906 ret << "\nCoordinates array : \n___________________\n\n";
2908 _coords->reprWithoutNameStream(ret);
2910 ret << "No array set !\n";
2911 ret << "\n\nConnectivity arrays : \n_____________________\n\n";
2912 reprConnectivityOfThisLL(ret);
2917 * This method returns a C++ code that is a dump of \a this.
2918 * This method will throw if this is not fully defined.
2920 std::string MEDCouplingUMesh::cppRepr() const
2922 static const char coordsName[]="coords";
2923 static const char connName[]="conn";
2924 static const char connIName[]="connI";
2925 checkFullyDefined();
2926 std::ostringstream ret; ret << "// coordinates" << std::endl;
2927 _coords->reprCppStream(coordsName,ret); ret << std::endl << "// connectivity" << std::endl;
2928 _nodal_connec->reprCppStream(connName,ret); ret << std::endl;
2929 _nodal_connec_index->reprCppStream(connIName,ret); ret << std::endl;
2930 ret << "MEDCouplingUMesh *mesh=MEDCouplingUMesh::New(\"" << getName() << "\"," << getMeshDimension() << ");" << std::endl;
2931 ret << "mesh->setCoords(" << coordsName << ");" << std::endl;
2932 ret << "mesh->setConnectivity(" << connName << "," << connIName << ",true);" << std::endl;
2933 ret << coordsName << "->decrRef(); " << connName << "->decrRef(); " << connIName << "->decrRef();" << std::endl;
2937 std::string MEDCouplingUMesh::reprConnectivityOfThis() const
2939 std::ostringstream ret;
2940 reprConnectivityOfThisLL(ret);
2945 * This method builds a newly allocated instance (with the same name than \a this) that the caller has the responsibility to deal with.
2946 * This method returns an instance with all arrays allocated (connectivity, connectivity index, coordinates)
2947 * but with length of these arrays set to 0. It allows to define an "empty" mesh (with nor cells nor nodes but compliant with
2950 * This method expects that \a this has a mesh dimension set and higher or equal to 0. If not an exception will be thrown.
2951 * This method analyzes the 3 arrays of \a this. For each the following behaviour is done : if the array is null a newly one is created
2952 * with number of tuples set to 0, if not the array is taken as this in the returned instance.
2954 MEDCouplingUMesh *MEDCouplingUMesh::buildSetInstanceFromThis(int spaceDim) const
2956 int mdim=getMeshDimension();
2958 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSetInstanceFromThis : invalid mesh dimension ! Should be >= 0 !");
2959 MCAuto<MEDCouplingUMesh> ret=MEDCouplingUMesh::New(getName(),mdim);
2960 MCAuto<DataArrayInt> tmp1,tmp2;
2961 bool needToCpyCT=true;
2964 tmp1=DataArrayInt::New(); tmp1->alloc(0,1);
2972 if(!_nodal_connec_index)
2974 tmp2=DataArrayInt::New(); tmp2->alloc(1,1); tmp2->setIJ(0,0,0);
2979 tmp2=_nodal_connec_index;
2982 ret->setConnectivity(tmp1,tmp2,false);
2987 MCAuto<DataArrayDouble> coords=DataArrayDouble::New(); coords->alloc(0,spaceDim);
2988 ret->setCoords(coords);
2991 ret->setCoords(_coords);
2995 int MEDCouplingUMesh::getNumberOfNodesInCell(int cellId) const
2997 const int *ptI=_nodal_connec_index->getConstPointer();
2998 const int *pt=_nodal_connec->getConstPointer();
2999 if(pt[ptI[cellId]]!=INTERP_KERNEL::NORM_POLYHED)
3000 return ptI[cellId+1]-ptI[cellId]-1;
3002 return (int)std::count_if(pt+ptI[cellId]+1,pt+ptI[cellId+1],std::bind2nd(std::not_equal_to<int>(),-1));
3006 * Returns types of cells of the specified part of \a this mesh.
3007 * This method avoids computing sub-mesh explicitly to get its types.
3008 * \param [in] begin - an array of cell ids of interest.
3009 * \param [in] end - the end of \a begin, i.e. a pointer to its (last+1)-th element.
3010 * \return std::set<INTERP_KERNEL::NormalizedCellType> - a set of enumeration items
3011 * describing the cell types.
3012 * \throw If the coordinates array is not set.
3013 * \throw If the nodal connectivity of cells is not defined.
3014 * \sa getAllGeoTypes()
3016 std::set<INTERP_KERNEL::NormalizedCellType> MEDCouplingUMesh::getTypesOfPart(const int *begin, const int *end) const
3018 checkFullyDefined();
3019 std::set<INTERP_KERNEL::NormalizedCellType> ret;
3020 const int *conn=_nodal_connec->getConstPointer();
3021 const int *connIndex=_nodal_connec_index->getConstPointer();
3022 for(const int *w=begin;w!=end;w++)
3023 ret.insert((INTERP_KERNEL::NormalizedCellType)conn[connIndex[*w]]);
3028 * Defines the nodal connectivity using given connectivity arrays in \ref numbering-indirect format.
3029 * Optionally updates
3030 * a set of types of cells constituting \a this mesh.
3031 * This method is for advanced users having prepared their connectivity before. For
3032 * more info on using this method see \ref MEDCouplingUMeshAdvBuild.
3033 * \param [in] conn - the nodal connectivity array.
3034 * \param [in] connIndex - the nodal connectivity index array.
3035 * \param [in] isComputingTypes - if \c true, the set of types constituting \a this
3038 void MEDCouplingUMesh::setConnectivity(DataArrayInt *conn, DataArrayInt *connIndex, bool isComputingTypes)
3040 DataArrayInt::SetArrayIn(conn,_nodal_connec);
3041 DataArrayInt::SetArrayIn(connIndex,_nodal_connec_index);
3042 if(isComputingTypes)
3048 * Copy constructor. If 'deepCopy' is false \a this is a shallow copy of other.
3049 * If 'deeCpy' is true all arrays (coordinates and connectivities) are deeply copied.
3051 MEDCouplingUMesh::MEDCouplingUMesh(const MEDCouplingUMesh& other, bool deepCpy):MEDCouplingPointSet(other,deepCpy),_mesh_dim(other._mesh_dim),
3052 _nodal_connec(0),_nodal_connec_index(0),
3053 _types(other._types)
3055 if(other._nodal_connec)
3056 _nodal_connec=other._nodal_connec->performCopyOrIncrRef(deepCpy);
3057 if(other._nodal_connec_index)
3058 _nodal_connec_index=other._nodal_connec_index->performCopyOrIncrRef(deepCpy);
3061 MEDCouplingUMesh::~MEDCouplingUMesh()
3064 _nodal_connec->decrRef();
3065 if(_nodal_connec_index)
3066 _nodal_connec_index->decrRef();
3070 * Recomputes a set of cell types of \a this mesh. For more info see
3071 * \ref MEDCouplingUMeshNodalConnectivity.
3073 void MEDCouplingUMesh::computeTypes()
3075 ComputeAllTypesInternal(_types,_nodal_connec,_nodal_connec_index);
3080 * Returns a number of cells constituting \a this mesh.
3081 * \return int - the number of cells in \a this mesh.
3082 * \throw If the nodal connectivity of cells is not defined.
3084 std::size_t MEDCouplingUMesh::getNumberOfCells() const
3086 if(_nodal_connec_index)
3087 return _nodal_connec_index->getNumberOfTuples()-1;
3092 throw INTERP_KERNEL::Exception("Unable to get number of cells because no connectivity specified !");
3096 * Returns a dimension of \a this mesh, i.e. a dimension of cells constituting \a this
3097 * mesh. For more info see \ref meshes.
3098 * \return int - the dimension of \a this mesh.
3099 * \throw If the mesh dimension is not defined using setMeshDimension().
3101 int MEDCouplingUMesh::getMeshDimension() const
3104 throw INTERP_KERNEL::Exception("No mesh dimension specified !");
3109 * Returns a length of the nodal connectivity array.
3110 * This method is for test reason. Normally the integer returned is not useable by
3111 * user. For more info see \ref MEDCouplingUMeshNodalConnectivity.
3112 * \return int - the length of the nodal connectivity array.
3114 int MEDCouplingUMesh::getNodalConnectivityArrayLen() const
3116 return _nodal_connec->getNbOfElems();
3120 * First step of serialization process. Used by ParaMEDMEM and MEDCouplingCorba to transfert data between process.
3122 void MEDCouplingUMesh::getTinySerializationInformation(std::vector<double>& tinyInfoD, std::vector<int>& tinyInfo, std::vector<std::string>& littleStrings) const
3124 MEDCouplingPointSet::getTinySerializationInformation(tinyInfoD,tinyInfo,littleStrings);
3125 tinyInfo.push_back(getMeshDimension());
3126 tinyInfo.push_back(getNumberOfCells());
3128 tinyInfo.push_back(getNodalConnectivityArrayLen());
3130 tinyInfo.push_back(-1);
3134 * First step of unserialization process.
3136 bool MEDCouplingUMesh::isEmptyMesh(const std::vector<int>& tinyInfo) const
3138 return tinyInfo[6]<=0;
3142 * Second step of serialization process.
3143 * \param tinyInfo must be equal to the result given by getTinySerializationInformation method.
3146 * \param littleStrings
3148 void MEDCouplingUMesh::resizeForUnserialization(const std::vector<int>& tinyInfo, DataArrayInt *a1, DataArrayDouble *a2, std::vector<std::string>& littleStrings) const
3150 MEDCouplingPointSet::resizeForUnserialization(tinyInfo,a1,a2,littleStrings);
3152 a1->alloc(tinyInfo[7]+tinyInfo[6]+1,1);
3156 * Third and final step of serialization process.
3158 void MEDCouplingUMesh::serialize(DataArrayInt *&a1, DataArrayDouble *&a2) const
3160 MEDCouplingPointSet::serialize(a1,a2);
3161 if(getMeshDimension()>-1)
3163 a1=DataArrayInt::New();
3164 a1->alloc(getNodalConnectivityArrayLen()+getNumberOfCells()+1,1);
3165 int *ptA1=a1->getPointer();
3166 const int *conn=getNodalConnectivity()->getConstPointer();
3167 const int *index=getNodalConnectivityIndex()->getConstPointer();
3168 ptA1=std::copy(index,index+getNumberOfCells()+1,ptA1);
3169 std::copy(conn,conn+getNodalConnectivityArrayLen(),ptA1);
3176 * Second and final unserialization process.
3177 * \param tinyInfo must be equal to the result given by getTinySerializationInformation method.
3179 void MEDCouplingUMesh::unserialization(const std::vector<double>& tinyInfoD, const std::vector<int>& tinyInfo, const DataArrayInt *a1, DataArrayDouble *a2, const std::vector<std::string>& littleStrings)
3181 MEDCouplingPointSet::unserialization(tinyInfoD,tinyInfo,a1,a2,littleStrings);
3182 setMeshDimension(tinyInfo[5]);
3186 const int *recvBuffer=a1->getConstPointer();
3187 MCAuto<DataArrayInt> myConnecIndex=DataArrayInt::New();
3188 myConnecIndex->alloc(tinyInfo[6]+1,1);
3189 std::copy(recvBuffer,recvBuffer+tinyInfo[6]+1,myConnecIndex->getPointer());
3190 MCAuto<DataArrayInt> myConnec=DataArrayInt::New();
3191 myConnec->alloc(tinyInfo[7],1);
3192 std::copy(recvBuffer+tinyInfo[6]+1,recvBuffer+tinyInfo[6]+1+tinyInfo[7],myConnec->getPointer());
3193 setConnectivity(myConnec, myConnecIndex);
3200 * Returns a new MEDCouplingFieldDouble containing volumes of cells constituting \a this
3202 * For 1D cells, the returned field contains lengths.<br>
3203 * For 2D cells, the returned field contains areas.<br>
3204 * For 3D cells, the returned field contains volumes.
3205 * \param [in] isAbs - if \c true, the computed cell volume does not reflect cell
3206 * orientation, i.e. the volume is always positive.
3207 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on cells
3208 * and one time . The caller is to delete this field using decrRef() as it is no
3211 MEDCouplingFieldDouble *MEDCouplingUMesh::getMeasureField(bool isAbs) const
3213 std::string name="MeasureOfMesh_";
3215 int nbelem=getNumberOfCells();
3216 MCAuto<MEDCouplingFieldDouble> field=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
3217 field->setName(name);
3218 MCAuto<DataArrayDouble> array=DataArrayDouble::New();
3219 array->alloc(nbelem,1);
3220 double *area_vol=array->getPointer();
3221 field->setArray(array) ; array=0;
3222 field->setMesh(const_cast<MEDCouplingUMesh *>(this));
3223 field->synchronizeTimeWithMesh();
3224 if(getMeshDimension()!=-1)
3227 INTERP_KERNEL::NormalizedCellType type;
3228 int dim_space=getSpaceDimension();
3229 const double *coords=getCoords()->getConstPointer();
3230 const int *connec=getNodalConnectivity()->getConstPointer();
3231 const int *connec_index=getNodalConnectivityIndex()->getConstPointer();
3232 for(int iel=0;iel<nbelem;iel++)
3234 ipt=connec_index[iel];
3235 type=(INTERP_KERNEL::NormalizedCellType)connec[ipt];
3236 area_vol[iel]=INTERP_KERNEL::computeVolSurfOfCell2<int,INTERP_KERNEL::ALL_C_MODE>(type,connec+ipt+1,connec_index[iel+1]-ipt-1,coords,dim_space);
3239 std::transform(area_vol,area_vol+nbelem,area_vol,std::ptr_fun<double,double>(fabs));
3243 area_vol[0]=std::numeric_limits<double>::max();
3245 return field.retn();
3249 * Returns a new DataArrayDouble containing volumes of specified cells of \a this
3251 * For 1D cells, the returned array contains lengths.<br>
3252 * For 2D cells, the returned array contains areas.<br>
3253 * For 3D cells, the returned array contains volumes.
3254 * This method avoids building explicitly a part of \a this mesh to perform the work.
3255 * \param [in] isAbs - if \c true, the computed cell volume does not reflect cell
3256 * orientation, i.e. the volume is always positive.
3257 * \param [in] begin - an array of cell ids of interest.
3258 * \param [in] end - the end of \a begin, i.e. a pointer to its (last+1)-th element.
3259 * \return DataArrayDouble * - a new instance of DataArrayDouble. The caller is to
3260 * delete this array using decrRef() as it is no more needed.
3262 * \if ENABLE_EXAMPLES
3263 * \ref cpp_mcumesh_getPartMeasureField "Here is a C++ example".<br>
3264 * \ref py_mcumesh_getPartMeasureField "Here is a Python example".
3266 * \sa getMeasureField()
3268 DataArrayDouble *MEDCouplingUMesh::getPartMeasureField(bool isAbs, const int *begin, const int *end) const
3270 std::string name="PartMeasureOfMesh_";
3272 int nbelem=(int)std::distance(begin,end);
3273 MCAuto<DataArrayDouble> array=DataArrayDouble::New();
3274 array->setName(name);
3275 array->alloc(nbelem,1);
3276 double *area_vol=array->getPointer();
3277 if(getMeshDimension()!=-1)
3280 INTERP_KERNEL::NormalizedCellType type;
3281 int dim_space=getSpaceDimension();
3282 const double *coords=getCoords()->getConstPointer();
3283 const int *connec=getNodalConnectivity()->getConstPointer();
3284 const int *connec_index=getNodalConnectivityIndex()->getConstPointer();
3285 for(const int *iel=begin;iel!=end;iel++)
3287 ipt=connec_index[*iel];
3288 type=(INTERP_KERNEL::NormalizedCellType)connec[ipt];
3289 *area_vol++=INTERP_KERNEL::computeVolSurfOfCell2<int,INTERP_KERNEL::ALL_C_MODE>(type,connec+ipt+1,connec_index[*iel+1]-ipt-1,coords,dim_space);
3292 std::transform(array->getPointer(),area_vol,array->getPointer(),std::ptr_fun<double,double>(fabs));
3296 area_vol[0]=std::numeric_limits<double>::max();
3298 return array.retn();
3302 * Returns a new MEDCouplingFieldDouble containing volumes of cells of a dual mesh of
3303 * \a this one. The returned field contains the dual cell volume for each corresponding
3304 * node in \a this mesh. In other words, the field returns the getMeasureField() of
3305 * the dual mesh in P1 sens of \a this.<br>
3306 * For 1D cells, the returned field contains lengths.<br>
3307 * For 2D cells, the returned field contains areas.<br>
3308 * For 3D cells, the returned field contains volumes.
3309 * This method is useful to check "P1*" conservative interpolators.
3310 * \param [in] isAbs - if \c true, the computed cell volume does not reflect cell
3311 * orientation, i.e. the volume is always positive.
3312 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
3313 * nodes and one time. The caller is to delete this array using decrRef() as
3314 * it is no more needed.
3316 MEDCouplingFieldDouble *MEDCouplingUMesh::getMeasureFieldOnNode(bool isAbs) const
3318 MCAuto<MEDCouplingFieldDouble> tmp=getMeasureField(isAbs);
3319 std::string name="MeasureOnNodeOfMesh_";
3321 int nbNodes=getNumberOfNodes();
3322 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_NODES);
3323 double cst=1./((double)getMeshDimension()+1.);
3324 MCAuto<DataArrayDouble> array=DataArrayDouble::New();
3325 array->alloc(nbNodes,1);
3326 double *valsToFill=array->getPointer();
3327 std::fill(valsToFill,valsToFill+nbNodes,0.);
3328 const double *values=tmp->getArray()->getConstPointer();
3329 MCAuto<DataArrayInt> da=DataArrayInt::New();
3330 MCAuto<DataArrayInt> daInd=DataArrayInt::New();
3331 getReverseNodalConnectivity(da,daInd);
3332 const int *daPtr=da->getConstPointer();
3333 const int *daIPtr=daInd->getConstPointer();
3334 for(int i=0;i<nbNodes;i++)
3335 for(const int *cell=daPtr+daIPtr[i];cell!=daPtr+daIPtr[i+1];cell++)
3336 valsToFill[i]+=cst*values[*cell];
3338 ret->setArray(array);
3343 * Returns a new MEDCouplingFieldDouble holding normal vectors to cells of \a this
3344 * mesh. The returned normal vectors to each cell have a norm2 equal to 1.
3345 * The computed vectors have <em> this->getMeshDimension()+1 </em> components
3346 * and are normalized.
3347 * <br> \a this can be either
3348 * - a 2D mesh in 2D or 3D space or
3349 * - an 1D mesh in 2D space.
3351 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
3352 * cells and one time. The caller is to delete this field using decrRef() as
3353 * it is no more needed.
3354 * \throw If the nodal connectivity of cells is not defined.
3355 * \throw If the coordinates array is not set.
3356 * \throw If the mesh dimension is not set.
3357 * \throw If the mesh and space dimension is not as specified above.
3359 MEDCouplingFieldDouble *MEDCouplingUMesh::buildOrthogonalField() const
3361 if((getMeshDimension()!=2) && (getMeshDimension()!=1 || getSpaceDimension()!=2))
3362 throw INTERP_KERNEL::Exception("Expected a umesh with ( meshDim == 2 spaceDim == 2 or 3 ) or ( meshDim == 1 spaceDim == 2 ) !");
3363 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
3364 MCAuto<DataArrayDouble> array=DataArrayDouble::New();
3365 int nbOfCells=getNumberOfCells();
3366 int nbComp=getMeshDimension()+1;
3367 array->alloc(nbOfCells,nbComp);
3368 double *vals=array->getPointer();
3369 const int *connI=_nodal_connec_index->getConstPointer();
3370 const int *conn=_nodal_connec->getConstPointer();
3371 const double *coords=_coords->getConstPointer();
3372 if(getMeshDimension()==2)
3374 if(getSpaceDimension()==3)
3376 MCAuto<DataArrayDouble> loc=computeCellCenterOfMass();
3377 const double *locPtr=loc->getConstPointer();
3378 for(int i=0;i<nbOfCells;i++,vals+=3)
3380 int offset=connI[i];
3381 INTERP_KERNEL::crossprod<3>(locPtr+3*i,coords+3*conn[offset+1],coords+3*conn[offset+2],vals);
3382 double n=INTERP_KERNEL::norm<3>(vals);
3383 std::transform(vals,vals+3,vals,std::bind2nd(std::multiplies<double>(),1./n));
3388 MCAuto<MEDCouplingFieldDouble> isAbs=getMeasureField(false);
3389 const double *isAbsPtr=isAbs->getArray()->begin();
3390 for(int i=0;i<nbOfCells;i++,isAbsPtr++)
3391 { vals[3*i]=0.; vals[3*i+1]=0.; vals[3*i+2]=*isAbsPtr>0.?1.:-1.; }
3394 else//meshdimension==1
3397 for(int i=0;i<nbOfCells;i++)
3399 int offset=connI[i];
3400 std::transform(coords+2*conn[offset+2],coords+2*conn[offset+2]+2,coords+2*conn[offset+1],tmp,std::minus<double>());
3401 double n=INTERP_KERNEL::norm<2>(tmp);
3402 std::transform(tmp,tmp+2,tmp,std::bind2nd(std::multiplies<double>(),1./n));
3407 ret->setArray(array);
3409 ret->synchronizeTimeWithSupport();
3414 * Returns a new MEDCouplingFieldDouble holding normal vectors to specified cells of
3415 * \a this mesh. The computed vectors have <em> this->getMeshDimension()+1 </em> components
3416 * and are normalized.
3417 * <br> \a this can be either
3418 * - a 2D mesh in 2D or 3D space or
3419 * - an 1D mesh in 2D space.
3421 * This method avoids building explicitly a part of \a this mesh to perform the work.
3422 * \param [in] begin - an array of cell ids of interest.
3423 * \param [in] end - the end of \a begin, i.e. a pointer to its (last+1)-th element.
3424 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
3425 * cells and one time. The caller is to delete this field using decrRef() as
3426 * it is no more needed.
3427 * \throw If the nodal connectivity of cells is not defined.
3428 * \throw If the coordinates array is not set.
3429 * \throw If the mesh dimension is not set.
3430 * \throw If the mesh and space dimension is not as specified above.
3431 * \sa buildOrthogonalField()
3433 * \if ENABLE_EXAMPLES
3434 * \ref cpp_mcumesh_buildPartOrthogonalField "Here is a C++ example".<br>
3435 * \ref py_mcumesh_buildPartOrthogonalField "Here is a Python example".
3438 MEDCouplingFieldDouble *MEDCouplingUMesh::buildPartOrthogonalField(const int *begin, const int *end) const
3440 if((getMeshDimension()!=2) && (getMeshDimension()!=1 || getSpaceDimension()!=2))
3441 throw INTERP_KERNEL::Exception("Expected a umesh with ( meshDim == 2 spaceDim == 2 or 3 ) or ( meshDim == 1 spaceDim == 2 ) !");
3442 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
3443 MCAuto<DataArrayDouble> array=DataArrayDouble::New();
3444 std::size_t nbelems=std::distance(begin,end);
3445 int nbComp=getMeshDimension()+1;
3446 array->alloc((int)nbelems,nbComp);
3447 double *vals=array->getPointer();
3448 const int *connI=_nodal_connec_index->getConstPointer();
3449 const int *conn=_nodal_connec->getConstPointer();
3450 const double *coords=_coords->getConstPointer();
3451 if(getMeshDimension()==2)
3453 if(getSpaceDimension()==3)
3455 MCAuto<DataArrayDouble> loc=getPartBarycenterAndOwner(begin,end);
3456 const double *locPtr=loc->getConstPointer();
3457 for(const int *i=begin;i!=end;i++,vals+=3,locPtr+=3)
3459 int offset=connI[*i];
3460 INTERP_KERNEL::crossprod<3>(locPtr,coords+3*conn[offset+1],coords+3*conn[offset+2],vals);
3461 double n=INTERP_KERNEL::norm<3>(vals);
3462 std::transform(vals,vals+3,vals,std::bind2nd(std::multiplies<double>(),1./n));
3467 for(std::size_t i=0;i<nbelems;i++)
3468 { vals[3*i]=0.; vals[3*i+1]=0.; vals[3*i+2]=1.; }
3471 else//meshdimension==1
3474 for(const int *i=begin;i!=end;i++)
3476 int offset=connI[*i];
3477 std::transform(coords+2*conn[offset+2],coords+2*conn[offset+2]+2,coords+2*conn[offset+1],tmp,std::minus<double>());
3478 double n=INTERP_KERNEL::norm<2>(tmp);
3479 std::transform(tmp,tmp+2,tmp,std::bind2nd(std::multiplies<double>(),1./n));
3484 ret->setArray(array);
3486 ret->synchronizeTimeWithSupport();
3491 * Returns a new MEDCouplingFieldDouble holding a direction vector for each SEG2 in \a
3492 * this 1D mesh. The computed vectors have <em> this->getSpaceDimension() </em> components
3493 * and are \b not normalized.
3494 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
3495 * cells and one time. The caller is to delete this field using decrRef() as
3496 * it is no more needed.
3497 * \throw If the nodal connectivity of cells is not defined.
3498 * \throw If the coordinates array is not set.
3499 * \throw If \a this->getMeshDimension() != 1.
3500 * \throw If \a this mesh includes cells of type other than SEG2.
3502 MEDCouplingFieldDouble *MEDCouplingUMesh::buildDirectionVectorField() const
3504 if(getMeshDimension()!=1)
3505 throw INTERP_KERNEL::Exception("Expected a umesh with meshDim == 1 for buildDirectionVectorField !");
3506 if(_types.size()!=1 || *(_types.begin())!=INTERP_KERNEL::NORM_SEG2)
3507 throw INTERP_KERNEL::Exception("Expected a umesh with only NORM_SEG2 type of elements for buildDirectionVectorField !");
3508 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
3509 MCAuto<DataArrayDouble> array=DataArrayDouble::New();
3510 int nbOfCells=getNumberOfCells();
3511 int spaceDim=getSpaceDimension();
3512 array->alloc(nbOfCells,spaceDim);
3513 double *pt=array->getPointer();
3514 const double *coo=getCoords()->getConstPointer();
3515 std::vector<int> conn;
3517 for(int i=0;i<nbOfCells;i++)
3520 getNodeIdsOfCell(i,conn);
3521 pt=std::transform(coo+conn[1]*spaceDim,coo+(conn[1]+1)*spaceDim,coo+conn[0]*spaceDim,pt,std::minus<double>());
3523 ret->setArray(array);
3525 ret->synchronizeTimeWithSupport();
3530 * Creates a 2D mesh by cutting \a this 3D mesh with a plane. In addition to the mesh,
3531 * returns a new DataArrayInt, of length equal to the number of 2D cells in the result
3532 * mesh, holding, for each cell in the result mesh, an id of a 3D cell it comes
3533 * from. If a result face is shared by two 3D cells, then the face in included twice in
3535 * \param [in] origin - 3 components of a point defining location of the plane.
3536 * \param [in] vec - 3 components of a vector normal to the plane. Vector magnitude
3537 * must be greater than 1e-6.
3538 * \param [in] eps - half-thickness of the plane.
3539 * \param [out] cellIds - a new instance of DataArrayInt holding ids of 3D cells
3540 * producing correspondent 2D cells. The caller is to delete this array
3541 * using decrRef() as it is no more needed.
3542 * \return MEDCouplingUMesh * - a new instance of MEDCouplingUMesh. This mesh does
3543 * not share the node coordinates array with \a this mesh. The caller is to
3544 * delete this mesh using decrRef() as it is no more needed.
3545 * \throw If the coordinates array is not set.
3546 * \throw If the nodal connectivity of cells is not defined.
3547 * \throw If \a this->getMeshDimension() != 3 or \a this->getSpaceDimension() != 3.
3548 * \throw If magnitude of \a vec is less than 1e-6.
3549 * \throw If the plane does not intersect any 3D cell of \a this mesh.
3550 * \throw If \a this includes quadratic cells.
3552 MEDCouplingUMesh *MEDCouplingUMesh::buildSlice3D(const double *origin, const double *vec, double eps, DataArrayInt *&cellIds) const
3554 checkFullyDefined();
3555 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
3556 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3D works on umeshes with meshdim equal to 3 and spaceDim equal to 3 too!");
3557 MCAuto<DataArrayInt> candidates=getCellIdsCrossingPlane(origin,vec,eps);
3558 if(candidates->empty())
3559 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3D : No 3D cells in this intercepts the specified plane considering bounding boxes !");
3560 std::vector<int> nodes;
3561 DataArrayInt *cellIds1D=0;
3562 MCAuto<MEDCouplingUMesh> subMesh=static_cast<MEDCouplingUMesh*>(buildPartOfMySelf(candidates->begin(),candidates->end(),false));
3563 subMesh->findNodesOnPlane(origin,vec,eps,nodes);
3564 MCAuto<DataArrayInt> desc1=DataArrayInt::New(),desc2=DataArrayInt::New();
3565 MCAuto<DataArrayInt> descIndx1=DataArrayInt::New(),descIndx2=DataArrayInt::New();
3566 MCAuto<DataArrayInt> revDesc1=DataArrayInt::New(),revDesc2=DataArrayInt::New();
3567 MCAuto<DataArrayInt> revDescIndx1=DataArrayInt::New(),revDescIndx2=DataArrayInt::New();
3568 MCAuto<MEDCouplingUMesh> mDesc2=subMesh->buildDescendingConnectivity(desc2,descIndx2,revDesc2,revDescIndx2);//meshDim==2 spaceDim==3
3569 revDesc2=0; revDescIndx2=0;
3570 MCAuto<MEDCouplingUMesh> mDesc1=mDesc2->buildDescendingConnectivity(desc1,descIndx1,revDesc1,revDescIndx1);//meshDim==1 spaceDim==3
3571 revDesc1=0; revDescIndx1=0;
3572 mDesc1->fillCellIdsToKeepFromNodeIds(&nodes[0],&nodes[0]+nodes.size(),true,cellIds1D);
3573 MCAuto<DataArrayInt> cellIds1DTmp(cellIds1D);
3575 std::vector<int> cut3DCurve(mDesc1->getNumberOfCells(),-2);
3576 for(const int *it=cellIds1D->begin();it!=cellIds1D->end();it++)
3578 mDesc1->split3DCurveWithPlane(origin,vec,eps,cut3DCurve);
3579 std::vector< std::pair<int,int> > cut3DSurf(mDesc2->getNumberOfCells());
3580 AssemblyForSplitFrom3DCurve(cut3DCurve,nodes,mDesc2->getNodalConnectivity()->getConstPointer(),mDesc2->getNodalConnectivityIndex()->getConstPointer(),
3581 mDesc1->getNodalConnectivity()->getConstPointer(),mDesc1->getNodalConnectivityIndex()->getConstPointer(),
3582 desc1->getConstPointer(),descIndx1->getConstPointer(),cut3DSurf);
3583 MCAuto<DataArrayInt> conn(DataArrayInt::New()),connI(DataArrayInt::New()),cellIds2(DataArrayInt::New());
3584 connI->pushBackSilent(0); conn->alloc(0,1); cellIds2->alloc(0,1);
3585 subMesh->assemblyForSplitFrom3DSurf(cut3DSurf,desc2->getConstPointer(),descIndx2->getConstPointer(),conn,connI,cellIds2);
3586 if(cellIds2->empty())
3587 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3D : No 3D cells in this intercepts the specified plane !");
3588 MCAuto<MEDCouplingUMesh> ret=MEDCouplingUMesh::New("Slice3D",2);
3589 ret->setCoords(mDesc1->getCoords());
3590 ret->setConnectivity(conn,connI,true);
3591 cellIds=candidates->selectByTupleId(cellIds2->begin(),cellIds2->end());
3596 * Creates an 1D mesh by cutting \a this 2D mesh in 3D space with a plane. In
3597 addition to the mesh, returns a new DataArrayInt, of length equal to the number of 1D cells in the result mesh, holding, for each cell in the result mesh, an id of a 2D cell it comes
3598 from. If a result segment is shared by two 2D cells, then the segment in included twice in
3600 * \param [in] origin - 3 components of a point defining location of the plane.
3601 * \param [in] vec - 3 components of a vector normal to the plane. Vector magnitude
3602 * must be greater than 1e-6.
3603 * \param [in] eps - half-thickness of the plane.
3604 * \param [out] cellIds - a new instance of DataArrayInt holding ids of faces
3605 * producing correspondent segments. The caller is to delete this array
3606 * using decrRef() as it is no more needed.
3607 * \return MEDCouplingUMesh * - a new instance of MEDCouplingUMesh. This is an 1D
3608 * mesh in 3D space. This mesh does not share the node coordinates array with
3609 * \a this mesh. The caller is to delete this mesh using decrRef() as it is
3611 * \throw If the coordinates array is not set.
3612 * \throw If the nodal connectivity of cells is not defined.
3613 * \throw If \a this->getMeshDimension() != 2 or \a this->getSpaceDimension() != 3.
3614 * \throw If magnitude of \a vec is less than 1e-6.
3615 * \throw If the plane does not intersect any 2D cell of \a this mesh.
3616 * \throw If \a this includes quadratic cells.
3618 MEDCouplingUMesh *MEDCouplingUMesh::buildSlice3DSurf(const double *origin, const double *vec, double eps, DataArrayInt *&cellIds) const
3620 checkFullyDefined();
3621 if(getMeshDimension()!=2 || getSpaceDimension()!=3)
3622 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3DSurf works on umeshes with meshdim equal to 2 and spaceDim equal to 3 !");
3623 MCAuto<DataArrayInt> candidates(getCellIdsCrossingPlane(origin,vec,eps));
3624 if(candidates->empty())
3625 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3DSurf : No 3D surf cells in this intercepts the specified plane considering bounding boxes !");
3626 std::vector<int> nodes;
3627 DataArrayInt *cellIds1D(0);
3628 MCAuto<MEDCouplingUMesh> subMesh(buildPartOfMySelf(candidates->begin(),candidates->end(),false));
3629 subMesh->findNodesOnPlane(origin,vec,eps,nodes);
3630 MCAuto<DataArrayInt> desc1(DataArrayInt::New()),descIndx1(DataArrayInt::New()),revDesc1(DataArrayInt::New()),revDescIndx1(DataArrayInt::New());
3631 MCAuto<MEDCouplingUMesh> mDesc1(subMesh->buildDescendingConnectivity(desc1,descIndx1,revDesc1,revDescIndx1));//meshDim==1 spaceDim==3
3632 mDesc1->fillCellIdsToKeepFromNodeIds(&nodes[0],&nodes[0]+nodes.size(),true,cellIds1D);
3633 MCAuto<DataArrayInt> cellIds1DTmp(cellIds1D);
3635 std::vector<int> cut3DCurve(mDesc1->getNumberOfCells(),-2);
3636 for(const int *it=cellIds1D->begin();it!=cellIds1D->end();it++)
3638 mDesc1->split3DCurveWithPlane(origin,vec,eps,cut3DCurve);
3639 int ncellsSub=subMesh->getNumberOfCells();
3640 std::vector< std::pair<int,int> > cut3DSurf(ncellsSub);
3641 AssemblyForSplitFrom3DCurve(cut3DCurve,nodes,subMesh->getNodalConnectivity()->getConstPointer(),subMesh->getNodalConnectivityIndex()->getConstPointer(),
3642 mDesc1->getNodalConnectivity()->getConstPointer(),mDesc1->getNodalConnectivityIndex()->getConstPointer(),
3643 desc1->getConstPointer(),descIndx1->getConstPointer(),cut3DSurf);
3644 MCAuto<DataArrayInt> conn(DataArrayInt::New()),connI(DataArrayInt::New()),cellIds2(DataArrayInt::New()); connI->pushBackSilent(0);
3646 const int *nodal=subMesh->getNodalConnectivity()->getConstPointer();
3647 const int *nodalI=subMesh->getNodalConnectivityIndex()->getConstPointer();
3648 for(int i=0;i<ncellsSub;i++)
3650 if(cut3DSurf[i].first!=-1 && cut3DSurf[i].second!=-1)
3652 if(cut3DSurf[i].first!=-2)
3654 conn->pushBackSilent((int)INTERP_KERNEL::NORM_SEG2); conn->pushBackSilent(cut3DSurf[i].first); conn->pushBackSilent(cut3DSurf[i].second);
3655 connI->pushBackSilent(conn->getNumberOfTuples());
3656 cellIds2->pushBackSilent(i);
3660 int cellId3DSurf=cut3DSurf[i].second;
3661 int offset=nodalI[cellId3DSurf]+1;
3662 int nbOfEdges=nodalI[cellId3DSurf+1]-offset;
3663 for(int j=0;j<nbOfEdges;j++)
3665 conn->pushBackSilent((int)INTERP_KERNEL::NORM_SEG2); conn->pushBackSilent(nodal[offset+j]); conn->pushBackSilent(nodal[offset+(j+1)%nbOfEdges]);
3666 connI->pushBackSilent(conn->getNumberOfTuples());
3667 cellIds2->pushBackSilent(cellId3DSurf);
3672 if(cellIds2->empty())
3673 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3DSurf : No 3DSurf cells in this intercepts the specified plane !");
3674 MCAuto<MEDCouplingUMesh> ret=MEDCouplingUMesh::New("Slice3DSurf",1);
3675 ret->setCoords(mDesc1->getCoords());
3676 ret->setConnectivity(conn,connI,true);
3677 cellIds=candidates->selectByTupleId(cellIds2->begin(),cellIds2->end());
3681 MCAuto<MEDCouplingUMesh> MEDCouplingUMesh::clipSingle3DCellByPlane(const double origin[3], const double vec[3], double eps) const
3683 checkFullyDefined();
3684 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
3685 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::clipSingle3DCellByPlane works on umeshes with meshdim equal to 3 and spaceDim equal to 3 too!");
3686 if(getNumberOfCells()!=1)
3687 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::clipSingle3DCellByPlane works only on mesh containing exactly one cell !");
3689 std::vector<int> nodes;
3690 findNodesOnPlane(origin,vec,eps,nodes);
3691 MCAuto<DataArrayInt> desc1(DataArrayInt::New()),desc2(DataArrayInt::New()),descIndx1(DataArrayInt::New()),descIndx2(DataArrayInt::New()),revDesc1(DataArrayInt::New()),revDesc2(DataArrayInt::New()),revDescIndx1(DataArrayInt::New()),revDescIndx2(DataArrayInt::New());
3692 MCAuto<MEDCouplingUMesh> mDesc2(buildDescendingConnectivity(desc2,descIndx2,revDesc2,revDescIndx2));//meshDim==2 spaceDim==3
3693 revDesc2=0; revDescIndx2=0;
3694 MCAuto<MEDCouplingUMesh> mDesc1(mDesc2->buildDescendingConnectivity(desc1,descIndx1,revDesc1,revDescIndx1));//meshDim==1 spaceDim==3
3695 revDesc1=0; revDescIndx1=0;
3696 DataArrayInt *cellIds1D(0);
3697 mDesc1->fillCellIdsToKeepFromNodeIds(&nodes[0],&nodes[0]+nodes.size(),true,cellIds1D);
3698 MCAuto<DataArrayInt> cellIds1DTmp(cellIds1D);
3699 std::vector<int> cut3DCurve(mDesc1->getNumberOfCells(),-2);
3700 for(const int *it=cellIds1D->begin();it!=cellIds1D->end();it++)
3704 int oldNbNodes(mDesc1->getNumberOfNodes());
3705 mDesc1->split3DCurveWithPlane(origin,vec,eps,cut3DCurve);
3706 sameNbNodes=(mDesc1->getNumberOfNodes()==oldNbNodes);
3708 std::vector< std::pair<int,int> > cut3DSurf(mDesc2->getNumberOfCells());
3709 AssemblyForSplitFrom3DCurve(cut3DCurve,nodes,mDesc2->getNodalConnectivity()->begin(),mDesc2->getNodalConnectivityIndex()->begin(),
3710 mDesc1->getNodalConnectivity()->begin(),mDesc1->getNodalConnectivityIndex()->begin(),
3711 desc1->begin(),descIndx1->begin(),cut3DSurf);
3712 MCAuto<DataArrayInt> conn(DataArrayInt::New()),connI(DataArrayInt::New());
3713 connI->pushBackSilent(0); conn->alloc(0,1);
3715 MCAuto<DataArrayInt> cellIds2(DataArrayInt::New()); cellIds2->alloc(0,1);
3716 assemblyForSplitFrom3DSurf(cut3DSurf,desc2->begin(),descIndx2->begin(),conn,connI,cellIds2);
3717 if(cellIds2->empty())
3718 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3D : No 3D cells in this intercepts the specified plane !");
3720 std::vector<std::vector<int> > res;
3721 buildSubCellsFromCut(cut3DSurf,desc2->begin(),descIndx2->begin(),mDesc1->getCoords()->begin(),eps,res);
3722 std::size_t sz(res.size());
3723 if(res.size()==mDesc1->getNumberOfCells() && sameNbNodes)
3724 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::clipSingle3DCellByPlane : cell is not clipped !");
3725 for(std::size_t i=0;i<sz;i++)
3727 conn->pushBackSilent((int)INTERP_KERNEL::NORM_POLYGON);
3728 conn->insertAtTheEnd(res[i].begin(),res[i].end());
3729 connI->pushBackSilent(conn->getNumberOfTuples());
3731 MCAuto<MEDCouplingUMesh> ret(MEDCouplingUMesh::New("",2));
3732 ret->setCoords(mDesc1->getCoords());
3733 ret->setConnectivity(conn,connI,true);
3734 int nbCellsRet(ret->getNumberOfCells());
3736 MCAuto<DataArrayDouble> vec2(DataArrayDouble::New()); vec2->alloc(1,3); std::copy(vec,vec+3,vec2->getPointer());
3737 MCAuto<MEDCouplingFieldDouble> ortho(ret->buildOrthogonalField());
3738 MCAuto<DataArrayDouble> ortho2(ortho->getArray()->selectByTupleIdSafeSlice(0,1,1));
3739 MCAuto<DataArrayDouble> dott(DataArrayDouble::Dot(ortho2,vec2));
3740 MCAuto<DataArrayDouble> ccm(ret->computeCellCenterOfMass());
3741 MCAuto<DataArrayDouble> occm;
3743 MCAuto<DataArrayDouble> pt(DataArrayDouble::New()); pt->alloc(1,3); std::copy(origin,origin+3,pt->getPointer());
3744 occm=DataArrayDouble::Substract(ccm,pt);
3746 vec2=DataArrayDouble::New(); vec2->alloc(nbCellsRet,3);
3747 vec2->setPartOfValuesSimple1(vec[0],0,nbCellsRet,1,0,1,1); vec2->setPartOfValuesSimple1(vec[1],0,nbCellsRet,1,1,2,1); vec2->setPartOfValuesSimple1(vec[2],0,nbCellsRet,1,2,3,1);
3748 MCAuto<DataArrayDouble> dott2(DataArrayDouble::Dot(occm,vec2));
3750 const int *cPtr(ret->getNodalConnectivity()->begin()),*ciPtr(ret->getNodalConnectivityIndex()->begin());
3751 MCAuto<MEDCouplingUMesh> ret2(MEDCouplingUMesh::New("Clip3D",3));
3752 ret2->setCoords(mDesc1->getCoords());
3753 MCAuto<DataArrayInt> conn2(DataArrayInt::New()),conn2I(DataArrayInt::New());
3754 conn2I->pushBackSilent(0); conn2->alloc(0,1);
3755 std::vector<int> cell0(1,(int)INTERP_KERNEL::NORM_POLYHED);
3756 std::vector<int> cell1(1,(int)INTERP_KERNEL::NORM_POLYHED);
3757 if(dott->getIJ(0,0)>0)
3759 cell0.insert(cell0.end(),cPtr+1,cPtr+ciPtr[1]);
3760 std::reverse_copy(cPtr+1,cPtr+ciPtr[1],std::inserter(cell1,cell1.end()));
3764 cell1.insert(cell1.end(),cPtr+1,cPtr+ciPtr[1]);
3765 std::reverse_copy(cPtr+1,cPtr+ciPtr[1],std::inserter(cell0,cell0.end()));
3767 for(int i=1;i<nbCellsRet;i++)
3769 if(dott2->getIJ(i,0)<0)
3771 if(ciPtr[i+1]-ciPtr[i]>=4)
3773 cell0.push_back(-1);
3774 cell0.insert(cell0.end(),cPtr+ciPtr[i]+1,cPtr+ciPtr[i+1]);
3779 if(ciPtr[i+1]-ciPtr[i]>=4)
3781 cell1.push_back(-1);
3782 cell1.insert(cell1.end(),cPtr+ciPtr[i]+1,cPtr+ciPtr[i+1]);
3786 conn2->insertAtTheEnd(cell0.begin(),cell0.end());
3787 conn2I->pushBackSilent(conn2->getNumberOfTuples());
3788 conn2->insertAtTheEnd(cell1.begin(),cell1.end());
3789 conn2I->pushBackSilent(conn2->getNumberOfTuples());
3790 ret2->setConnectivity(conn2,conn2I,true);
3791 ret2->checkConsistencyLight();
3792 ret2->orientCorrectlyPolyhedrons();
3797 * Finds cells whose bounding boxes intersect a given plane.
3798 * \param [in] origin - 3 components of a point defining location of the plane.
3799 * \param [in] vec - 3 components of a vector normal to the plane. Vector magnitude
3800 * must be greater than 1e-6.
3801 * \param [in] eps - half-thickness of the plane.
3802 * \return DataArrayInt * - a new instance of DataArrayInt holding ids of the found
3803 * cells. The caller is to delete this array using decrRef() as it is no more
3805 * \throw If the coordinates array is not set.
3806 * \throw If the nodal connectivity of cells is not defined.
3807 * \throw If \a this->getSpaceDimension() != 3.
3808 * \throw If magnitude of \a vec is less than 1e-6.
3809 * \sa buildSlice3D()
3811 DataArrayInt *MEDCouplingUMesh::getCellIdsCrossingPlane(const double *origin, const double *vec, double eps) const
3813 checkFullyDefined();
3814 if(getSpaceDimension()!=3)
3815 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSlice3D works on umeshes with spaceDim equal to 3 !");
3816 double normm=sqrt(vec[0]*vec[0]+vec[1]*vec[1]+vec[2]*vec[2]);
3818 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getCellIdsCrossingPlane : parameter 'vec' should have a norm2 greater than 1e-6 !");
3820 vec2[0]=vec[1]; vec2[1]=-vec[0]; vec2[2]=0.;//vec2 is the result of cross product of vec with (0,0,1)
3821 double angle=acos(vec[2]/normm);
3822 MCAuto<DataArrayInt> cellIds;
3826 MCAuto<DataArrayDouble> coo=_coords->deepCopy();
3827 double normm2(sqrt(vec2[0]*vec2[0]+vec2[1]*vec2[1]+vec2[2]*vec2[2]));
3828 if(normm2/normm>1e-6)
3829 DataArrayDouble::Rotate3DAlg(origin,vec2,angle,coo->getNumberOfTuples(),coo->getPointer(),coo->getPointer());
3830 MCAuto<MEDCouplingUMesh> mw=clone(false);//false -> shallow copy
3832 mw->getBoundingBox(bbox);
3833 bbox[4]=origin[2]-eps; bbox[5]=origin[2]+eps;
3834 cellIds=mw->getCellsInBoundingBox(bbox,eps);
3838 getBoundingBox(bbox);
3839 bbox[4]=origin[2]-eps; bbox[5]=origin[2]+eps;
3840 cellIds=getCellsInBoundingBox(bbox,eps);
3842 return cellIds.retn();
3846 * This method checks that \a this is a contiguous mesh. The user is expected to call this method on a mesh with meshdim==1.
3847 * If not an exception will thrown. If this is an empty mesh with no cell an exception will be thrown too.
3848 * No consideration of coordinate is done by this method.
3849 * A 1D mesh is said contiguous if : a cell i with nodal connectivity (k,p) the cell i+1 the nodal connectivity should be (p,m)
3850 * If not false is returned. In case that false is returned a call to MEDCoupling::MEDCouplingUMesh::mergeNodes could be useful.
3852 bool MEDCouplingUMesh::isContiguous1D() const
3854 if(getMeshDimension()!=1)
3855 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::isContiguous1D : this method has a sense only for 1D mesh !");
3856 int nbCells=getNumberOfCells();
3858 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::isContiguous1D : this method has a sense for non empty mesh !");
3859 const int *connI(_nodal_connec_index->begin()),*conn(_nodal_connec->begin());
3860 int ref=conn[connI[0]+2];
3861 for(int i=1;i<nbCells;i++)
3863 if(conn[connI[i]+1]!=ref)
3865 ref=conn[connI[i]+2];
3871 * This method is only callable on mesh with meshdim == 1 containing only SEG2 and spaceDim==3.
3872 * This method projects this on the 3D line defined by (pt,v). This methods first checks that all SEG2 are along v vector.
3873 * \param pt reference point of the line
3874 * \param v normalized director vector of the line
3875 * \param eps max precision before throwing an exception
3876 * \param res output of size this->getNumberOfCells
3878 void MEDCouplingUMesh::project1D(const double *pt, const double *v, double eps, double *res) const
3880 if(getMeshDimension()!=1)
3881 throw INTERP_KERNEL::Exception("Expected a umesh with meshDim == 1 for project1D !");
3882 if(_types.size()!=1 || *(_types.begin())!=INTERP_KERNEL::NORM_SEG2)
3883 throw INTERP_KERNEL::Exception("Expected a umesh with only NORM_SEG2 type of elements for project1D !");
3884 if(getSpaceDimension()!=3)
3885 throw INTERP_KERNEL::Exception("Expected a umesh with spaceDim==3 for project1D !");
3886 MCAuto<MEDCouplingFieldDouble> f=buildDirectionVectorField();
3887 const double *fPtr=f->getArray()->getConstPointer();
3889 for(std::size_t i=0;i<getNumberOfCells();i++)
3891 const double *tmp1=fPtr+3*i;
3892 tmp[0]=tmp1[1]*v[2]-tmp1[2]*v[1];
3893 tmp[1]=tmp1[2]*v[0]-tmp1[0]*v[2];
3894 tmp[2]=tmp1[0]*v[1]-tmp1[1]*v[0];
3895 double n1=INTERP_KERNEL::norm<3>(tmp);
3896 n1/=INTERP_KERNEL::norm<3>(tmp1);
3898 throw INTERP_KERNEL::Exception("UMesh::Projection 1D failed !");
3900 const double *coo=getCoords()->getConstPointer();
3901 for(int i=0;i<getNumberOfNodes();i++)
3903 std::transform(coo+i*3,coo+i*3+3,pt,tmp,std::minus<double>());
3904 std::transform(tmp,tmp+3,v,tmp,std::multiplies<double>());
3905 res[i]=std::accumulate(tmp,tmp+3,0.);
3910 * This method computes the distance from a point \a pt to \a this and the first \a cellId in \a this corresponding to the returned distance.
3911 * \a this is expected to be a mesh so that its space dimension is equal to its
3912 * mesh dimension + 1. Furthermore only mesh dimension 1 and 2 are supported for the moment.
3913 * Distance from \a ptBg to \a ptEnd is expected to be equal to the space dimension. \a this is also expected to be fully defined (connectivity and coordinates).
3915 * WARNING, if there is some orphan nodes in \a this (nodes not fetched by any cells in \a this ( see MEDCouplingUMesh::zipCoords ) ) these nodes will ** not ** been taken
3916 * into account in this method. Only cells and nodes lying on them are considered in the algorithm (even if one of these orphan nodes is closer than returned distance).
3917 * A user that needs to consider orphan nodes should invoke DataArrayDouble::minimalDistanceTo method on the coordinates array of \a this.
3919 * So this method is more accurate (so, more costly) than simply searching for the closest point in \a this.
3920 * If only this information is enough for you simply call \c getCoords()->distanceToTuple on \a this.
3922 * \param [in] ptBg the start pointer (included) of the coordinates of the point
3923 * \param [in] ptEnd the end pointer (not included) of the coordinates of the point
3924 * \param [out] cellId that corresponds to minimal distance. If the closer node is not linked to any cell in \a this -1 is returned.
3925 * \return the positive value of the distance.
3926 * \throw if distance from \a ptBg to \a ptEnd is not equal to the space dimension. An exception is also thrown if mesh dimension of \a this is not equal to space
3928 * \sa DataArrayDouble::distanceToTuple, MEDCouplingUMesh::distanceToPoints
3930 double MEDCouplingUMesh::distanceToPoint(const double *ptBg, const double *ptEnd, int& cellId) const
3932 int meshDim=getMeshDimension(),spaceDim=getSpaceDimension();
3933 if(meshDim!=spaceDim-1)
3934 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::distanceToPoint works only for spaceDim=meshDim+1 !");
3935 if(meshDim!=2 && meshDim!=1)
3936 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::distanceToPoint : only mesh dimension 2 and 1 are implemented !");
3937 checkFullyDefined();
3938 if((int)std::distance(ptBg,ptEnd)!=spaceDim)
3939 { std::ostringstream oss; oss << "MEDCouplingUMesh::distanceToPoint : input point has to have dimension equal to the space dimension of this (" << spaceDim << ") !"; throw INTERP_KERNEL::Exception(oss.str()); }
3940 DataArrayInt *ret1=0;
3941 MCAuto<DataArrayDouble> pts=DataArrayDouble::New(); pts->useArray(ptBg,false,C_DEALLOC,1,spaceDim);
3942 MCAuto<DataArrayDouble> ret0=distanceToPoints(pts,ret1);
3943 MCAuto<DataArrayInt> ret1Safe(ret1);
3944 cellId=*ret1Safe->begin();
3945 return *ret0->begin();
3949 * This method computes the distance from each point of points serie \a pts (stored in a DataArrayDouble in which each tuple represents a point)
3950 * to \a this and the first \a cellId in \a this corresponding to the returned distance.
3951 * WARNING, if there is some orphan nodes in \a this (nodes not fetched by any cells in \a this ( see MEDCouplingUMesh::zipCoords ) ) these nodes will ** not ** been taken
3952 * into account in this method. Only cells and nodes lying on them are considered in the algorithm (even if one of these orphan nodes is closer than returned distance).
3953 * A user that needs to consider orphan nodes should invoke DataArrayDouble::minimalDistanceTo method on the coordinates array of \a this.
3955 * \a this is expected to be a mesh so that its space dimension is equal to its
3956 * mesh dimension + 1. Furthermore only mesh dimension 1 and 2 are supported for the moment.
3957 * Number of components of \a pts is expected to be equal to the space dimension. \a this is also expected to be fully defined (connectivity and coordinates).
3959 * So this method is more accurate (so, more costly) than simply searching for each point in \a pts the closest point in \a this.
3960 * If only this information is enough for you simply call \c getCoords()->distanceToTuple on \a this.
3962 * \param [in] pts the list of points in which each tuple represents a point
3963 * \param [out] cellIds a newly allocated object that tells for each point in \a pts the first cell id in \a this that minimizes the distance.
3964 * \return a newly allocated object to be dealed by the caller that tells for each point in \a pts the distance to \a this.
3965 * \throw if number of components of \a pts is not equal to the space dimension.
3966 * \throw if mesh dimension of \a this is not equal to space dimension - 1.
3967 * \sa DataArrayDouble::distanceToTuple, MEDCouplingUMesh::distanceToPoint
3969 DataArrayDouble *MEDCouplingUMesh::distanceToPoints(const DataArrayDouble *pts, DataArrayInt *& cellIds) const
3972 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::distanceToPoints : input points pointer is NULL !");
3973 pts->checkAllocated();
3974 int meshDim=getMeshDimension(),spaceDim=getSpaceDimension();
3975 if(meshDim!=spaceDim-1)
3976 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::distanceToPoints works only for spaceDim=meshDim+1 !");
3977 if(meshDim!=2 && meshDim!=1)
3978 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::distanceToPoints : only mesh dimension 2 and 1 are implemented !");
3979 if((int)pts->getNumberOfComponents()!=spaceDim)
3981 std::ostringstream oss; oss << "MEDCouplingUMesh::distanceToPoints : input pts DataArrayDouble has " << pts->getNumberOfComponents() << " components whereas it should be equal to " << spaceDim << " (mesh spaceDimension) !";
3982 throw INTERP_KERNEL::Exception(oss.str());
3984 checkFullyDefined();
3985 int nbCells=getNumberOfCells();
3987 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::distanceToPoints : no cells in this !");
3988 int nbOfPts=pts->getNumberOfTuples();
3989 MCAuto<DataArrayDouble> ret0=DataArrayDouble::New(); ret0->alloc(nbOfPts,1);
3990 MCAuto<DataArrayInt> ret1=DataArrayInt::New(); ret1->alloc(nbOfPts,1);
3991 const int *nc=_nodal_connec->begin(),*ncI=_nodal_connec_index->begin(); const double *coords=_coords->begin();
3992 double *ret0Ptr=ret0->getPointer(); int *ret1Ptr=ret1->getPointer(); const double *ptsPtr=pts->begin();
3993 MCAuto<DataArrayDouble> bboxArr(getBoundingBoxForBBTree());
3994 const double *bbox(bboxArr->begin());
3999 BBTreeDst<3> myTree(bbox,0,0,nbCells);
4000 for(int i=0;i<nbOfPts;i++,ret0Ptr++,ret1Ptr++,ptsPtr+=3)
4002 double x=std::numeric_limits<double>::max();
4003 std::vector<int> elems;
4004 myTree.getMinDistanceOfMax(ptsPtr,x);
4005 myTree.getElemsWhoseMinDistanceToPtSmallerThan(ptsPtr,x,elems);
4006 DistanceToPoint3DSurfAlg(ptsPtr,&elems[0],&elems[0]+elems.size(),coords,nc,ncI,*ret0Ptr,*ret1Ptr);
4012 BBTreeDst<2> myTree(bbox,0,0,nbCells);
4013 for(int i=0;i<nbOfPts;i++,ret0Ptr++,ret1Ptr++,ptsPtr+=2)
4015 double x=std::numeric_limits<double>::max();
4016 std::vector<int> elems;
4017 myTree.getMinDistanceOfMax(ptsPtr,x);
4018 myTree.getElemsWhoseMinDistanceToPtSmallerThan(ptsPtr,x,elems);
4019 DistanceToPoint2DCurveAlg(ptsPtr,&elems[0],&elems[0]+elems.size(),coords,nc,ncI,*ret0Ptr,*ret1Ptr);
4024 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::distanceToPoints : only spacedim 2 and 3 supported !");
4026 cellIds=ret1.retn();
4035 * Finds cells in contact with a ball (i.e. a point with precision).
4036 * For speed reasons, the INTERP_KERNEL::NORM_QUAD4, INTERP_KERNEL::NORM_TRI6 and INTERP_KERNEL::NORM_QUAD8 cells are considered as convex cells to detect if a point is IN or OUT.
4037 * If it is not the case, please change their types to INTERP_KERNEL::NORM_POLYGON or INTERP_KERNEL::NORM_QPOLYG before invoking this method.
4039 * \warning This method is suitable if the caller intends to evaluate only one
4040 * point, for more points getCellsContainingPoints() is recommended as it is
4042 * \param [in] pos - array of coordinates of the ball central point.
4043 * \param [in] eps - ball radius.
4044 * \return int - a smallest id of cells being in contact with the ball, -1 in case
4045 * if there are no such cells.
4046 * \throw If the coordinates array is not set.
4047 * \throw If \a this->getMeshDimension() != \a this->getSpaceDimension().
4049 int MEDCouplingUMesh::getCellContainingPoint(const double *pos, double eps) const
4051 std::vector<int> elts;
4052 getCellsContainingPoint(pos,eps,elts);
4055 return elts.front();
4059 * Finds cells in contact with a ball (i.e. a point with precision).
4060 * For speed reasons, the INTERP_KERNEL::NORM_QUAD4, INTERP_KERNEL::NORM_TRI6 and INTERP_KERNEL::NORM_QUAD8 cells are considered as convex cells to detect if a point is IN or OUT.
4061 * If it is not the case, please change their types to INTERP_KERNEL::NORM_POLYGON or INTERP_KERNEL::NORM_QPOLYG before invoking this method.
4062 * \warning This method is suitable if the caller intends to evaluate only one
4063 * point, for more points getCellsContainingPoints() is recommended as it is
4065 * \param [in] pos - array of coordinates of the ball central point.
4066 * \param [in] eps - ball radius.
4067 * \param [out] elts - vector returning ids of the found cells. It is cleared
4068 * before inserting ids.
4069 * \throw If the coordinates array is not set.
4070 * \throw If \a this->getMeshDimension() != \a this->getSpaceDimension().
4072 * \if ENABLE_EXAMPLES
4073 * \ref cpp_mcumesh_getCellsContainingPoint "Here is a C++ example".<br>
4074 * \ref py_mcumesh_getCellsContainingPoint "Here is a Python example".
4077 void MEDCouplingUMesh::getCellsContainingPoint(const double *pos, double eps, std::vector<int>& elts) const
4079 MCAuto<DataArrayInt> eltsUg,eltsIndexUg;
4080 getCellsContainingPoints(pos,1,eps,eltsUg,eltsIndexUg);
4081 elts.clear(); elts.insert(elts.end(),eltsUg->begin(),eltsUg->end());
4085 * Finds cells in contact with several balls (i.e. points with precision).
4086 * This method is an extension of getCellContainingPoint() and
4087 * getCellsContainingPoint() for the case of multiple points.
4088 * For speed reasons, the INTERP_KERNEL::NORM_QUAD4, INTERP_KERNEL::NORM_TRI6 and INTERP_KERNEL::NORM_QUAD8 cells are considered as convex cells to detect if a point is IN or OUT.
4089 * If it is not the case, please change their types to INTERP_KERNEL::NORM_POLYGON or INTERP_KERNEL::NORM_QPOLYG before invoking this method.
4090 * \param [in] pos - an array of coordinates of points in full interlace mode :
4091 * X0,Y0,Z0,X1,Y1,Z1,... Size of the array must be \a
4092 * this->getSpaceDimension() * \a nbOfPoints
4093 * \param [in] nbOfPoints - number of points to locate within \a this mesh.
4094 * \param [in] eps - radius of balls (i.e. the precision).
4095 * \param [out] elts - vector returning ids of found cells.
4096 * \param [out] eltsIndex - an array, of length \a nbOfPoints + 1,
4097 * dividing cell ids in \a elts into groups each referring to one
4098 * point. Its every element (except the last one) is an index pointing to the
4099 * first id of a group of cells. For example cells in contact with the *i*-th
4100 * point are described by following range of indices:
4101 * [ \a eltsIndex[ *i* ], \a eltsIndex[ *i*+1 ] ) and the cell ids are
4102 * \a elts[ \a eltsIndex[ *i* ]], \a elts[ \a eltsIndex[ *i* ] + 1 ], ...
4103 * Number of cells in contact with the *i*-th point is
4104 * \a eltsIndex[ *i*+1 ] - \a eltsIndex[ *i* ].
4105 * \throw If the coordinates array is not set.
4106 * \throw If \a this->getMeshDimension() != \a this->getSpaceDimension().
4108 * \if ENABLE_EXAMPLES
4109 * \ref cpp_mcumesh_getCellsContainingPoints "Here is a C++ example".<br>
4110 * \ref py_mcumesh_getCellsContainingPoints "Here is a Python example".
4113 void MEDCouplingUMesh::getCellsContainingPoints(const double *pos, int nbOfPoints, double eps,
4114 MCAuto<DataArrayInt>& elts, MCAuto<DataArrayInt>& eltsIndex) const
4116 int spaceDim=getSpaceDimension();
4117 int mDim=getMeshDimension();
4122 const double *coords=_coords->getConstPointer();
4123 getCellsContainingPointsAlg<3>(coords,pos,nbOfPoints,eps,elts,eltsIndex);
4130 throw INTERP_KERNEL::Exception("For spaceDim==3 only meshDim==3 implemented for getelementscontainingpoints !");
4132 else if(spaceDim==2)
4136 const double *coords=_coords->getConstPointer();
4137 getCellsContainingPointsAlg<2>(coords,pos,nbOfPoints,eps,elts,eltsIndex);
4140 throw INTERP_KERNEL::Exception("For spaceDim==2 only meshDim==2 implemented for getelementscontainingpoints !");
4142 else if(spaceDim==1)
4146 const double *coords=_coords->getConstPointer();
4147 getCellsContainingPointsAlg<1>(coords,pos,nbOfPoints,eps,elts,eltsIndex);
4150 throw INTERP_KERNEL::Exception("For spaceDim==1 only meshDim==1 implemented for getelementscontainingpoints !");
4153 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getCellsContainingPoints : not managed for mdim not in [1,2,3] !");
4157 * Finds butterfly cells in \a this mesh. A 2D cell is considered to be butterfly if at
4158 * least two its edges intersect each other anywhere except their extremities. An
4159 * INTERP_KERNEL::NORM_NORI3 cell can \b not be butterfly.
4160 * \param [in,out] cells - a vector returning ids of the found cells. It is not
4161 * cleared before filling in.
4162 * \param [in] eps - precision.
4163 * \throw If \a this->getMeshDimension() != 2.
4164 * \throw If \a this->getSpaceDimension() != 2 && \a this->getSpaceDimension() != 3.
4166 void MEDCouplingUMesh::checkButterflyCells(std::vector<int>& cells, double eps) const
4168 const char msg[]="Butterfly detection work only for 2D cells with spaceDim==2 or 3!";
4169 if(getMeshDimension()!=2)
4170 throw INTERP_KERNEL::Exception(msg);
4171 int spaceDim=getSpaceDimension();
4172 if(spaceDim!=2 && spaceDim!=3)
4173 throw INTERP_KERNEL::Exception(msg);
4174 const int *conn=_nodal_connec->getConstPointer();
4175 const int *connI=_nodal_connec_index->getConstPointer();
4176 int nbOfCells=getNumberOfCells();
4177 std::vector<double> cell2DinS2;
4178 for(int i=0;i<nbOfCells;i++)
4180 int offset=connI[i];
4181 int nbOfNodesForCell=connI[i+1]-offset-1;
4182 if(nbOfNodesForCell<=3)
4184 bool isQuad=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[offset]).isQuadratic();
4185 project2DCellOnXY(conn+offset+1,conn+connI[i+1],cell2DinS2);
4186 if(isButterfly2DCell(cell2DinS2,isQuad,eps))
4193 * This method is typically requested to unbutterfly 2D linear cells in \b this.
4195 * This method expects that space dimension is equal to 2 and mesh dimension is equal to 2 too. If it is not the case an INTERP_KERNEL::Exception will be thrown.
4196 * This method works only for linear 2D cells. If there is any of non linear cells (INTERP_KERNEL::NORM_QUAD8 for example) an INTERP_KERNEL::Exception will be thrown too.
4198 * For each 2D linear cell in \b this, this method builds the convex envelop (or the convex hull) of the current cell.
4199 * This convex envelop is computed using Jarvis march algorithm.
4200 * The coordinates and the number of cells of \b this remain unchanged on invocation of this method.
4201 * Only connectivity of some cells could be modified if those cells were not representing a convex envelop. If a cell already equals its convex envelop (regardless orientation)
4202 * its connectivity will remain unchanged. If the computation leads to a modification of nodal connectivity of a cell its geometric type will be modified to INTERP_KERNEL::NORM_POLYGON.
4204 * \return a newly allocated array containing cellIds that have been modified if any. If no cells have been impacted by this method NULL is returned.
4205 * \sa MEDCouplingUMesh::colinearize2D
4207 DataArrayInt *MEDCouplingUMesh::convexEnvelop2D()
4209 if(getMeshDimension()!=2 || getSpaceDimension()!=2)
4210 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convexEnvelop2D works only for meshDim=2 and spaceDim=2 !");
4211 checkFullyDefined();
4212 const double *coords=getCoords()->getConstPointer();
4213 int nbOfCells=getNumberOfCells();
4214 MCAuto<DataArrayInt> nodalConnecIndexOut=DataArrayInt::New();
4215 nodalConnecIndexOut->alloc(nbOfCells+1,1);
4216 MCAuto<DataArrayInt> nodalConnecOut(DataArrayInt::New());
4217 int *workIndexOut=nodalConnecIndexOut->getPointer();
4219 const int *nodalConnecIn=_nodal_connec->getConstPointer();
4220 const int *nodalConnecIndexIn=_nodal_connec_index->getConstPointer();
4221 std::set<INTERP_KERNEL::NormalizedCellType> types;
4222 MCAuto<DataArrayInt> isChanged(DataArrayInt::New());
4223 isChanged->alloc(0,1);
4224 for(int i=0;i<nbOfCells;i++,workIndexOut++)
4226 int pos=nodalConnecOut->getNumberOfTuples();
4227 if(BuildConvexEnvelopOf2DCellJarvis(coords,nodalConnecIn+nodalConnecIndexIn[i],nodalConnecIn+nodalConnecIndexIn[i+1],nodalConnecOut))
4228 isChanged->pushBackSilent(i);
4229 types.insert((INTERP_KERNEL::NormalizedCellType)nodalConnecOut->getIJ(pos,0));
4230 workIndexOut[1]=nodalConnecOut->getNumberOfTuples();
4232 if(isChanged->empty())
4234 setConnectivity(nodalConnecOut,nodalConnecIndexOut,false);
4236 return isChanged.retn();
4240 * This method is \b NOT const because it can modify \a this.
4241 * \a this is expected to be an unstructured mesh with meshDim==2 and spaceDim==3. If not an exception will be thrown.
4242 * \param mesh1D is an unstructured mesh with MeshDim==1 and spaceDim==3. If not an exception will be thrown.
4243 * \param policy specifies the type of extrusion chosen:
4244 * - \b 0 for translation only (most simple): the cells of the 1D mesh represent the vectors along which the 2D mesh
4245 * will be repeated to build each level
4246 * - \b 1 for translation and rotation: the translation is done as above. For each level, an arc of circle is fitted on
4247 * the 3 preceding points of the 1D mesh. The center of the arc is the center of rotation for each level, the rotation is done
4248 * along an axis normal to the plane containing the arc, and finally the angle of rotation is defined by the first two points on the
4250 * \return an unstructured mesh with meshDim==3 and spaceDim==3. The returned mesh has the same coords than \a this.
4252 MEDCouplingUMesh *MEDCouplingUMesh::buildExtrudedMesh(const MEDCouplingUMesh *mesh1D, int policy)
4254 checkFullyDefined();
4255 mesh1D->checkFullyDefined();
4256 if(!mesh1D->isContiguous1D())
4257 throw INTERP_KERNEL::Exception("buildExtrudedMesh : 1D mesh passed in parameter is not contiguous !");
4258 if(getSpaceDimension()!=mesh1D->getSpaceDimension())
4259 throw INTERP_KERNEL::Exception("Invalid call to buildExtrudedMesh this and mesh1D must have same space dimension !");
4260 if((getMeshDimension()!=2 || getSpaceDimension()!=3) && (getMeshDimension()!=1 || getSpaceDimension()!=2))
4261 throw INTERP_KERNEL::Exception("Invalid 'this' for buildExtrudedMesh method : must be (meshDim==2 and spaceDim==3) or (meshDim==1 and spaceDim==2) !");
4262 if(mesh1D->getMeshDimension()!=1)
4263 throw INTERP_KERNEL::Exception("Invalid 'mesh1D' for buildExtrudedMesh method : must be meshDim==1 !");
4265 if(isPresenceOfQuadratic())
4267 if(mesh1D->isFullyQuadratic())
4270 throw INTERP_KERNEL::Exception("Invalid 2D mesh and 1D mesh because 2D mesh has quadratic cells and 1D is not fully quadratic !");
4272 int oldNbOfNodes(getNumberOfNodes());
4273 MCAuto<DataArrayDouble> newCoords;
4278 newCoords=fillExtCoordsUsingTranslation(mesh1D,isQuad);
4283 newCoords=fillExtCoordsUsingTranslAndAutoRotation(mesh1D,isQuad);
4287 throw INTERP_KERNEL::Exception("Not implemented extrusion policy : must be in (0) !");
4289 setCoords(newCoords);
4290 MCAuto<MEDCouplingUMesh> ret(buildExtrudedMeshFromThisLowLev(oldNbOfNodes,isQuad));
4297 * Checks if \a this mesh is constituted by only quadratic cells.
4298 * \return bool - \c true if there are only quadratic cells in \a this mesh.
4299 * \throw If the coordinates array is not set.
4300 * \throw If the nodal connectivity of cells is not defined.
4302 bool MEDCouplingUMesh::isFullyQuadratic() const
4304 checkFullyDefined();
4306 int nbOfCells=getNumberOfCells();
4307 for(int i=0;i<nbOfCells && ret;i++)
4309 INTERP_KERNEL::NormalizedCellType type=getTypeOfCell(i);
4310 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(type);
4311 ret=cm.isQuadratic();
4317 * Checks if \a this mesh includes any quadratic cell.
4318 * \return bool - \c true if there is at least one quadratic cells in \a this mesh.
4319 * \throw If the coordinates array is not set.
4320 * \throw If the nodal connectivity of cells is not defined.
4322 bool MEDCouplingUMesh::isPresenceOfQuadratic() const
4324 checkFullyDefined();
4326 int nbOfCells=getNumberOfCells();
4327 for(int i=0;i<nbOfCells && !ret;i++)
4329 INTERP_KERNEL::NormalizedCellType type=getTypeOfCell(i);
4330 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(type);
4331 ret=cm.isQuadratic();
4337 * Converts all quadratic cells to linear ones. If there are no quadratic cells in \a
4338 * this mesh, it remains unchanged.
4339 * \throw If the coordinates array is not set.
4340 * \throw If the nodal connectivity of cells is not defined.
4342 void MEDCouplingUMesh::convertQuadraticCellsToLinear()
4344 checkFullyDefined();
4345 int nbOfCells(getNumberOfCells());
4347 const int *iciptr=_nodal_connec_index->begin();
4348 for(int i=0;i<nbOfCells;i++)
4350 INTERP_KERNEL::NormalizedCellType type=getTypeOfCell(i);
4351 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(type);
4352 if(cm.isQuadratic())
4354 INTERP_KERNEL::NormalizedCellType typel=cm.getLinearType();
4355 const INTERP_KERNEL::CellModel& cml=INTERP_KERNEL::CellModel::GetCellModel(typel);
4356 if(!cml.isDynamic())
4357 delta+=cm.getNumberOfNodes()-cml.getNumberOfNodes();
4359 delta+=(iciptr[i+1]-iciptr[i]-1)/2;
4364 MCAuto<DataArrayInt> newConn(DataArrayInt::New()),newConnI(DataArrayInt::New());
4365 const int *icptr(_nodal_connec->begin());
4366 newConn->alloc(getNodalConnectivityArrayLen()-delta,1);
4367 newConnI->alloc(nbOfCells+1,1);
4368 int *ocptr(newConn->getPointer()),*ociptr(newConnI->getPointer());
4371 for(int i=0;i<nbOfCells;i++,ociptr++)
4373 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)icptr[iciptr[i]];
4374 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(type);
4375 if(!cm.isQuadratic())
4377 _types.insert(type);
4378 ocptr=std::copy(icptr+iciptr[i],icptr+iciptr[i+1],ocptr);
4379 ociptr[1]=ociptr[0]+iciptr[i+1]-iciptr[i];
4383 INTERP_KERNEL::NormalizedCellType typel=cm.getLinearType();
4384 _types.insert(typel);
4385 const INTERP_KERNEL::CellModel& cml=INTERP_KERNEL::CellModel::GetCellModel(typel);
4386 int newNbOfNodes=cml.getNumberOfNodes();
4388 newNbOfNodes=(iciptr[i+1]-iciptr[i]-1)/2;
4389 *ocptr++=(int)typel;
4390 ocptr=std::copy(icptr+iciptr[i]+1,icptr+iciptr[i]+newNbOfNodes+1,ocptr);
4391 ociptr[1]=ociptr[0]+newNbOfNodes+1;
4394 setConnectivity(newConn,newConnI,false);
4398 * This method converts all linear cell in \a this to quadratic one.
4399 * Contrary to MEDCouplingUMesh::convertQuadraticCellsToLinear method, here it is needed to specify the target
4400 * type of cells expected. For example INTERP_KERNEL::NORM_TRI3 can be converted to INTERP_KERNEL::NORM_TRI6 if \a conversionType is equal to 0 (the default)
4401 * or to INTERP_KERNEL::NORM_TRI7 if \a conversionType is equal to 1. All non linear cells and polyhedron in \a this are let untouched.
4402 * Contrary to MEDCouplingUMesh::convertQuadraticCellsToLinear method, the coordinates in \a this can be become bigger. All created nodes will be put at the
4403 * end of the existing coordinates.
4405 * \param [in] conversionType specifies the type of conversion expected. Only 0 (default) and 1 are supported presently. 0 those that creates the 'most' simple
4406 * corresponding quadratic cells. 1 is those creating the 'most' complex.
4407 * \return a newly created DataArrayInt instance that the caller should deal with containing cell ids of converted cells.
4409 * \throw if \a this is not fully defined. It throws too if \a conversionType is not in [0,1].
4411 * \sa MEDCouplingUMesh::convertQuadraticCellsToLinear
4413 DataArrayInt *MEDCouplingUMesh::convertLinearCellsToQuadratic(int conversionType)
4415 DataArrayInt *conn=0,*connI=0;
4416 DataArrayDouble *coords=0;
4417 std::set<INTERP_KERNEL::NormalizedCellType> types;
4418 checkFullyDefined();
4419 MCAuto<DataArrayInt> ret,connSafe,connISafe;
4420 MCAuto<DataArrayDouble> coordsSafe;
4421 int meshDim=getMeshDimension();
4422 switch(conversionType)
4428 ret=convertLinearCellsToQuadratic1D0(conn,connI,coords,types);
4429 connSafe=conn; connISafe=connI; coordsSafe=coords;
4432 ret=convertLinearCellsToQuadratic2D0(conn,connI,coords,types);
4433 connSafe=conn; connISafe=connI; coordsSafe=coords;
4436 ret=convertLinearCellsToQuadratic3D0(conn,connI,coords,types);
4437 connSafe=conn; connISafe=connI; coordsSafe=coords;
4440 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertLinearCellsToQuadratic : conversion of type 0 mesh dimensions available are [1,2,3] !");
4448 ret=convertLinearCellsToQuadratic1D0(conn,connI,coords,types);//it is not a bug. In 1D policy 0 and 1 are equals
4449 connSafe=conn; connISafe=connI; coordsSafe=coords;
4452 ret=convertLinearCellsToQuadratic2D1(conn,connI,coords,types);
4453 connSafe=conn; connISafe=connI; coordsSafe=coords;
4456 ret=convertLinearCellsToQuadratic3D1(conn,connI,coords,types);
4457 connSafe=conn; connISafe=connI; coordsSafe=coords;
4460 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertLinearCellsToQuadratic : conversion of type 1 mesh dimensions available are [1,2,3] !");
4465 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertLinearCellsToQuadratic : conversion type available are 0 (default, the simplest) and 1 (the most complex) !");
4467 setConnectivity(connSafe,connISafe,false);
4469 setCoords(coordsSafe);
4474 * Tessellates \a this 2D mesh by dividing not straight edges of quadratic faces,
4475 * so that the number of cells remains the same. Quadratic faces are converted to
4476 * polygons. This method works only for 2D meshes in
4477 * 2D space. If no cells are quadratic (INTERP_KERNEL::NORM_QUAD8,
4478 * INTERP_KERNEL::NORM_TRI6, INTERP_KERNEL::NORM_QPOLYG ), \a this mesh remains unchanged.
4479 * \warning This method can lead to a huge amount of nodes if \a eps is very low.
4480 * \param [in] eps - specifies the maximal angle (in radians) between 2 sub-edges of
4481 * a polylinized edge constituting the input polygon.
4482 * \throw If the coordinates array is not set.
4483 * \throw If the nodal connectivity of cells is not defined.
4484 * \throw If \a this->getMeshDimension() != 2.
4485 * \throw If \a this->getSpaceDimension() != 2.
4487 void MEDCouplingUMesh::tessellate2D(double eps)
4489 int meshDim(getMeshDimension()),spaceDim(getSpaceDimension());
4491 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::tessellate2D : works only with space dimension equal to 2 !");
4495 return tessellate2DCurveInternal(eps);
4497 return tessellate2DInternal(eps);
4499 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::tessellate2D : mesh dimension must be in [1,2] !");
4503 * Tessellates \a this 1D mesh in 2D space by dividing not straight quadratic edges.
4504 * \warning This method can lead to a huge amount of nodes if \a eps is very low.
4505 * \param [in] eps - specifies the maximal angle (in radian) between 2 sub-edges of
4506 * a sub-divided edge.
4507 * \throw If the coordinates array is not set.
4508 * \throw If the nodal connectivity of cells is not defined.
4509 * \throw If \a this->getMeshDimension() != 1.
4510 * \throw If \a this->getSpaceDimension() != 2.
4515 * This method only works if \a this has spaceDimension equal to 2 and meshDimension also equal to 2.
4516 * This method allows to modify connectivity of cells in \a this that shares some edges in \a edgeIdsToBeSplit.
4517 * The nodes to be added in those 2D cells are defined by the pair of \a nodeIdsToAdd and \a nodeIdsIndexToAdd.
4518 * Length of \a nodeIdsIndexToAdd is expected to equal to length of \a edgeIdsToBeSplit + 1.
4519 * The node ids in \a nodeIdsToAdd should be valid. Those nodes have to be sorted exactly following exactly the direction of the edge.
4520 * This method can be seen as the opposite method of colinearize2D.
4521 * This method can be lead to create some new nodes if quadratic polygon cells have to be split. In this case the added nodes will be put at the end
4522 * to avoid to modify the numbering of existing nodes.
4524 * \param [in] nodeIdsToAdd - the list of node ids to be added (\a nodeIdsIndexToAdd array allows to walk on this array)
4525 * \param [in] nodeIdsIndexToAdd - the entry point of \a nodeIdsToAdd to point to the corresponding nodes to be added.
4526 * \param [in] mesh1Desc - 1st output of buildDescendingConnectivity2 on \a this.
4527 * \param [in] desc - 2nd output of buildDescendingConnectivity2 on \a this.
4528 * \param [in] descI - 3rd output of buildDescendingConnectivity2 on \a this.
4529 * \param [in] revDesc - 4th output of buildDescendingConnectivity2 on \a this.
4530 * \param [in] revDescI - 5th output of buildDescendingConnectivity2 on \a this.
4532 * \sa buildDescendingConnectivity2
4534 void MEDCouplingUMesh::splitSomeEdgesOf2DMesh(const DataArrayInt *nodeIdsToAdd, const DataArrayInt *nodeIdsIndexToAdd, const DataArrayInt *edgeIdsToBeSplit,
4535 const MEDCouplingUMesh *mesh1Desc, const DataArrayInt *desc, const DataArrayInt *descI, const DataArrayInt *revDesc, const DataArrayInt *revDescI)
4537 if(!nodeIdsToAdd || !nodeIdsIndexToAdd || !edgeIdsToBeSplit || !mesh1Desc || !desc || !descI || !revDesc || !revDescI)
4538 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::splitSomeEdgesOf2DMesh : input pointers must be not NULL !");
4539 nodeIdsToAdd->checkAllocated(); nodeIdsIndexToAdd->checkAllocated(); edgeIdsToBeSplit->checkAllocated(); desc->checkAllocated(); descI->checkAllocated(); revDesc->checkAllocated(); revDescI->checkAllocated();
4540 if(getSpaceDimension()!=2 || getMeshDimension()!=2)
4541 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::splitSomeEdgesOf2DMesh : this must have spacedim=meshdim=2 !");
4542 if(mesh1Desc->getSpaceDimension()!=2 || mesh1Desc->getMeshDimension()!=1)
4543 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::splitSomeEdgesOf2DMesh : mesh1Desc must be the explosion of this with spaceDim=2 and meshDim = 1 !");
4544 //DataArrayInt *out0(0),*outi0(0);
4545 //MEDCouplingUMesh::ExtractFromIndexedArrays(idsInDesc2DToBeRefined->begin(),idsInDesc2DToBeRefined->end(),dd3,dd4,out0,outi0);
4546 //MCAuto<DataArrayInt> out0s(out0),outi0s(outi0);
4547 //out0s=out0s->buildUnique(); out0s->sort(true);
4553 * Divides every cell of \a this mesh into simplices (triangles in 2D and tetrahedra in 3D).
4554 * In addition, returns an array mapping new cells to old ones. <br>
4555 * This method typically increases the number of cells in \a this mesh
4556 * but the number of nodes remains \b unchanged.
4557 * That's why the 3D splitting policies
4558 * INTERP_KERNEL::GENERAL_24 and INTERP_KERNEL::GENERAL_48 are not available here.
4559 * \param [in] policy - specifies a pattern used for splitting.
4560 * The semantic of \a policy is:
4561 * - 0 - to split QUAD4 by cutting it along 0-2 diagonal (for 2D mesh only).
4562 * - 1 - to split QUAD4 by cutting it along 1-3 diagonal (for 2D mesh only).
4563 * - INTERP_KERNEL::PLANAR_FACE_5 - to split HEXA8 into 5 TETRA4 (for 3D mesh only - see INTERP_KERNEL::SplittingPolicy for an image).
4564 * - INTERP_KERNEL::PLANAR_FACE_6 - to split HEXA8 into 6 TETRA4 (for 3D mesh only - see INTERP_KERNEL::SplittingPolicy for an image).
4567 * \return DataArrayInt * - a new instance of DataArrayInt holding, for each new cell,
4568 * an id of old cell producing it. The caller is to delete this array using
4569 * decrRef() as it is no more needed.
4571 * \throw If \a policy is 0 or 1 and \a this->getMeshDimension() != 2.
4572 * \throw If \a policy is INTERP_KERNEL::PLANAR_FACE_5 or INTERP_KERNEL::PLANAR_FACE_6
4573 * and \a this->getMeshDimension() != 3.
4574 * \throw If \a policy is not one of the four discussed above.
4575 * \throw If the nodal connectivity of cells is not defined.
4576 * \sa MEDCouplingUMesh::tetrahedrize, MEDCoupling1SGTUMesh::sortHexa8EachOther
4578 DataArrayInt *MEDCouplingUMesh::simplexize(int policy)
4583 return simplexizePol0();
4585 return simplexizePol1();
4586 case (int) INTERP_KERNEL::PLANAR_FACE_5:
4587 return simplexizePlanarFace5();
4588 case (int) INTERP_KERNEL::PLANAR_FACE_6:
4589 return simplexizePlanarFace6();
4591 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::simplexize : unrecognized policy ! Must be :\n - 0 or 1 (only available for meshdim=2) \n - PLANAR_FACE_5, PLANAR_FACE_6 (only for meshdim=3)");
4596 * Checks if \a this mesh is constituted by simplex cells only. Simplex cells are:
4597 * - 1D: INTERP_KERNEL::NORM_SEG2
4598 * - 2D: INTERP_KERNEL::NORM_TRI3
4599 * - 3D: INTERP_KERNEL::NORM_TETRA4.
4601 * This method is useful for users that need to use P1 field services as
4602 * MEDCouplingFieldDouble::getValueOn(), MEDCouplingField::buildMeasureField() etc.
4603 * All these methods need mesh support containing only simplex cells.
4604 * \return bool - \c true if there are only simplex cells in \a this mesh.
4605 * \throw If the coordinates array is not set.
4606 * \throw If the nodal connectivity of cells is not defined.
4607 * \throw If \a this->getMeshDimension() < 1.
4609 bool MEDCouplingUMesh::areOnlySimplexCells() const
4611 checkFullyDefined();
4612 int mdim=getMeshDimension();
4613 if(mdim<1 || mdim>3)
4614 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::areOnlySimplexCells : only available with meshes having a meshdim 1, 2 or 3 !");
4615 int nbCells=getNumberOfCells();
4616 const int *conn=_nodal_connec->begin();
4617 const int *connI=_nodal_connec_index->begin();
4618 for(int i=0;i<nbCells;i++)
4620 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[connI[i]]);
4630 * Converts degenerated 2D or 3D linear cells of \a this mesh into cells of simpler
4631 * type. For example an INTERP_KERNEL::NORM_QUAD4 cell having only three unique nodes in
4632 * its connectivity is transformed into an INTERP_KERNEL::NORM_TRI3 cell. This method
4633 * does \b not perform geometrical checks and checks only nodal connectivity of cells,
4634 * so it can be useful to call mergeNodes() before calling this method.
4635 * \throw If \a this->getMeshDimension() <= 1.
4636 * \throw If the coordinates array is not set.
4637 * \throw If the nodal connectivity of cells is not defined.
4639 void MEDCouplingUMesh::convertDegeneratedCells()
4641 checkFullyDefined();
4642 if(getMeshDimension()<=1)
4643 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertDegeneratedCells works on umeshes with meshdim equals to 2 or 3 !");
4644 int nbOfCells=getNumberOfCells();
4647 int initMeshLgth=getNodalConnectivityArrayLen();
4648 int *conn=_nodal_connec->getPointer();
4649 int *index=_nodal_connec_index->getPointer();
4653 for(int i=0;i<nbOfCells;i++)
4655 lgthOfCurCell=index[i+1]-posOfCurCell;
4656 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)conn[posOfCurCell];
4658 INTERP_KERNEL::NormalizedCellType newType=INTERP_KERNEL::CellSimplify::simplifyDegeneratedCell(type,conn+posOfCurCell+1,lgthOfCurCell-1,
4659 conn+newPos+1,newLgth);
4660 conn[newPos]=newType;
4662 posOfCurCell=index[i+1];
4665 if(newPos!=initMeshLgth)
4666 _nodal_connec->reAlloc(newPos);
4671 * Finds incorrectly oriented cells of this 2D mesh in 3D space.
4672 * A cell is considered to be oriented correctly if an angle between its
4673 * normal vector and a given vector is less than \c PI / \c 2.
4674 * \param [in] vec - 3 components of the vector specifying the correct orientation of
4676 * \param [in] polyOnly - if \c true, only polygons are checked, else, all cells are
4678 * \param [in,out] cells - a vector returning ids of incorrectly oriented cells. It
4679 * is not cleared before filling in.
4680 * \throw If \a this->getMeshDimension() != 2.
4681 * \throw If \a this->getSpaceDimension() != 3.
4683 * \if ENABLE_EXAMPLES
4684 * \ref cpp_mcumesh_are2DCellsNotCorrectlyOriented "Here is a C++ example".<br>
4685 * \ref py_mcumesh_are2DCellsNotCorrectlyOriented "Here is a Python example".
4688 void MEDCouplingUMesh::are2DCellsNotCorrectlyOriented(const double *vec, bool polyOnly, std::vector<int>& cells) const
4690 if(getMeshDimension()!=2 || getSpaceDimension()!=3)
4691 throw INTERP_KERNEL::Exception("Invalid mesh to apply are2DCellsNotCorrectlyOriented on it : must be meshDim==2 and spaceDim==3 !");
4692 int nbOfCells=getNumberOfCells();
4693 const int *conn=_nodal_connec->begin();
4694 const int *connI=_nodal_connec_index->begin();
4695 const double *coordsPtr=_coords->begin();
4696 for(int i=0;i<nbOfCells;i++)
4698 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)conn[connI[i]];
4699 if(!polyOnly || (type==INTERP_KERNEL::NORM_POLYGON || type==INTERP_KERNEL::NORM_QPOLYG))
4701 bool isQuadratic=INTERP_KERNEL::CellModel::GetCellModel(type).isQuadratic();
4702 if(!IsPolygonWellOriented(isQuadratic,vec,conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4709 * Reverse connectivity of 2D cells whose orientation is not correct. A cell is
4710 * considered to be oriented correctly if an angle between its normal vector and a
4711 * given vector is less than \c PI / \c 2.
4712 * \param [in] vec - 3 components of the vector specifying the correct orientation of
4714 * \param [in] polyOnly - if \c true, only polygons are checked, else, all cells are
4716 * \throw If \a this->getMeshDimension() != 2.
4717 * \throw If \a this->getSpaceDimension() != 3.
4719 * \if ENABLE_EXAMPLES
4720 * \ref cpp_mcumesh_are2DCellsNotCorrectlyOriented "Here is a C++ example".<br>
4721 * \ref py_mcumesh_are2DCellsNotCorrectlyOriented "Here is a Python example".
4724 * \sa changeOrientationOfCells
4726 void MEDCouplingUMesh::orientCorrectly2DCells(const double *vec, bool polyOnly)
4728 if(getMeshDimension()!=2 || getSpaceDimension()!=3)
4729 throw INTERP_KERNEL::Exception("Invalid mesh to apply orientCorrectly2DCells on it : must be meshDim==2 and spaceDim==3 !");
4730 int nbOfCells(getNumberOfCells()),*conn(_nodal_connec->getPointer());
4731 const int *connI(_nodal_connec_index->begin());
4732 const double *coordsPtr(_coords->begin());
4733 bool isModified(false);
4734 for(int i=0;i<nbOfCells;i++)
4736 INTERP_KERNEL::NormalizedCellType type((INTERP_KERNEL::NormalizedCellType)conn[connI[i]]);
4737 if(!polyOnly || (type==INTERP_KERNEL::NORM_POLYGON || type==INTERP_KERNEL::NORM_QPOLYG))
4739 const INTERP_KERNEL::CellModel& cm(INTERP_KERNEL::CellModel::GetCellModel(type));
4740 bool isQuadratic(cm.isQuadratic());
4741 if(!IsPolygonWellOriented(isQuadratic,vec,conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4744 cm.changeOrientationOf2D(conn+connI[i]+1,(unsigned int)(connI[i+1]-connI[i]-1));
4749 _nodal_connec->declareAsNew();
4754 * This method change the orientation of cells in \a this without any consideration of coordinates. Only connectivity is impacted.
4756 * \sa orientCorrectly2DCells
4758 void MEDCouplingUMesh::changeOrientationOfCells()
4760 int mdim(getMeshDimension());
4761 if(mdim!=2 && mdim!=1)
4762 throw INTERP_KERNEL::Exception("Invalid mesh to apply changeOrientationOfCells on it : must be meshDim==2 or meshDim==1 !");
4763 int nbOfCells(getNumberOfCells()),*conn(_nodal_connec->getPointer());
4764 const int *connI(_nodal_connec_index->begin());
4767 for(int i=0;i<nbOfCells;i++)
4769 INTERP_KERNEL::NormalizedCellType type((INTERP_KERNEL::NormalizedCellType)conn[connI[i]]);
4770 const INTERP_KERNEL::CellModel& cm(INTERP_KERNEL::CellModel::GetCellModel(type));
4771 cm.changeOrientationOf2D(conn+connI[i]+1,(unsigned int)(connI[i+1]-connI[i]-1));
4776 for(int i=0;i<nbOfCells;i++)
4778 INTERP_KERNEL::NormalizedCellType type((INTERP_KERNEL::NormalizedCellType)conn[connI[i]]);
4779 const INTERP_KERNEL::CellModel& cm(INTERP_KERNEL::CellModel::GetCellModel(type));
4780 cm.changeOrientationOf1D(conn+connI[i]+1,(unsigned int)(connI[i+1]-connI[i]-1));
4786 * Finds incorrectly oriented polyhedral cells, i.e. polyhedrons having correctly
4787 * oriented facets. The normal vector of the facet should point out of the cell.
4788 * \param [in,out] cells - a vector returning ids of incorrectly oriented cells. It
4789 * is not cleared before filling in.
4790 * \throw If \a this->getMeshDimension() != 3.
4791 * \throw If \a this->getSpaceDimension() != 3.
4792 * \throw If the coordinates array is not set.
4793 * \throw If the nodal connectivity of cells is not defined.
4795 * \if ENABLE_EXAMPLES
4796 * \ref cpp_mcumesh_arePolyhedronsNotCorrectlyOriented "Here is a C++ example".<br>
4797 * \ref py_mcumesh_arePolyhedronsNotCorrectlyOriented "Here is a Python example".
4800 void MEDCouplingUMesh::arePolyhedronsNotCorrectlyOriented(std::vector<int>& cells) const
4802 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
4803 throw INTERP_KERNEL::Exception("Invalid mesh to apply arePolyhedronsNotCorrectlyOriented on it : must be meshDim==3 and spaceDim==3 !");
4804 int nbOfCells=getNumberOfCells();
4805 const int *conn=_nodal_connec->begin();
4806 const int *connI=_nodal_connec_index->begin();
4807 const double *coordsPtr=_coords->begin();
4808 for(int i=0;i<nbOfCells;i++)
4810 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)conn[connI[i]];
4811 if(type==INTERP_KERNEL::NORM_POLYHED)
4813 if(!IsPolyhedronWellOriented(conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4820 * Tries to fix connectivity of polyhedra, so that normal vector of all facets to point
4822 * \throw If \a this->getMeshDimension() != 3.
4823 * \throw If \a this->getSpaceDimension() != 3.
4824 * \throw If the coordinates array is not set.
4825 * \throw If the nodal connectivity of cells is not defined.
4826 * \throw If the reparation fails.
4828 * \if ENABLE_EXAMPLES
4829 * \ref cpp_mcumesh_arePolyhedronsNotCorrectlyOriented "Here is a C++ example".<br>
4830 * \ref py_mcumesh_arePolyhedronsNotCorrectlyOriented "Here is a Python example".
4832 * \sa MEDCouplingUMesh::findAndCorrectBadOriented3DCells
4834 void MEDCouplingUMesh::orientCorrectlyPolyhedrons()
4836 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
4837 throw INTERP_KERNEL::Exception("Invalid mesh to apply orientCorrectlyPolyhedrons on it : must be meshDim==3 and spaceDim==3 !");
4838 int nbOfCells=getNumberOfCells();
4839 int *conn=_nodal_connec->getPointer();
4840 const int *connI=_nodal_connec_index->begin();
4841 const double *coordsPtr=_coords->begin();
4842 for(int i=0;i<nbOfCells;i++)
4844 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)conn[connI[i]];
4845 if(type==INTERP_KERNEL::NORM_POLYHED)
4849 if(!IsPolyhedronWellOriented(conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4850 TryToCorrectPolyhedronOrientation(conn+connI[i]+1,conn+connI[i+1],coordsPtr);
4852 catch(INTERP_KERNEL::Exception& e)
4854 std::ostringstream oss; oss << "Something wrong in polyhedron #" << i << " : " << e.what();
4855 throw INTERP_KERNEL::Exception(oss.str());
4863 * This method invert orientation of all cells in \a this.
4864 * After calling this method the absolute value of measure of cells in \a this are the same than before calling.
4865 * This method only operates on the connectivity so coordinates are not touched at all.
4867 void MEDCouplingUMesh::invertOrientationOfAllCells()
4869 checkConnectivityFullyDefined();
4870 std::set<INTERP_KERNEL::NormalizedCellType> gts(getAllGeoTypes());
4871 int *conn(_nodal_connec->getPointer());
4872 const int *conni(_nodal_connec_index->begin());
4873 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator gt=gts.begin();gt!=gts.end();gt++)
4875 INTERP_KERNEL::AutoCppPtr<INTERP_KERNEL::OrientationInverter> oi(INTERP_KERNEL::OrientationInverter::BuildInstanceFrom(*gt));
4876 MCAuto<DataArrayInt> cwt(giveCellsWithType(*gt));
4877 for(const int *it=cwt->begin();it!=cwt->end();it++)
4878 oi->operate(conn+conni[*it]+1,conn+conni[*it+1]);
4884 * Finds and fixes incorrectly oriented linear extruded volumes (INTERP_KERNEL::NORM_HEXA8,
4885 * INTERP_KERNEL::NORM_PENTA6, INTERP_KERNEL::NORM_HEXGP12 etc) to respect the MED convention
4886 * according to which the first facet of the cell should be oriented to have the normal vector
4887 * pointing out of cell.
4888 * \return DataArrayInt * - a new instance of DataArrayInt holding ids of fixed
4889 * cells. The caller is to delete this array using decrRef() as it is no more
4891 * \throw If \a this->getMeshDimension() != 3.
4892 * \throw If \a this->getSpaceDimension() != 3.
4893 * \throw If the coordinates array is not set.
4894 * \throw If the nodal connectivity of cells is not defined.
4896 * \if ENABLE_EXAMPLES
4897 * \ref cpp_mcumesh_findAndCorrectBadOriented3DExtrudedCells "Here is a C++ example".<br>
4898 * \ref py_mcumesh_findAndCorrectBadOriented3DExtrudedCells "Here is a Python example".
4900 * \sa MEDCouplingUMesh::findAndCorrectBadOriented3DCells
4902 DataArrayInt *MEDCouplingUMesh::findAndCorrectBadOriented3DExtrudedCells()
4904 const char msg[]="check3DCellsWellOriented detection works only for 3D cells !";
4905 if(getMeshDimension()!=3)
4906 throw INTERP_KERNEL::Exception(msg);
4907 int spaceDim=getSpaceDimension();
4909 throw INTERP_KERNEL::Exception(msg);
4911 int nbOfCells=getNumberOfCells();
4912 int *conn=_nodal_connec->getPointer();
4913 const int *connI=_nodal_connec_index->begin();
4914 const double *coo=getCoords()->begin();
4915 MCAuto<DataArrayInt> cells(DataArrayInt::New()); cells->alloc(0,1);
4916 for(int i=0;i<nbOfCells;i++)
4918 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[connI[i]]);
4919 if(cm.isExtruded() && !cm.isDynamic() && !cm.isQuadratic())
4921 if(!Is3DExtrudedStaticCellWellOriented(conn+connI[i]+1,conn+connI[i+1],coo))
4923 CorrectExtrudedStaticCell(conn+connI[i]+1,conn+connI[i+1]);
4924 cells->pushBackSilent(i);
4928 return cells.retn();
4932 * This method is a faster method to correct orientation of all 3D cells in \a this.
4933 * This method works only if \a this is a 3D mesh, that is to say a mesh with mesh dimension 3 and a space dimension 3.
4934 * This method makes the hypothesis that \a this a coherent that is to say MEDCouplingUMesh::checkConsistency should throw no exception.
4936 * \return a newly allocated int array with one components containing cell ids renumbered to fit the convention of MED (MED file and MEDCoupling)
4937 * \sa MEDCouplingUMesh::orientCorrectlyPolyhedrons,
4939 DataArrayInt *MEDCouplingUMesh::findAndCorrectBadOriented3DCells()
4941 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
4942 throw INTERP_KERNEL::Exception("Invalid mesh to apply findAndCorrectBadOriented3DCells on it : must be meshDim==3 and spaceDim==3 !");
4943 int nbOfCells=getNumberOfCells();
4944 int *conn=_nodal_connec->getPointer();
4945 const int *connI=_nodal_connec_index->begin();
4946 const double *coordsPtr=_coords->begin();
4947 MCAuto<DataArrayInt> ret=DataArrayInt::New(); ret->alloc(0,1);
4948 for(int i=0;i<nbOfCells;i++)
4950 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)conn[connI[i]];
4953 case INTERP_KERNEL::NORM_TETRA4:
4955 if(!IsTetra4WellOriented(conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4957 std::swap(*(conn+connI[i]+2),*(conn+connI[i]+3));
4958 ret->pushBackSilent(i);
4962 case INTERP_KERNEL::NORM_PYRA5:
4964 if(!IsPyra5WellOriented(conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4966 std::swap(*(conn+connI[i]+2),*(conn+connI[i]+4));
4967 ret->pushBackSilent(i);
4971 case INTERP_KERNEL::NORM_PENTA6:
4972 case INTERP_KERNEL::NORM_HEXA8:
4973 case INTERP_KERNEL::NORM_HEXGP12:
4975 if(!Is3DExtrudedStaticCellWellOriented(conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4977 CorrectExtrudedStaticCell(conn+connI[i]+1,conn+connI[i+1]);
4978 ret->pushBackSilent(i);
4982 case INTERP_KERNEL::NORM_POLYHED:
4984 if(!IsPolyhedronWellOriented(conn+connI[i]+1,conn+connI[i+1],coordsPtr))
4986 TryToCorrectPolyhedronOrientation(conn+connI[i]+1,conn+connI[i+1],coordsPtr);
4987 ret->pushBackSilent(i);
4992 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::orientCorrectly3DCells : Your mesh contains type of cell not supported yet ! send mail to anthony.geay@cea.fr to add it !");
5000 * This method has a sense for meshes with spaceDim==3 and meshDim==2.
5001 * If it is not the case an exception will be thrown.
5002 * This method is fast because the first cell of \a this is used to compute the plane.
5003 * \param vec output of size at least 3 used to store the normal vector (with norm equal to Area ) of searched plane.
5004 * \param pos output of size at least 3 used to store a point owned of searched plane.
5006 void MEDCouplingUMesh::getFastAveragePlaneOfThis(double *vec, double *pos) const
5008 if(getMeshDimension()!=2 || getSpaceDimension()!=3)
5009 throw INTERP_KERNEL::Exception("Invalid mesh to apply getFastAveragePlaneOfThis on it : must be meshDim==2 and spaceDim==3 !");
5010 const int *conn=_nodal_connec->begin();
5011 const int *connI=_nodal_connec_index->begin();
5012 const double *coordsPtr=_coords->begin();
5013 INTERP_KERNEL::areaVectorOfPolygon<int,INTERP_KERNEL::ALL_C_MODE>(conn+1,connI[1]-connI[0]-1,coordsPtr,vec);
5014 std::copy(coordsPtr+3*conn[1],coordsPtr+3*conn[1]+3,pos);
5018 * Creates a new MEDCouplingFieldDouble holding Edge Ratio values of all
5019 * cells. Currently cells of the following types are treated:
5020 * INTERP_KERNEL::NORM_TRI3, INTERP_KERNEL::NORM_QUAD4 and INTERP_KERNEL::NORM_TETRA4.
5021 * For a cell of other type an exception is thrown.
5022 * Space dimension of a 2D mesh can be either 2 or 3.
5023 * The Edge Ratio of a cell \f$t\f$ is:
5024 * \f$\frac{|t|_\infty}{|t|_0}\f$,
5025 * where \f$|t|_\infty\f$ and \f$|t|_0\f$ respectively denote the greatest and
5026 * the smallest edge lengths of \f$t\f$.
5027 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
5028 * cells and one time, lying on \a this mesh. The caller is to delete this
5029 * field using decrRef() as it is no more needed.
5030 * \throw If the coordinates array is not set.
5031 * \throw If \a this mesh contains elements of dimension different from the mesh dimension.
5032 * \throw If the connectivity data array has more than one component.
5033 * \throw If the connectivity data array has a named component.
5034 * \throw If the connectivity index data array has more than one component.
5035 * \throw If the connectivity index data array has a named component.
5036 * \throw If \a this->getMeshDimension() is neither 2 nor 3.
5037 * \throw If \a this->getSpaceDimension() is neither 2 nor 3.
5038 * \throw If \a this mesh includes cells of type different from the ones enumerated above.
5040 MEDCouplingFieldDouble *MEDCouplingUMesh::getEdgeRatioField() const
5042 checkConsistencyLight();
5043 int spaceDim=getSpaceDimension();
5044 int meshDim=getMeshDimension();
5045 if(spaceDim!=2 && spaceDim!=3)
5046 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getEdgeRatioField : SpaceDimension must be equal to 2 or 3 !");
5047 if(meshDim!=2 && meshDim!=3)
5048 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getEdgeRatioField : MeshDimension must be equal to 2 or 3 !");
5049 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
5051 int nbOfCells=getNumberOfCells();
5052 MCAuto<DataArrayDouble> arr=DataArrayDouble::New();
5053 arr->alloc(nbOfCells,1);
5054 double *pt=arr->getPointer();
5055 ret->setArray(arr);//In case of throw to avoid mem leaks arr will be used after decrRef.
5056 const int *conn=_nodal_connec->begin();
5057 const int *connI=_nodal_connec_index->begin();
5058 const double *coo=_coords->begin();
5060 for(int i=0;i<nbOfCells;i++,pt++)
5062 INTERP_KERNEL::NormalizedCellType t=(INTERP_KERNEL::NormalizedCellType)*conn;
5065 case INTERP_KERNEL::NORM_TRI3:
5067 FillInCompact3DMode(spaceDim,3,conn+1,coo,tmp);
5068 *pt=INTERP_KERNEL::triEdgeRatio(tmp);
5071 case INTERP_KERNEL::NORM_QUAD4:
5073 FillInCompact3DMode(spaceDim,4,conn+1,coo,tmp);
5074 *pt=INTERP_KERNEL::quadEdgeRatio(tmp);
5077 case INTERP_KERNEL::NORM_TETRA4:
5079 FillInCompact3DMode(spaceDim,4,conn+1,coo,tmp);
5080 *pt=INTERP_KERNEL::tetraEdgeRatio(tmp);
5084 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getEdgeRatioField : A cell with not manged type (NORM_TRI3, NORM_QUAD4 and NORM_TETRA4) has been detected !");
5086 conn+=connI[i+1]-connI[i];
5088 ret->setName("EdgeRatio");
5089 ret->synchronizeTimeWithSupport();
5094 * Creates a new MEDCouplingFieldDouble holding Aspect Ratio values of all
5095 * cells. Currently cells of the following types are treated:
5096 * INTERP_KERNEL::NORM_TRI3, INTERP_KERNEL::NORM_QUAD4 and INTERP_KERNEL::NORM_TETRA4.
5097 * For a cell of other type an exception is thrown.
5098 * Space dimension of a 2D mesh can be either 2 or 3.
5099 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
5100 * cells and one time, lying on \a this mesh. The caller is to delete this
5101 * field using decrRef() as it is no more needed.
5102 * \throw If the coordinates array is not set.
5103 * \throw If \a this mesh contains elements of dimension different from the mesh dimension.
5104 * \throw If the connectivity data array has more than one component.
5105 * \throw If the connectivity data array has a named component.
5106 * \throw If the connectivity index data array has more than one component.
5107 * \throw If the connectivity index data array has a named component.
5108 * \throw If \a this->getMeshDimension() is neither 2 nor 3.
5109 * \throw If \a this->getSpaceDimension() is neither 2 nor 3.
5110 * \throw If \a this mesh includes cells of type different from the ones enumerated above.
5112 MEDCouplingFieldDouble *MEDCouplingUMesh::getAspectRatioField() const
5114 checkConsistencyLight();
5115 int spaceDim=getSpaceDimension();
5116 int meshDim=getMeshDimension();
5117 if(spaceDim!=2 && spaceDim!=3)
5118 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getAspectRatioField : SpaceDimension must be equal to 2 or 3 !");
5119 if(meshDim!=2 && meshDim!=3)
5120 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getAspectRatioField : MeshDimension must be equal to 2 or 3 !");
5121 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
5123 int nbOfCells=getNumberOfCells();
5124 MCAuto<DataArrayDouble> arr=DataArrayDouble::New();
5125 arr->alloc(nbOfCells,1);
5126 double *pt=arr->getPointer();
5127 ret->setArray(arr);//In case of throw to avoid mem leaks arr will be used after decrRef.
5128 const int *conn=_nodal_connec->begin();
5129 const int *connI=_nodal_connec_index->begin();
5130 const double *coo=_coords->begin();
5132 for(int i=0;i<nbOfCells;i++,pt++)
5134 INTERP_KERNEL::NormalizedCellType t=(INTERP_KERNEL::NormalizedCellType)*conn;
5137 case INTERP_KERNEL::NORM_TRI3:
5139 FillInCompact3DMode(spaceDim,3,conn+1,coo,tmp);
5140 *pt=INTERP_KERNEL::triAspectRatio(tmp);
5143 case INTERP_KERNEL::NORM_QUAD4:
5145 FillInCompact3DMode(spaceDim,4,conn+1,coo,tmp);
5146 *pt=INTERP_KERNEL::quadAspectRatio(tmp);
5149 case INTERP_KERNEL::NORM_TETRA4:
5151 FillInCompact3DMode(spaceDim,4,conn+1,coo,tmp);
5152 *pt=INTERP_KERNEL::tetraAspectRatio(tmp);
5156 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getAspectRatioField : A cell with not manged type (NORM_TRI3, NORM_QUAD4 and NORM_TETRA4) has been detected !");
5158 conn+=connI[i+1]-connI[i];
5160 ret->setName("AspectRatio");
5161 ret->synchronizeTimeWithSupport();
5166 * Creates a new MEDCouplingFieldDouble holding Warping factor values of all
5167 * cells of \a this 2D mesh in 3D space. It is a measure of the "planarity" of 2D cell
5168 * in 3D space. Currently only cells of the following types are
5169 * treated: INTERP_KERNEL::NORM_QUAD4.
5170 * For a cell of other type an exception is thrown.
5171 * The warp field is computed as follows: let (a,b,c,d) be the points of the quad.
5173 * \f$t=\vec{da}\times\vec{ab}\f$,
5174 * \f$u=\vec{ab}\times\vec{bc}\f$
5175 * \f$v=\vec{bc}\times\vec{cd}\f$
5176 * \f$w=\vec{cd}\times\vec{da}\f$, the warp is defined as \f$W^3\f$ with
5178 * W=min(\frac{t}{|t|}\cdot\frac{v}{|v|}, \frac{u}{|u|}\cdot\frac{w}{|w|})
5180 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
5181 * cells and one time, lying on \a this mesh. The caller is to delete this
5182 * field using decrRef() as it is no more needed.
5183 * \throw If the coordinates array is not set.
5184 * \throw If \a this mesh contains elements of dimension different from the mesh dimension.
5185 * \throw If the connectivity data array has more than one component.
5186 * \throw If the connectivity data array has a named component.
5187 * \throw If the connectivity index data array has more than one component.
5188 * \throw If the connectivity index data array has a named component.
5189 * \throw If \a this->getMeshDimension() != 2.
5190 * \throw If \a this->getSpaceDimension() != 3.
5191 * \throw If \a this mesh includes cells of type different from the ones enumerated above.
5193 MEDCouplingFieldDouble *MEDCouplingUMesh::getWarpField() const
5195 checkConsistencyLight();
5196 int spaceDim=getSpaceDimension();
5197 int meshDim=getMeshDimension();
5199 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getWarpField : SpaceDimension must be equal to 3 !");
5201 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getWarpField : MeshDimension must be equal to 2 !");
5202 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
5204 int nbOfCells=getNumberOfCells();
5205 MCAuto<DataArrayDouble> arr=DataArrayDouble::New();
5206 arr->alloc(nbOfCells,1);
5207 double *pt=arr->getPointer();
5208 ret->setArray(arr);//In case of throw to avoid mem leaks arr will be used after decrRef.
5209 const int *conn=_nodal_connec->begin();
5210 const int *connI=_nodal_connec_index->begin();
5211 const double *coo=_coords->begin();
5213 for(int i=0;i<nbOfCells;i++,pt++)
5215 INTERP_KERNEL::NormalizedCellType t=(INTERP_KERNEL::NormalizedCellType)*conn;
5218 case INTERP_KERNEL::NORM_QUAD4:
5220 FillInCompact3DMode(3,4,conn+1,coo,tmp);
5221 *pt=INTERP_KERNEL::quadWarp(tmp);
5225 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getWarpField : A cell with not manged type (NORM_QUAD4) has been detected !");
5227 conn+=connI[i+1]-connI[i];
5229 ret->setName("Warp");
5230 ret->synchronizeTimeWithSupport();
5236 * Creates a new MEDCouplingFieldDouble holding Skew factor values of all
5237 * cells of \a this 2D mesh in 3D space. Currently cells of the following types are
5238 * treated: INTERP_KERNEL::NORM_QUAD4.
5239 * The skew is computed as follow for a quad with points (a,b,c,d): let
5240 * \f$u=\vec{ab}+\vec{dc}\f$ and \f$v=\vec{ac}+\vec{bd}\f$
5241 * then the skew is computed as:
5243 * s=\frac{u}{|u|}\cdot\frac{v}{|v|}
5246 * For a cell of other type an exception is thrown.
5247 * \return MEDCouplingFieldDouble * - a new instance of MEDCouplingFieldDouble on
5248 * cells and one time, lying on \a this mesh. The caller is to delete this
5249 * field using decrRef() as it is no more needed.
5250 * \throw If the coordinates array is not set.
5251 * \throw If \a this mesh contains elements of dimension different from the mesh dimension.
5252 * \throw If the connectivity data array has more than one component.
5253 * \throw If the connectivity data array has a named component.
5254 * \throw If the connectivity index data array has more than one component.
5255 * \throw If the connectivity index data array has a named component.
5256 * \throw If \a this->getMeshDimension() != 2.
5257 * \throw If \a this->getSpaceDimension() != 3.
5258 * \throw If \a this mesh includes cells of type different from the ones enumerated above.
5260 MEDCouplingFieldDouble *MEDCouplingUMesh::getSkewField() const
5262 checkConsistencyLight();
5263 int spaceDim=getSpaceDimension();
5264 int meshDim=getMeshDimension();
5266 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getSkewField : SpaceDimension must be equal to 3 !");
5268 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getSkewField : MeshDimension must be equal to 2 !");
5269 MCAuto<MEDCouplingFieldDouble> ret=MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME);
5271 int nbOfCells=getNumberOfCells();
5272 MCAuto<DataArrayDouble> arr=DataArrayDouble::New();
5273 arr->alloc(nbOfCells,1);
5274 double *pt=arr->getPointer();
5275 ret->setArray(arr);//In case of throw to avoid mem leaks arr will be used after decrRef.
5276 const int *conn=_nodal_connec->begin();
5277 const int *connI=_nodal_connec_index->begin();
5278 const double *coo=_coords->begin();
5280 for(int i=0;i<nbOfCells;i++,pt++)
5282 INTERP_KERNEL::NormalizedCellType t=(INTERP_KERNEL::NormalizedCellType)*conn;
5285 case INTERP_KERNEL::NORM_QUAD4:
5287 FillInCompact3DMode(3,4,conn+1,coo,tmp);
5288 *pt=INTERP_KERNEL::quadSkew(tmp);
5292 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getSkewField : A cell with not manged type (NORM_QUAD4) has been detected !");
5294 conn+=connI[i+1]-connI[i];
5296 ret->setName("Skew");
5297 ret->synchronizeTimeWithSupport();
5302 * Returns the cell field giving for each cell in \a this its diameter. Diameter means the max length of all possible SEG2 in the cell.
5304 * \return a new instance of field containing the result. The returned instance has to be deallocated by the caller.
5306 * \sa getSkewField, getWarpField, getAspectRatioField, getEdgeRatioField
5308 MEDCouplingFieldDouble *MEDCouplingUMesh::computeDiameterField() const
5310 checkConsistencyLight();
5311 MCAuto<MEDCouplingFieldDouble> ret(MEDCouplingFieldDouble::New(ON_CELLS,ONE_TIME));
5313 std::set<INTERP_KERNEL::NormalizedCellType> types;
5314 ComputeAllTypesInternal(types,_nodal_connec,_nodal_connec_index);
5315 int spaceDim(getSpaceDimension()),nbCells(getNumberOfCells());
5316 MCAuto<DataArrayDouble> arr(DataArrayDouble::New());
5317 arr->alloc(nbCells,1);
5318 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator it=types.begin();it!=types.end();it++)
5320 INTERP_KERNEL::AutoCppPtr<INTERP_KERNEL::DiameterCalculator> dc(INTERP_KERNEL::CellModel::GetCellModel(*it).buildInstanceOfDiameterCalulator(spaceDim));
5321 MCAuto<DataArrayInt> cellIds(giveCellsWithType(*it));
5322 dc->computeForListOfCellIdsUMeshFrmt(cellIds->begin(),cellIds->end(),_nodal_connec_index->begin(),_nodal_connec->begin(),getCoords()->begin(),arr->getPointer());
5325 ret->setName("Diameter");
5330 * This method aggregate the bbox of each cell and put it into bbox parameter (xmin,xmax,ymin,ymax,zmin,zmax).
5332 * \param [in] arcDetEps - a parameter specifying in case of 2D quadratic polygon cell the detection limit between linear and arc circle. (By default 1e-12)
5333 * For all other cases this input parameter is ignored.
5334 * \return DataArrayDouble * - newly created object (to be managed by the caller) \a this number of cells tuples and 2*spacedim components.
5336 * \throw If \a this is not fully set (coordinates and connectivity).
5337 * \throw If a cell in \a this has no valid nodeId.
5338 * \sa MEDCouplingUMesh::getBoundingBoxForBBTreeFast, MEDCouplingUMesh::getBoundingBoxForBBTree2DQuadratic
5340 DataArrayDouble *MEDCouplingUMesh::getBoundingBoxForBBTree(double arcDetEps) const
5342 int mDim(getMeshDimension()),sDim(getSpaceDimension());
5343 if((mDim==3 && sDim==3) || (mDim==2 && sDim==3) || (mDim==1 && sDim==1) || ( mDim==1 && sDim==3)) // Compute refined boundary box for quadratic elements only in 2D.
5344 return getBoundingBoxForBBTreeFast();
5345 if((mDim==2 && sDim==2) || (mDim==1 && sDim==2))
5347 bool presenceOfQuadratic(false);
5348 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator it=_types.begin();it!=_types.end();it++)
5350 const INTERP_KERNEL::CellModel& cm(INTERP_KERNEL::CellModel::GetCellModel(*it));
5351 if(cm.isQuadratic())
5352 presenceOfQuadratic=true;
5354 if(!presenceOfQuadratic)
5355 return getBoundingBoxForBBTreeFast();
5356 if(mDim==2 && sDim==2)
5357 return getBoundingBoxForBBTree2DQuadratic(arcDetEps);
5359 return getBoundingBoxForBBTree1DQuadratic(arcDetEps);
5361 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getBoundingBoxForBBTree : Managed dimensions are (mDim=1,sDim=1), (mDim=1,sDim=2), (mDim=1,sDim=3), (mDim=2,sDim=2), (mDim=2,sDim=3) and (mDim=3,sDim=3) !");
5365 * This method aggregate the bbox of each cell only considering the nodes constituting each cell and put it into bbox parameter.
5366 * So meshes having quadratic cells the computed bounding boxes can be invalid !
5368 * \return DataArrayDouble * - newly created object (to be managed by the caller) \a this number of cells tuples and 2*spacedim components.
5370 * \throw If \a this is not fully set (coordinates and connectivity).
5371 * \throw If a cell in \a this has no valid nodeId.
5373 DataArrayDouble *MEDCouplingUMesh::getBoundingBoxForBBTreeFast() const
5375 checkFullyDefined();
5376 int spaceDim(getSpaceDimension()),nbOfCells(getNumberOfCells()),nbOfNodes(getNumberOfNodes());
5377 MCAuto<DataArrayDouble> ret(DataArrayDouble::New()); ret->alloc(nbOfCells,2*spaceDim);
5378 double *bbox(ret->getPointer());
5379 for(int i=0;i<nbOfCells*spaceDim;i++)
5381 bbox[2*i]=std::numeric_limits<double>::max();
5382 bbox[2*i+1]=-std::numeric_limits<double>::max();
5384 const double *coordsPtr(_coords->begin());
5385 const int *conn(_nodal_connec->begin()),*connI(_nodal_connec_index->begin());
5386 for(int i=0;i<nbOfCells;i++)
5388 int offset=connI[i]+1;
5389 int nbOfNodesForCell(connI[i+1]-offset),kk(0);
5390 for(int j=0;j<nbOfNodesForCell;j++)
5392 int nodeId=conn[offset+j];
5393 if(nodeId>=0 && nodeId<nbOfNodes)
5395 for(int k=0;k<spaceDim;k++)
5397 bbox[2*spaceDim*i+2*k]=std::min(bbox[2*spaceDim*i+2*k],coordsPtr[spaceDim*nodeId+k]);
5398 bbox[2*spaceDim*i+2*k+1]=std::max(bbox[2*spaceDim*i+2*k+1],coordsPtr[spaceDim*nodeId+k]);
5405 std::ostringstream oss; oss << "MEDCouplingUMesh::getBoundingBoxForBBTree : cell #" << i << " contains no valid nodeId !";
5406 throw INTERP_KERNEL::Exception(oss.str());
5413 * This method aggregates the bbox of each 2D cell in \a this considering the whole shape. This method is particularly
5414 * useful for 2D meshes having quadratic cells
5415 * because for this type of cells getBoundingBoxForBBTreeFast method may return invalid bounding boxes (since it just considers
5416 * the two extremities of the arc of circle).
5418 * \param [in] arcDetEps - a parameter specifying in case of 2D quadratic polygon cell the detection limit between linear and arc circle. (By default 1e-12)
5419 * \return DataArrayDouble * - newly created object (to be managed by the caller) \a this number of cells tuples and 2*spacedim components.
5420 * \throw If \a this is not fully defined.
5421 * \throw If \a this is not a mesh with meshDimension equal to 2.
5422 * \throw If \a this is not a mesh with spaceDimension equal to 2.
5423 * \sa MEDCouplingUMesh::getBoundingBoxForBBTree1DQuadratic
5425 DataArrayDouble *MEDCouplingUMesh::getBoundingBoxForBBTree2DQuadratic(double arcDetEps) const
5427 checkFullyDefined();
5428 INTERP_KERNEL::QuadraticPlanarArcDetectionPrecision arcPrec(arcDetEps);
5430 int spaceDim(getSpaceDimension()),mDim(getMeshDimension()),nbOfCells(getNumberOfCells());
5431 if(spaceDim!=2 || mDim!=2)
5432 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getBoundingBoxForBBTree2DQuadratic : This method should be applied on mesh with mesh dimension equal to 2 and space dimension also equal to 2!");
5433 MCAuto<DataArrayDouble> ret(DataArrayDouble::New()); ret->alloc(nbOfCells,2*spaceDim);
5434 double *bbox(ret->getPointer());
5435 const double *coords(_coords->begin());
5436 const int *conn(_nodal_connec->begin()),*connI(_nodal_connec_index->begin());
5437 for(int i=0;i<nbOfCells;i++,bbox+=4,connI++)
5439 const INTERP_KERNEL::CellModel& cm(INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[*connI]));
5440 int sz(connI[1]-connI[0]-1);
5441 std::vector<INTERP_KERNEL::Node *> nodes(sz);
5442 INTERP_KERNEL::QuadraticPolygon *pol(0);
5443 for(int j=0;j<sz;j++)
5445 int nodeId(conn[*connI+1+j]);
5446 nodes[j]=new INTERP_KERNEL::Node(coords[nodeId*2],coords[nodeId*2+1]);
5448 if(!cm.isQuadratic())
5449 pol=INTERP_KERNEL::QuadraticPolygon::BuildLinearPolygon(nodes);
5451 pol=INTERP_KERNEL::QuadraticPolygon::BuildArcCirclePolygon(nodes);
5452 INTERP_KERNEL::Bounds b; b.prepareForAggregation(); pol->fillBounds(b); delete pol;
5453 bbox[0]=b.getXMin(); bbox[1]=b.getXMax(); bbox[2]=b.getYMin(); bbox[3]=b.getYMax();
5459 * This method aggregates the bbox of each 1D cell in \a this considering the whole shape. This method is particularly
5460 * useful for 2D meshes having quadratic cells
5461 * because for this type of cells getBoundingBoxForBBTreeFast method may return invalid bounding boxes (since it just considers
5462 * the two extremities of the arc of circle).
5464 * \param [in] arcDetEps - a parameter specifying in case of 2D quadratic polygon cell the detection limit between linear and arc circle. (By default 1e-12)
5465 * \return DataArrayDouble * - newly created object (to be managed by the caller) \a this number of cells tuples and 2*spacedim components.
5466 * \throw If \a this is not fully defined.
5467 * \throw If \a this is not a mesh with meshDimension equal to 1.
5468 * \throw If \a this is not a mesh with spaceDimension equal to 2.
5469 * \sa MEDCouplingUMesh::getBoundingBoxForBBTree2DQuadratic
5471 DataArrayDouble *MEDCouplingUMesh::getBoundingBoxForBBTree1DQuadratic(double arcDetEps) const
5473 checkFullyDefined();
5474 int spaceDim(getSpaceDimension()),mDim(getMeshDimension()),nbOfCells(getNumberOfCells());
5475 if(spaceDim!=2 || mDim!=1)
5476 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::getBoundingBoxForBBTree1DQuadratic : This method should be applied on mesh with mesh dimension equal to 1 and space dimension also equal to 2!");
5477 INTERP_KERNEL::QuadraticPlanarArcDetectionPrecision arcPrec(arcDetEps);
5478 MCAuto<DataArrayDouble> ret(DataArrayDouble::New()); ret->alloc(nbOfCells,2*spaceDim);
5479 double *bbox(ret->getPointer());
5480 const double *coords(_coords->begin());
5481 const int *conn(_nodal_connec->begin()),*connI(_nodal_connec_index->begin());
5482 for(int i=0;i<nbOfCells;i++,bbox+=4,connI++)
5484 const INTERP_KERNEL::CellModel& cm(INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[*connI]));
5485 int sz(connI[1]-connI[0]-1);
5486 std::vector<INTERP_KERNEL::Node *> nodes(sz);
5487 INTERP_KERNEL::Edge *edge(0);
5488 for(int j=0;j<sz;j++)
5490 int nodeId(conn[*connI+1+j]);
5491 nodes[j]=new INTERP_KERNEL::Node(coords[nodeId*2],coords[nodeId*2+1]);
5493 if(!cm.isQuadratic())
5494 edge=INTERP_KERNEL::QuadraticPolygon::BuildLinearEdge(nodes);
5496 edge=INTERP_KERNEL::QuadraticPolygon::BuildArcCircleEdge(nodes);
5497 const INTERP_KERNEL::Bounds& b(edge->getBounds());
5498 bbox[0]=b.getXMin(); bbox[1]=b.getXMax(); bbox[2]=b.getYMin(); bbox[3]=b.getYMax(); edge->decrRef();
5505 namespace MEDCouplingImpl
5510 ConnReader(const int *c, int val):_conn(c),_val(val) { }
5511 bool operator() (const int& pos) { return _conn[pos]!=_val; }
5520 ConnReader2(const int *c, int val):_conn(c),_val(val) { }
5521 bool operator() (const int& pos) { return _conn[pos]==_val; }
5531 * This method expects that \a this is sorted by types. If not an exception will be thrown.
5532 * This method returns in the same format as code (see MEDCouplingUMesh::checkTypeConsistencyAndContig or MEDCouplingUMesh::splitProfilePerType) how
5533 * \a this is composed in cell types.
5534 * The returned array is of size 3*n where n is the number of different types present in \a this.
5535 * For every k in [0,n] ret[3*k+2]==-1 because it has no sense here.
5536 * This parameter is kept only for compatibility with other method listed above.
5538 std::vector<int> MEDCouplingUMesh::getDistributionOfTypes() const
5540 checkConnectivityFullyDefined();
5541 const int *conn=_nodal_connec->begin();
5542 const int *connI=_nodal_connec_index->begin();
5543 const int *work=connI;
5544 int nbOfCells=getNumberOfCells();
5545 std::size_t n=getAllGeoTypes().size();
5546 std::vector<int> ret(3*n,-1); //ret[3*k+2]==-1 because it has no sense here
5547 std::set<INTERP_KERNEL::NormalizedCellType> types;
5548 for(std::size_t i=0;work!=connI+nbOfCells;i++)
5550 INTERP_KERNEL::NormalizedCellType typ=(INTERP_KERNEL::NormalizedCellType)conn[*work];
5551 if(types.find(typ)!=types.end())
5553 std::ostringstream oss; oss << "MEDCouplingUMesh::getDistributionOfTypes : Type " << INTERP_KERNEL::CellModel::GetCellModel(typ).getRepr();
5554 oss << " is not contiguous !";
5555 throw INTERP_KERNEL::Exception(oss.str());
5559 const int *work2=std::find_if(work+1,connI+nbOfCells,MEDCouplingImpl::ConnReader(conn,typ));
5560 ret[3*i+1]=(int)std::distance(work,work2);
5567 * This method is used to check that this has contiguous cell type in same order than described in \a code.
5568 * only for types cell, type node is not managed.
5569 * Format of \a code is the following. \a code should be of size 3*n and non empty. If not an exception is thrown.
5570 * foreach k in [0,n) on 3*k pos represent the geometric type and 3*k+1 number of elements of type 3*k.
5571 * 3*k+2 refers if different from -1 the pos in 'idsPerType' to get the corresponding array.
5572 * If 2 or more same geometric type is in \a code and exception is thrown too.
5574 * This method firstly checks
5575 * If it exists k so that 3*k geometric type is not in geometric types of this an exception will be thrown.
5576 * If it exists k so that 3*k geometric type exists but the number of consecutive cell types does not match,
5577 * an exception is thrown too.
5579 * If all geometric types in \a code are exactly those in \a this null pointer is returned.
5580 * If it exists a geometric type in \a this \b not in \a code \b no exception is thrown
5581 * and a DataArrayInt instance is returned that the user has the responsibility to deallocate.
5583 DataArrayInt *MEDCouplingUMesh::checkTypeConsistencyAndContig(const std::vector<int>& code, const std::vector<const DataArrayInt *>& idsPerType) const
5586 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkTypeConsistencyAndContig : code is empty, should not !");
5587 std::size_t sz=code.size();
5590 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkTypeConsistencyAndContig : code size is NOT %3 !");
5591 std::vector<INTERP_KERNEL::NormalizedCellType> types;
5593 bool isNoPflUsed=true;
5594 for(std::size_t i=0;i<n;i++)
5595 if(std::find(types.begin(),types.end(),(INTERP_KERNEL::NormalizedCellType)code[3*i])==types.end())
5597 types.push_back((INTERP_KERNEL::NormalizedCellType)code[3*i]);
5599 if(_types.find((INTERP_KERNEL::NormalizedCellType)code[3*i])==_types.end())
5600 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkTypeConsistencyAndContig : expected geo types not in this !");
5601 isNoPflUsed=isNoPflUsed && (code[3*i+2]==-1);
5604 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkTypeConsistencyAndContig : code contains duplication of types in unstructured mesh !");
5607 if(!checkConsecutiveCellTypesAndOrder(&types[0],&types[0]+types.size()))
5608 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkTypeConsistencyAndContig : non contiguous type !");
5609 if(types.size()==_types.size())
5612 MCAuto<DataArrayInt> ret=DataArrayInt::New();
5614 int *retPtr=ret->getPointer();
5615 const int *connI=_nodal_connec_index->begin();
5616 const int *conn=_nodal_connec->begin();
5617 int nbOfCells=getNumberOfCells();
5620 for(std::vector<INTERP_KERNEL::NormalizedCellType>::const_iterator it=types.begin();it!=types.end();it++,kk++)
5622 i=std::find_if(i,connI+nbOfCells,MEDCouplingImpl::ConnReader2(conn,(int)(*it)));
5623 int offset=(int)std::distance(connI,i);
5624 const int *j=std::find_if(i+1,connI+nbOfCells,MEDCouplingImpl::ConnReader(conn,(int)(*it)));
5625 int nbOfCellsOfCurType=(int)std::distance(i,j);
5626 if(code[3*kk+2]==-1)
5627 for(int k=0;k<nbOfCellsOfCurType;k++)
5631 int idInIdsPerType=code[3*kk+2];
5632 if(idInIdsPerType>=0 && idInIdsPerType<(int)idsPerType.size())
5634 const DataArrayInt *zePfl=idsPerType[idInIdsPerType];
5637 zePfl->checkAllocated();
5638 if(zePfl->getNumberOfComponents()==1)
5640 for(const int *k=zePfl->begin();k!=zePfl->end();k++,retPtr++)
5642 if(*k>=0 && *k<nbOfCellsOfCurType)
5643 *retPtr=(*k)+offset;
5646 std::ostringstream oss; oss << "MEDCouplingUMesh::checkTypeConsistencyAndContig : the section " << kk << " points to the profile #" << idInIdsPerType;
5647 oss << ", and this profile contains a value " << *k << " should be in [0," << nbOfCellsOfCurType << ") !";
5648 throw INTERP_KERNEL::Exception(oss.str());
5653 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkTypeConsistencyAndContig : presence of a profile with nb of compo != 1 !");
5656 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::checkTypeConsistencyAndContig : presence of null profile !");
5660 std::ostringstream oss; oss << "MEDCouplingUMesh::checkTypeConsistencyAndContig : at section " << kk << " of code it points to the array #" << idInIdsPerType;
5661 oss << " should be in [0," << idsPerType.size() << ") !";
5662 throw INTERP_KERNEL::Exception(oss.str());
5671 * This method makes the hypothesis that \a this is sorted by type. If not an exception will be thrown.
5672 * This method is the opposite of MEDCouplingUMesh::checkTypeConsistencyAndContig method. Given a list of cells in \a profile it returns a list of sub-profiles sorted by geo type.
5673 * The result is put in the array \a idsPerType. In the returned parameter \a code, foreach i \a code[3*i+2] refers (if different from -1) to a location into the \a idsPerType.
5674 * This method has 1 input \a profile and 3 outputs \a code \a idsInPflPerType and \a idsPerType.
5676 * \param [in] profile
5677 * \param [out] code is a vector of size 3*n where n is the number of different geometric type in \a this \b reduced to the profile \a profile. \a code has exactly the same semantic than in MEDCouplingUMesh::checkTypeConsistencyAndContig method.
5678 * \param [out] idsInPflPerType is a vector of size of different geometric type in the subpart defined by \a profile of \a this ( equal to \a code.size()/3). For each i,
5679 * \a idsInPflPerType[i] stores the tuple ids in \a profile that correspond to the geometric type code[3*i+0]
5680 * \param [out] idsPerType is a vector of size of different sub profiles needed to be defined to represent the profile \a profile for a given geometric type.
5681 * This vector can be empty in case of all geometric type cells are fully covered in ascending in the given input \a profile.
5682 * \throw if \a profile has not exactly one component. It throws too, if \a profile contains some values not in [0,getNumberOfCells()) or if \a this is not fully defined
5684 void MEDCouplingUMesh::splitProfilePerType(const DataArrayInt *profile, std::vector<int>& code, std::vector<DataArrayInt *>& idsInPflPerType, std::vector<DataArrayInt *>& idsPerType) const
5687 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::splitProfilePerType : input profile is NULL !");
5688 if(profile->getNumberOfComponents()!=1)
5689 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::splitProfilePerType : input profile should have exactly one component !");
5690 checkConnectivityFullyDefined();
5691 const int *conn=_nodal_connec->begin();
5692 const int *connI=_nodal_connec_index->begin();
5693 int nbOfCells=getNumberOfCells();
5694 std::vector<INTERP_KERNEL::NormalizedCellType> types;
5695 std::vector<int> typeRangeVals(1);
5696 for(const int *i=connI;i!=connI+nbOfCells;)
5698 INTERP_KERNEL::NormalizedCellType curType=(INTERP_KERNEL::NormalizedCellType)conn[*i];
5699 if(std::find(types.begin(),types.end(),curType)!=types.end())
5701 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::splitProfilePerType : current mesh is not sorted by type !");
5703 types.push_back(curType);
5704 i=std::find_if(i+1,connI+nbOfCells,MEDCouplingImpl::ConnReader(conn,(int)curType));
5705 typeRangeVals.push_back((int)std::distance(connI,i));
5708 DataArrayInt *castArr=0,*rankInsideCast=0,*castsPresent=0;
5709 profile->splitByValueRange(&typeRangeVals[0],&typeRangeVals[0]+typeRangeVals.size(),castArr,rankInsideCast,castsPresent);
5710 MCAuto<DataArrayInt> tmp0=castArr;
5711 MCAuto<DataArrayInt> tmp1=rankInsideCast;
5712 MCAuto<DataArrayInt> tmp2=castsPresent;
5714 int nbOfCastsFinal=castsPresent->getNumberOfTuples();
5715 code.resize(3*nbOfCastsFinal);
5716 std::vector< MCAuto<DataArrayInt> > idsInPflPerType2;
5717 std::vector< MCAuto<DataArrayInt> > idsPerType2;
5718 for(int i=0;i<nbOfCastsFinal;i++)
5720 int castId=castsPresent->getIJ(i,0);
5721 MCAuto<DataArrayInt> tmp3=castArr->findIdsEqual(castId);
5722 idsInPflPerType2.push_back(tmp3);
5723 code[3*i]=(int)types[castId];
5724 code[3*i+1]=tmp3->getNumberOfTuples();
5725 MCAuto<DataArrayInt> tmp4=rankInsideCast->selectByTupleId(tmp3->begin(),tmp3->begin()+tmp3->getNumberOfTuples());
5726 if(!tmp4->isIota(typeRangeVals[castId+1]-typeRangeVals[castId]))
5728 tmp4->copyStringInfoFrom(*profile);
5729 idsPerType2.push_back(tmp4);
5730 code[3*i+2]=(int)idsPerType2.size()-1;
5737 std::size_t sz2=idsInPflPerType2.size();
5738 idsInPflPerType.resize(sz2);
5739 for(std::size_t i=0;i<sz2;i++)
5741 DataArrayInt *locDa=idsInPflPerType2[i];
5743 idsInPflPerType[i]=locDa;
5745 std::size_t sz=idsPerType2.size();
5746 idsPerType.resize(sz);
5747 for(std::size_t i=0;i<sz;i++)
5749 DataArrayInt *locDa=idsPerType2[i];
5751 idsPerType[i]=locDa;
5756 * This method is here too emulate the MEDMEM behaviour on BDC (buildDescendingConnectivity). Hoping this method becomes deprecated very soon.
5757 * This method make the assumption that \a this and 'nM1LevMesh' mesh lyies on same coords (same pointer) as MED and MEDMEM does.
5758 * The following equality should be verified 'nM1LevMesh->getMeshDimension()==this->getMeshDimension()-1'
5759 * This method returns 5+2 elements. 'desc', 'descIndx', 'revDesc', 'revDescIndx' and 'meshnM1' behaves exactly as MEDCoupling::MEDCouplingUMesh::buildDescendingConnectivity except the content as described after. The returned array specifies the n-1 mesh reordered by type as MEDMEM does. 'nM1LevMeshIds' contains the ids in returned 'meshnM1'. Finally 'meshnM1Old2New' contains numbering old2new that is to say the cell #k in coarse 'nM1LevMesh' will have the number ret[k] in returned mesh 'nM1LevMesh' MEDMEM reordered.
5761 MEDCouplingUMesh *MEDCouplingUMesh::emulateMEDMEMBDC(const MEDCouplingUMesh *nM1LevMesh, DataArrayInt *desc, DataArrayInt *descIndx, DataArrayInt *&revDesc, DataArrayInt *&revDescIndx, DataArrayInt *& nM1LevMeshIds, DataArrayInt *&meshnM1Old2New) const
5763 checkFullyDefined();
5764 nM1LevMesh->checkFullyDefined();
5765 if(getMeshDimension()-1!=nM1LevMesh->getMeshDimension())
5766 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::emulateMEDMEMBDC : The mesh passed as first argument should have a meshDim equal to this->getMeshDimension()-1 !" );
5767 if(_coords!=nM1LevMesh->getCoords())
5768 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::emulateMEDMEMBDC : 'this' and mesh in first argument should share the same coords : Use tryToShareSameCoords method !");
5769 MCAuto<DataArrayInt> tmp0=DataArrayInt::New();
5770 MCAuto<DataArrayInt> tmp1=DataArrayInt::New();
5771 MCAuto<MEDCouplingUMesh> ret1=buildDescendingConnectivity(desc,descIndx,tmp0,tmp1);
5772 MCAuto<DataArrayInt> ret0=ret1->sortCellsInMEDFileFrmt();
5773 desc->transformWithIndArr(ret0->begin(),ret0->begin()+ret0->getNbOfElems());
5774 MCAuto<MEDCouplingUMesh> tmp=MEDCouplingUMesh::New();
5775 tmp->setConnectivity(tmp0,tmp1);
5776 tmp->renumberCells(ret0->begin(),false);
5777 revDesc=tmp->getNodalConnectivity();
5778 revDescIndx=tmp->getNodalConnectivityIndex();
5779 DataArrayInt *ret=0;
5780 if(!ret1->areCellsIncludedIn(nM1LevMesh,2,ret))
5783 ret->getMaxValue(tmp2);
5785 std::ostringstream oss; oss << "MEDCouplingUMesh::emulateMEDMEMBDC : input N-1 mesh present a cell not in descending mesh ... Id of cell is " << tmp2 << " !";
5786 throw INTERP_KERNEL::Exception(oss.str());
5791 revDescIndx->incrRef();
5794 meshnM1Old2New=ret0;
5799 * Permutes the nodal connectivity arrays so that the cells are sorted by type, which is
5800 * necessary for writing the mesh to MED file. Additionally returns a permutation array
5801 * in "Old to New" mode.
5802 * \return DataArrayInt * - a new instance of DataArrayInt. The caller is to delete
5803 * this array using decrRef() as it is no more needed.
5804 * \throw If the nodal connectivity of cells is not defined.
5806 DataArrayInt *MEDCouplingUMesh::sortCellsInMEDFileFrmt()
5808 checkConnectivityFullyDefined();
5809 MCAuto<DataArrayInt> ret=getRenumArrForMEDFileFrmt();
5810 renumberCells(ret->begin(),false);
5815 * This methods checks that cells are sorted by their types.
5816 * This method makes asumption (no check) that connectivity is correctly set before calling.
5818 bool MEDCouplingUMesh::checkConsecutiveCellTypes() const
5820 checkFullyDefined();
5821 const int *conn=_nodal_connec->begin();
5822 const int *connI=_nodal_connec_index->begin();
5823 int nbOfCells=getNumberOfCells();
5824 std::set<INTERP_KERNEL::NormalizedCellType> types;
5825 for(const int *i=connI;i!=connI+nbOfCells;)
5827 INTERP_KERNEL::NormalizedCellType curType=(INTERP_KERNEL::NormalizedCellType)conn[*i];
5828 if(types.find(curType)!=types.end())
5830 types.insert(curType);
5831 i=std::find_if(i+1,connI+nbOfCells,MEDCouplingImpl::ConnReader(conn,(int)curType));
5837 * This method is a specialization of MEDCouplingUMesh::checkConsecutiveCellTypesAndOrder method that is called here.
5838 * The geometric type order is specified by MED file.
5840 * \sa MEDCouplingUMesh::checkConsecutiveCellTypesAndOrder
5842 bool MEDCouplingUMesh::checkConsecutiveCellTypesForMEDFileFrmt() const
5844 return checkConsecutiveCellTypesAndOrder(MEDMEM_ORDER,MEDMEM_ORDER+N_MEDMEM_ORDER);
5848 * This method performs the same job as checkConsecutiveCellTypes except that the order of types sequence is analyzed to check
5849 * that the order is specified in array defined by [ \a orderBg , \a orderEnd ).
5850 * If there is some geo types in \a this \b NOT in [ \a orderBg, \a orderEnd ) it is OK (return true) if contiguous.
5851 * If there is some geo types in [ \a orderBg, \a orderEnd ) \b NOT in \a this it is OK too (return true) if contiguous.
5853 bool MEDCouplingUMesh::checkConsecutiveCellTypesAndOrder(const INTERP_KERNEL::NormalizedCellType *orderBg, const INTERP_KERNEL::NormalizedCellType *orderEnd) const
5855 checkFullyDefined();
5856 const int *conn=_nodal_connec->begin();
5857 const int *connI=_nodal_connec_index->begin();
5858 int nbOfCells=getNumberOfCells();
5862 std::set<INTERP_KERNEL::NormalizedCellType> sg;
5863 for(const int *i=connI;i!=connI+nbOfCells;)
5865 INTERP_KERNEL::NormalizedCellType curType=(INTERP_KERNEL::NormalizedCellType)conn[*i];
5866 const INTERP_KERNEL::NormalizedCellType *isTypeExists=std::find(orderBg,orderEnd,curType);
5867 if(isTypeExists!=orderEnd)
5869 int pos=(int)std::distance(orderBg,isTypeExists);
5873 i=std::find_if(i+1,connI+nbOfCells,MEDCouplingImpl::ConnReader(conn,(int)curType));
5877 if(sg.find(curType)==sg.end())
5879 i=std::find_if(i+1,connI+nbOfCells,MEDCouplingImpl::ConnReader(conn,(int)curType));
5890 * This method returns 2 newly allocated DataArrayInt instances. The first is an array of size 'this->getNumberOfCells()' with one component,
5891 * that tells for each cell the pos of its type in the array on type given in input parameter. The 2nd output parameter is an array with the same
5892 * number of tuples than input type array and with one component. This 2nd output array gives type by type the number of occurrence of type in 'this'.
5894 DataArrayInt *MEDCouplingUMesh::getLevArrPerCellTypes(const INTERP_KERNEL::NormalizedCellType *orderBg, const INTERP_KERNEL::NormalizedCellType *orderEnd, DataArrayInt *&nbPerType) const
5896 checkConnectivityFullyDefined();
5897 int nbOfCells=getNumberOfCells();
5898 const int *conn=_nodal_connec->begin();
5899 const int *connI=_nodal_connec_index->begin();
5900 MCAuto<DataArrayInt> tmpa=DataArrayInt::New();
5901 MCAuto<DataArrayInt> tmpb=DataArrayInt::New();
5902 tmpa->alloc(nbOfCells,1);
5903 tmpb->alloc((int)std::distance(orderBg,orderEnd),1);
5904 tmpb->fillWithZero();
5905 int *tmp=tmpa->getPointer();
5906 int *tmp2=tmpb->getPointer();
5907 for(const int *i=connI;i!=connI+nbOfCells;i++)
5909 const INTERP_KERNEL::NormalizedCellType *where=std::find(orderBg,orderEnd,(INTERP_KERNEL::NormalizedCellType)conn[*i]);
5912 int pos=(int)std::distance(orderBg,where);
5914 tmp[std::distance(connI,i)]=pos;
5918 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)conn[*i]);
5919 std::ostringstream oss; oss << "MEDCouplingUMesh::getLevArrPerCellTypes : Cell #" << std::distance(connI,i);
5920 oss << " has a type " << cm.getRepr() << " not in input array of type !";
5921 throw INTERP_KERNEL::Exception(oss.str());
5924 nbPerType=tmpb.retn();
5929 * This method behaves exactly as MEDCouplingUMesh::getRenumArrForConsecutiveCellTypesSpec but the order is those defined in MED file spec.
5931 * \return a new object containing the old to new correspondence.
5933 * \sa MEDCouplingUMesh::getRenumArrForConsecutiveCellTypesSpec, MEDCouplingUMesh::sortCellsInMEDFileFrmt.
5935 DataArrayInt *MEDCouplingUMesh::getRenumArrForMEDFileFrmt() const
5937 return getRenumArrForConsecutiveCellTypesSpec(MEDMEM_ORDER,MEDMEM_ORDER+N_MEDMEM_ORDER);
5941 * This method is similar to method MEDCouplingUMesh::rearrange2ConsecutiveCellTypes except that the type order is specified by [ \a orderBg , \a orderEnd ) (as MEDCouplingUMesh::checkConsecutiveCellTypesAndOrder method) and that this method is \b const and performs \b NO permutation in \a this.
5942 * This method returns an array of size getNumberOfCells() that gives a renumber array old2New that can be used as input of MEDCouplingMesh::renumberCells.
5943 * The mesh after this call to MEDCouplingMesh::renumberCells will pass the test of MEDCouplingUMesh::checkConsecutiveCellTypesAndOrder with the same inputs.
5944 * The returned array minimizes the permutations that is to say the order of cells inside same geometric type remains the same.
5946 DataArrayInt *MEDCouplingUMesh::getRenumArrForConsecutiveCellTypesSpec(const INTERP_KERNEL::NormalizedCellType *orderBg, const INTERP_KERNEL::NormalizedCellType *orderEnd) const
5948 DataArrayInt *nbPerType=0;
5949 MCAuto<DataArrayInt> tmpa=getLevArrPerCellTypes(orderBg,orderEnd,nbPerType);
5950 nbPerType->decrRef();
5951 return tmpa->buildPermArrPerLevel();
5955 * This method reorganize the cells of \a this so that the cells with same geometric types are put together.
5956 * The number of cells remains unchanged after the call of this method.
5957 * This method tries to minimizes the number of needed permutations. So, this method behaves not exactly as
5958 * MEDCouplingUMesh::sortCellsInMEDFileFrmt.
5960 * \return the array giving the correspondence old to new.
5962 DataArrayInt *MEDCouplingUMesh::rearrange2ConsecutiveCellTypes()
5964 checkFullyDefined();
5966 const int *conn=_nodal_connec->begin();
5967 const int *connI=_nodal_connec_index->begin();
5968 int nbOfCells=getNumberOfCells();
5969 std::vector<INTERP_KERNEL::NormalizedCellType> types;
5970 for(const int *i=connI;i!=connI+nbOfCells && (types.size()!=_types.size());)
5971 if(std::find(types.begin(),types.end(),(INTERP_KERNEL::NormalizedCellType)conn[*i])==types.end())
5973 INTERP_KERNEL::NormalizedCellType curType=(INTERP_KERNEL::NormalizedCellType)conn[*i];
5974 types.push_back(curType);
5975 for(i++;i!=connI+nbOfCells && (INTERP_KERNEL::NormalizedCellType)conn[*i]==curType;i++);
5977 DataArrayInt *ret=DataArrayInt::New();
5978 ret->alloc(nbOfCells,1);
5979 int *retPtr=ret->getPointer();
5980 std::fill(retPtr,retPtr+nbOfCells,-1);
5982 for(std::vector<INTERP_KERNEL::NormalizedCellType>::const_iterator iter=types.begin();iter!=types.end();iter++)
5984 for(const int *i=connI;i!=connI+nbOfCells;i++)
5985 if((INTERP_KERNEL::NormalizedCellType)conn[*i]==(*iter))
5986 retPtr[std::distance(connI,i)]=newCellId++;
5988 renumberCells(retPtr,false);
5993 * This method splits \a this into as mush as untructured meshes that consecutive set of same type cells.
5994 * So this method has typically a sense if MEDCouplingUMesh::checkConsecutiveCellTypes has a sense.
5995 * This method makes asumption that connectivity is correctly set before calling.
5997 std::vector<MEDCouplingUMesh *> MEDCouplingUMesh::splitByType() const
5999 checkConnectivityFullyDefined();
6000 const int *conn=_nodal_connec->begin();
6001 const int *connI=_nodal_connec_index->begin();
6002 int nbOfCells=getNumberOfCells();
6003 std::vector<MEDCouplingUMesh *> ret;
6004 for(const int *i=connI;i!=connI+nbOfCells;)
6006 INTERP_KERNEL::NormalizedCellType curType=(INTERP_KERNEL::NormalizedCellType)conn[*i];
6007 int beginCellId=(int)std::distance(connI,i);
6008 i=std::find_if(i+1,connI+nbOfCells,MEDCouplingImpl::ConnReader(conn,(int)curType));
6009 int endCellId=(int)std::distance(connI,i);
6010 int sz=endCellId-beginCellId;
6011 int *cells=new int[sz];
6012 for(int j=0;j<sz;j++)
6013 cells[j]=beginCellId+j;
6014 MEDCouplingUMesh *m=(MEDCouplingUMesh *)buildPartOfMySelf(cells,cells+sz,true);
6022 * This method performs the opposite operation than those in MEDCoupling1SGTUMesh::buildUnstructured.
6023 * If \a this is a single geometric type unstructured mesh, it will be converted into a more compact data structure,
6024 * MEDCoupling1GTUMesh instance. The returned instance will aggregate the same DataArrayDouble instance of coordinates than \a this.
6026 * \return a newly allocated instance, that the caller must manage.
6027 * \throw If \a this contains more than one geometric type.
6028 * \throw If the nodal connectivity of \a this is not fully defined.
6029 * \throw If the internal data is not coherent.
6031 MEDCoupling1GTUMesh *MEDCouplingUMesh::convertIntoSingleGeoTypeMesh() const
6033 checkConnectivityFullyDefined();
6034 if(_types.size()!=1)
6035 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertIntoSingleGeoTypeMesh : current mesh does not contain exactly one geometric type !");
6036 INTERP_KERNEL::NormalizedCellType typ=*_types.begin();
6037 MCAuto<MEDCoupling1GTUMesh> ret=MEDCoupling1GTUMesh::New(getName(),typ);
6038 ret->setCoords(getCoords());
6039 MEDCoupling1SGTUMesh *retC=dynamic_cast<MEDCoupling1SGTUMesh *>((MEDCoupling1GTUMesh*)ret);
6042 MCAuto<DataArrayInt> c=convertNodalConnectivityToStaticGeoTypeMesh();
6043 retC->setNodalConnectivity(c);
6047 MEDCoupling1DGTUMesh *retD=dynamic_cast<MEDCoupling1DGTUMesh *>((MEDCoupling1GTUMesh*)ret);
6049 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertIntoSingleGeoTypeMesh : Internal error !");
6050 DataArrayInt *c=0,*ci=0;
6051 convertNodalConnectivityToDynamicGeoTypeMesh(c,ci);
6052 MCAuto<DataArrayInt> cs(c),cis(ci);
6053 retD->setNodalConnectivity(cs,cis);
6058 DataArrayInt *MEDCouplingUMesh::convertNodalConnectivityToStaticGeoTypeMesh() const
6060 checkConnectivityFullyDefined();
6061 if(_types.size()!=1)
6062 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertNodalConnectivityToStaticGeoTypeMesh : current mesh does not contain exactly one geometric type !");
6063 INTERP_KERNEL::NormalizedCellType typ=*_types.begin();
6064 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(typ);
6067 std::ostringstream oss; oss << "MEDCouplingUMesh::convertNodalConnectivityToStaticGeoTypeMesh : this contains a single geo type (" << cm.getRepr() << ") but ";
6068 oss << "this type is dynamic ! Only static geometric type is possible for that type ! call convertNodalConnectivityToDynamicGeoTypeMesh instead !";
6069 throw INTERP_KERNEL::Exception(oss.str());
6071 int nbCells=getNumberOfCells();
6073 int nbNodesPerCell=(int)cm.getNumberOfNodes();
6074 MCAuto<DataArrayInt> connOut=DataArrayInt::New(); connOut->alloc(nbCells*nbNodesPerCell,1);
6075 int *outPtr=connOut->getPointer();
6076 const int *conn=_nodal_connec->begin();
6077 const int *connI=_nodal_connec_index->begin();
6079 for(int i=0;i<nbCells;i++,connI++)
6081 if(conn[connI[0]]==typi && connI[1]-connI[0]==nbNodesPerCell)
6082 outPtr=std::copy(conn+connI[0]+1,conn+connI[1],outPtr);
6085 std::ostringstream oss; oss << "MEDCouplingUMesh::convertNodalConnectivityToStaticGeoTypeMesh : there something wrong in cell #" << i << " ! The type of cell is not those expected, or the length of nodal connectivity is not those expected (" << nbNodesPerCell-1 << ") !";
6086 throw INTERP_KERNEL::Exception(oss.str());
6089 return connOut.retn();
6093 * Convert the nodal connectivity of the mesh so that all the cells are of dynamic types (polygon or quadratic
6094 * polygon). This returns the corresponding new nodal connectivity in \ref numbering-indirect format.
6098 void MEDCouplingUMesh::convertNodalConnectivityToDynamicGeoTypeMesh(DataArrayInt *&nodalConn, DataArrayInt *&nodalConnIndex) const
6100 static const char msg0[]="MEDCouplingUMesh::convertNodalConnectivityToDynamicGeoTypeMesh : nodal connectivity in this are invalid ! Call checkConsistency !";
6101 checkConnectivityFullyDefined();
6102 if(_types.size()!=1)
6103 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::convertNodalConnectivityToDynamicGeoTypeMesh : current mesh does not contain exactly one geometric type !");
6104 int nbCells=getNumberOfCells(),lgth=_nodal_connec->getNumberOfTuples();
6106 throw INTERP_KERNEL::Exception(msg0);
6107 MCAuto<DataArrayInt> c(DataArrayInt::New()),ci(DataArrayInt::New());
6108 c->alloc(lgth-nbCells,1); ci->alloc(nbCells+1,1);
6109 int *cp(c->getPointer()),*cip(ci->getPointer());
6110 const int *incp(_nodal_connec->begin()),*incip(_nodal_connec_index->begin());
6112 for(int i=0;i<nbCells;i++,cip++,incip++)
6114 int strt(incip[0]+1),stop(incip[1]);//+1 to skip geo type
6115 int delta(stop-strt);
6118 if((strt>=0 && strt<lgth) && (stop>=0 && stop<=lgth))
6119 cp=std::copy(incp+strt,incp+stop,cp);
6121 throw INTERP_KERNEL::Exception(msg0);
6124 throw INTERP_KERNEL::Exception(msg0);
6125 cip[1]=cip[0]+delta;
6127 nodalConn=c.retn(); nodalConnIndex=ci.retn();
6131 * This method takes in input a vector of MEDCouplingUMesh instances lying on the same coordinates with same mesh dimensions.
6132 * Each mesh in \b ms must be sorted by type with the same order (typically using MEDCouplingUMesh::sortCellsInMEDFileFrmt).
6133 * This method is particularly useful for MED file interaction. It allows to aggregate several meshes and keeping the type sorting
6134 * and the track of the permutation by chunk of same geotype cells to retrieve it. The traditional formats old2new and new2old
6135 * are not used here to avoid the build of big permutation array.
6137 * \param [in] ms meshes with same mesh dimension lying on the same coords and sorted by type following de the same geometric type order than
6138 * those specified in MEDCouplingUMesh::sortCellsInMEDFileFrmt method.
6139 * \param [out] szOfCellGrpOfSameType is a newly allocated DataArrayInt instance whose number of tuples is equal to the number of chunks of same geotype
6140 * in all meshes in \b ms. The accumulation of all values of this array is equal to the number of cells of returned mesh.
6141 * \param [out] idInMsOfCellGrpOfSameType is a newly allocated DataArrayInt instance having the same size than \b szOfCellGrpOfSameType. This
6142 * output array gives for each chunck of same type the corresponding mesh id in \b ms.
6143 * \return A newly allocated unstructured mesh that is the result of the aggregation on same coords of all meshes in \b ms. This returned mesh
6144 * is sorted by type following the geo cell types order of MEDCouplingUMesh::sortCellsInMEDFileFrmt method.
6146 MEDCouplingUMesh *MEDCouplingUMesh::AggregateSortedByTypeMeshesOnSameCoords(const std::vector<const MEDCouplingUMesh *>& ms,
6147 DataArrayInt *&szOfCellGrpOfSameType,
6148 DataArrayInt *&idInMsOfCellGrpOfSameType)
6150 std::vector<const MEDCouplingUMesh *> ms2;
6151 for(std::vector<const MEDCouplingUMesh *>::const_iterator it=ms.begin();it!=ms.end();it++)
6154 (*it)->checkConnectivityFullyDefined();
6158 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::AggregateSortedByTypeMeshesOnSameCoords : input vector is empty !");
6159 const DataArrayDouble *refCoo=ms2[0]->getCoords();
6160 int meshDim=ms2[0]->getMeshDimension();
6161 std::vector<const MEDCouplingUMesh *> m1ssm;
6162 std::vector< MCAuto<MEDCouplingUMesh> > m1ssmAuto;
6164 std::vector<const MEDCouplingUMesh *> m1ssmSingle;
6165 std::vector< MCAuto<MEDCouplingUMesh> > m1ssmSingleAuto;
6167 MCAuto<DataArrayInt> ret1(DataArrayInt::New()),ret2(DataArrayInt::New());
6168 ret1->alloc(0,1); ret2->alloc(0,1);
6169 for(std::vector<const MEDCouplingUMesh *>::const_iterator it=ms2.begin();it!=ms2.end();it++,rk++)
6171 if(meshDim!=(*it)->getMeshDimension())
6172 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::AggregateSortedByTypeMeshesOnSameCoords : meshdims mismatch !");
6173 if(refCoo!=(*it)->getCoords())
6174 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::AggregateSortedByTypeMeshesOnSameCoords : meshes are not shared by a single coordinates coords !");
6175 std::vector<MEDCouplingUMesh *> sp=(*it)->splitByType();
6176 std::copy(sp.begin(),sp.end(),std::back_insert_iterator< std::vector<const MEDCouplingUMesh *> >(m1ssm));
6177 std::copy(sp.begin(),sp.end(),std::back_insert_iterator< std::vector<MCAuto<MEDCouplingUMesh> > >(m1ssmAuto));
6178 for(std::vector<MEDCouplingUMesh *>::const_iterator it2=sp.begin();it2!=sp.end();it2++)
6180 MEDCouplingUMesh *singleCell=static_cast<MEDCouplingUMesh *>((*it2)->buildPartOfMySelf(&fake,&fake+1,true));
6181 m1ssmSingleAuto.push_back(singleCell);
6182 m1ssmSingle.push_back(singleCell);
6183 ret1->pushBackSilent((*it2)->getNumberOfCells()); ret2->pushBackSilent(rk);
6186 MCAuto<MEDCouplingUMesh> m1ssmSingle2=MEDCouplingUMesh::MergeUMeshesOnSameCoords(m1ssmSingle);
6187 MCAuto<DataArrayInt> renum=m1ssmSingle2->sortCellsInMEDFileFrmt();
6188 std::vector<const MEDCouplingUMesh *> m1ssmfinal(m1ssm.size());
6189 for(std::size_t i=0;i<m1ssm.size();i++)
6190 m1ssmfinal[renum->getIJ(i,0)]=m1ssm[i];
6191 MCAuto<MEDCouplingUMesh> ret0=MEDCouplingUMesh::MergeUMeshesOnSameCoords(m1ssmfinal);
6192 szOfCellGrpOfSameType=ret1->renumber(renum->begin());
6193 idInMsOfCellGrpOfSameType=ret2->renumber(renum->begin());
6198 * This method returns a newly created DataArrayInt instance.
6199 * This method retrieves cell ids in [ \a begin, \a end ) that have the type \a type.
6201 DataArrayInt *MEDCouplingUMesh::keepCellIdsByType(INTERP_KERNEL::NormalizedCellType type, const int *begin, const int *end) const
6203 checkFullyDefined();
6204 const int *conn=_nodal_connec->begin();
6205 const int *connIndex=_nodal_connec_index->begin();
6206 MCAuto<DataArrayInt> ret(DataArrayInt::New()); ret->alloc(0,1);
6207 for(const int *w=begin;w!=end;w++)
6208 if((INTERP_KERNEL::NormalizedCellType)conn[connIndex[*w]]==type)
6209 ret->pushBackSilent(*w);
6214 * This method makes the assumption that da->getNumberOfTuples()<this->getNumberOfCells(). This method makes the assumption that ids contained in 'da'
6215 * are in [0:getNumberOfCells())
6217 DataArrayInt *MEDCouplingUMesh::convertCellArrayPerGeoType(const DataArrayInt *da) const
6219 checkFullyDefined();
6220 const int *conn=_nodal_connec->begin();
6221 const int *connI=_nodal_connec_index->begin();
6222 int nbOfCells=getNumberOfCells();
6223 std::set<INTERP_KERNEL::NormalizedCellType> types(getAllGeoTypes());
6224 int *tmp=new int[nbOfCells];
6225 for(std::set<INTERP_KERNEL::NormalizedCellType>::const_iterator iter=types.begin();iter!=types.end();iter++)
6228 for(const int *i=connI;i!=connI+nbOfCells;i++)
6229 if((INTERP_KERNEL::NormalizedCellType)conn[*i]==(*iter))
6230 tmp[std::distance(connI,i)]=j++;
6232 DataArrayInt *ret=DataArrayInt::New();
6233 ret->alloc(da->getNumberOfTuples(),da->getNumberOfComponents());
6234 ret->copyStringInfoFrom(*da);
6235 int *retPtr=ret->getPointer();
6236 const int *daPtr=da->begin();
6237 int nbOfElems=da->getNbOfElems();
6238 for(int k=0;k<nbOfElems;k++)
6239 retPtr[k]=tmp[daPtr[k]];
6245 * This method reduced number of cells of this by keeping cells whose type is different from 'type' and if type=='type'
6246 * This method \b works \b for mesh sorted by type.
6247 * cells whose ids is in 'idsPerGeoType' array.
6248 * This method conserves coords and name of mesh.
6250 MEDCouplingUMesh *MEDCouplingUMesh::keepSpecifiedCells(INTERP_KERNEL::NormalizedCellType type, const int *idsPerGeoTypeBg, const int *idsPerGeoTypeEnd) const
6252 std::vector<int> code=getDistributionOfTypes();
6253 std::size_t nOfTypesInThis=code.size()/3;
6254 int sz=0,szOfType=0;
6255 for(std::size_t i=0;i<nOfTypesInThis;i++)
6260 szOfType=code[3*i+1];
6262 for(const int *work=idsPerGeoTypeBg;work!=idsPerGeoTypeEnd;work++)
6263 if(*work<0 || *work>=szOfType)
6265 std::ostringstream oss; oss << "MEDCouplingUMesh::keepSpecifiedCells : Request on type " << type << " at place #" << std::distance(idsPerGeoTypeBg,work) << " value " << *work;
6266 oss << ". It should be in [0," << szOfType << ") !";
6267 throw INTERP_KERNEL::Exception(oss.str());
6269 MCAuto<DataArrayInt> idsTokeep=DataArrayInt::New(); idsTokeep->alloc(sz+(int)std::distance(idsPerGeoTypeBg,idsPerGeoTypeEnd),1);
6270 int *idsPtr=idsTokeep->getPointer();
6272 for(std::size_t i=0;i<nOfTypesInThis;i++)
6275 for(int j=0;j<code[3*i+1];j++)
6278 idsPtr=std::transform(idsPerGeoTypeBg,idsPerGeoTypeEnd,idsPtr,std::bind2nd(std::plus<int>(),offset));
6279 offset+=code[3*i+1];
6281 MCAuto<MEDCouplingUMesh> ret=static_cast<MEDCouplingUMesh *>(buildPartOfMySelf(idsTokeep->begin(),idsTokeep->end(),true));
6282 ret->copyTinyInfoFrom(this);
6287 * This method returns a vector of size 'this->getNumberOfCells()'.
6288 * This method retrieves for each cell in \a this if it is linear (false) or quadratic(true).
6290 std::vector<bool> MEDCouplingUMesh::getQuadraticStatus() const
6292 int ncell=getNumberOfCells();
6293 std::vector<bool> ret(ncell);
6294 const int *cI=getNodalConnectivityIndex()->begin();
6295 const int *c=getNodalConnectivity()->begin();
6296 for(int i=0;i<ncell;i++)
6298 INTERP_KERNEL::NormalizedCellType typ=(INTERP_KERNEL::NormalizedCellType)c[cI[i]];
6299 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel(typ);
6300 ret[i]=cm.isQuadratic();
6306 * Returns a newly created mesh (with ref count ==1) that contains merge of \a this and \a other.
6308 MEDCouplingMesh *MEDCouplingUMesh::mergeMyselfWith(const MEDCouplingMesh *other) const
6310 if(other->getType()!=UNSTRUCTURED)
6311 throw INTERP_KERNEL::Exception("Merge of umesh only available with umesh each other !");
6312 const MEDCouplingUMesh *otherC=static_cast<const MEDCouplingUMesh *>(other);
6313 return MergeUMeshes(this,otherC);
6317 * Returns a new DataArrayDouble holding barycenters of all cells. The barycenter is
6318 * computed by averaging coordinates of cell nodes, so this method is not a right
6319 * choice for degnerated meshes (not well oriented, cells with measure close to zero).
6320 * \return DataArrayDouble * - a new instance of DataArrayDouble, of size \a
6321 * this->getNumberOfCells() tuples per \a this->getSpaceDimension()
6322 * components. The caller is to delete this array using decrRef() as it is
6324 * \throw If the coordinates array is not set.
6325 * \throw If the nodal connectivity of cells is not defined.
6326 * \sa MEDCouplingUMesh::computeIsoBarycenterOfNodesPerCell
6328 DataArrayDouble *MEDCouplingUMesh::computeCellCenterOfMass() const
6330 MCAuto<DataArrayDouble> ret=DataArrayDouble::New();
6331 int spaceDim=getSpaceDimension();
6332 int nbOfCells=getNumberOfCells();
6333 ret->alloc(nbOfCells,spaceDim);
6334 ret->copyStringInfoFrom(*getCoords());
6335 double *ptToFill=ret->getPointer();
6336 const int *nodal=_nodal_connec->begin();
6337 const int *nodalI=_nodal_connec_index->begin();
6338 const double *coor=_coords->begin();
6339 for(int i=0;i<nbOfCells;i++)
6341 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)nodal[nodalI[i]];
6342 INTERP_KERNEL::computeBarycenter2<int,INTERP_KERNEL::ALL_C_MODE>(type,nodal+nodalI[i]+1,nodalI[i+1]-nodalI[i]-1,coor,spaceDim,ptToFill);
6349 * This method computes for each cell in \a this, the location of the iso barycenter of nodes constituting
6350 * the cell. Contrary to badly named MEDCouplingUMesh::computeCellCenterOfMass method that returns the center of inertia of the
6352 * \return a newly allocated DataArrayDouble instance that the caller has to deal with. The returned
6353 * DataArrayDouble instance will have \c this->getNumberOfCells() tuples and \c this->getSpaceDimension() components.
6355 * \sa MEDCouplingUMesh::computeCellCenterOfMass
6356 * \throw If \a this is not fully defined (coordinates and connectivity)
6357 * \throw If there is presence in nodal connectivity in \a this of node ids not in [0, \c this->getNumberOfNodes() )
6359 DataArrayDouble *MEDCouplingUMesh::computeIsoBarycenterOfNodesPerCell() const
6361 checkFullyDefined();
6362 MCAuto<DataArrayDouble> ret=DataArrayDouble::New();
6363 int spaceDim=getSpaceDimension();
6364 int nbOfCells=getNumberOfCells();
6365 int nbOfNodes=getNumberOfNodes();
6366 ret->alloc(nbOfCells,spaceDim);
6367 double *ptToFill=ret->getPointer();
6368 const int *nodal=_nodal_connec->begin();
6369 const int *nodalI=_nodal_connec_index->begin();
6370 const double *coor=_coords->begin();
6371 for(int i=0;i<nbOfCells;i++,ptToFill+=spaceDim)
6373 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)nodal[nodalI[i]];
6374 std::fill(ptToFill,ptToFill+spaceDim,0.);
6375 if(type!=INTERP_KERNEL::NORM_POLYHED)
6377 for(const int *conn=nodal+nodalI[i]+1;conn!=nodal+nodalI[i+1];conn++)
6379 if(*conn>=0 && *conn<nbOfNodes)
6380 std::transform(coor+spaceDim*conn[0],coor+spaceDim*(conn[0]+1),ptToFill,ptToFill,std::plus<double>());
6383 std::ostringstream oss; oss << "MEDCouplingUMesh::computeIsoBarycenterOfNodesPerCell : on cell #" << i << " presence of nodeId #" << *conn << " should be in [0," << nbOfNodes << ") !";
6384 throw INTERP_KERNEL::Exception(oss.str());
6387 int nbOfNodesInCell=nodalI[i+1]-nodalI[i]-1;
6388 if(nbOfNodesInCell>0)
6389 std::transform(ptToFill,ptToFill+spaceDim,ptToFill,std::bind2nd(std::multiplies<double>(),1./(double)nbOfNodesInCell));
6392 std::ostringstream oss; oss << "MEDCouplingUMesh::computeIsoBarycenterOfNodesPerCell : on cell #" << i << " presence of cell with no nodes !";
6393 throw INTERP_KERNEL::Exception(oss.str());
6398 std::set<int> s(nodal+nodalI[i]+1,nodal+nodalI[i+1]);
6400 for(std::set<int>::const_iterator it=s.begin();it!=s.end();it++)
6402 if(*it>=0 && *it<nbOfNodes)
6403 std::transform(coor+spaceDim*(*it),coor+spaceDim*((*it)+1),ptToFill,ptToFill,std::plus<double>());
6406 std::ostringstream oss; oss << "MEDCouplingUMesh::computeIsoBarycenterOfNodesPerCell : on cell polyhedron cell #" << i << " presence of nodeId #" << *it << " should be in [0," << nbOfNodes << ") !";
6407 throw INTERP_KERNEL::Exception(oss.str());
6411 std::transform(ptToFill,ptToFill+spaceDim,ptToFill,std::bind2nd(std::multiplies<double>(),1./(double)s.size()));
6414 std::ostringstream oss; oss << "MEDCouplingUMesh::computeIsoBarycenterOfNodesPerCell : on polyhedron cell #" << i << " there are no nodes !";
6415 throw INTERP_KERNEL::Exception(oss.str());
6423 * Returns a new DataArrayDouble holding barycenters of specified cells. The
6424 * barycenter is computed by averaging coordinates of cell nodes. The cells to treat
6425 * are specified via an array of cell ids.
6426 * \warning Validity of the specified cell ids is not checked!
6427 * Valid range is [ 0, \a this->getNumberOfCells() ).
6428 * \param [in] begin - an array of cell ids of interest.
6429 * \param [in] end - the end of \a begin, i.e. a pointer to its (last+1)-th element.
6430 * \return DataArrayDouble * - a new instance of DataArrayDouble, of size ( \a
6431 * end - \a begin ) tuples per \a this->getSpaceDimension() components. The
6432 * caller is to delete this array using decrRef() as it is no more needed.
6433 * \throw If the coordinates array is not set.
6434 * \throw If the nodal connectivity of cells is not defined.
6436 * \if ENABLE_EXAMPLES
6437 * \ref cpp_mcumesh_getPartBarycenterAndOwner "Here is a C++ example".<br>
6438 * \ref py_mcumesh_getPartBarycenterAndOwner "Here is a Python example".
6441 DataArrayDouble *MEDCouplingUMesh::getPartBarycenterAndOwner(const int *begin, const int *end) const
6443 DataArrayDouble *ret=DataArrayDouble::New();
6444 int spaceDim=getSpaceDimension();
6445 int nbOfTuple=(int)std::distance(begin,end);
6446 ret->alloc(nbOfTuple,spaceDim);
6447 double *ptToFill=ret->getPointer();
6448 double *tmp=new double[spaceDim];
6449 const int *nodal=_nodal_connec->begin();
6450 const int *nodalI=_nodal_connec_index->begin();
6451 const double *coor=_coords->begin();
6452 for(const int *w=begin;w!=end;w++)
6454 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)nodal[nodalI[*w]];
6455 INTERP_KERNEL::computeBarycenter2<int,INTERP_KERNEL::ALL_C_MODE>(type,nodal+nodalI[*w]+1,nodalI[*w+1]-nodalI[*w]-1,coor,spaceDim,ptToFill);
6463 * Returns a DataArrayDouble instance giving for each cell in \a this the equation of plane given by "a*X+b*Y+c*Z+d=0".
6464 * So the returned instance will have 4 components and \c this->getNumberOfCells() tuples.
6465 * So this method expects that \a this has a spaceDimension equal to 3 and meshDimension equal to 2.
6466 * The computation of the plane equation is done using each time the 3 first nodes of 2D cells.
6467 * This method is useful to detect 2D cells in 3D space that are not coplanar.
6469 * \return DataArrayDouble * - a new instance of DataArrayDouble having 4 components and a number of tuples equal to number of cells in \a this.
6470 * \throw If spaceDim!=3 or meshDim!=2.
6471 * \throw If connectivity of \a this is invalid.
6472 * \throw If connectivity of a cell in \a this points to an invalid node.
6474 DataArrayDouble *MEDCouplingUMesh::computePlaneEquationOf3DFaces() const
6476 MCAuto<DataArrayDouble> ret(DataArrayDouble::New());
6477 int nbOfCells(getNumberOfCells()),nbOfNodes(getNumberOfNodes());
6478 if(getSpaceDimension()!=3 || getMeshDimension()!=2)
6479 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::computePlaneEquationOf3DFaces : This method must be applied on a mesh having meshDimension equal 2 and a spaceDimension equal to 3 !");
6480 ret->alloc(nbOfCells,4);
6481 double *retPtr(ret->getPointer());
6482 const int *nodal(_nodal_connec->begin()),*nodalI(_nodal_connec_index->begin());
6483 const double *coor(_coords->begin());
6484 for(int i=0;i<nbOfCells;i++,nodalI++,retPtr+=4)
6486 double matrix[16]={0,0,0,1,0,0,0,1,0,0,0,1,1,1,1,0},matrix2[16];
6487 if(nodalI[1]-nodalI[0]>=4)
6489 double aa[3]={coor[nodal[nodalI[0]+1+1]*3+0]-coor[nodal[nodalI[0]+1+0]*3+0],
6490 coor[nodal[nodalI[0]+1+1]*3+1]-coor[nodal[nodalI[0]+1+0]*3+1],
6491 coor[nodal[nodalI[0]+1+1]*3+2]-coor[nodal[nodalI[0]+1+0]*3+2]}
6492 ,bb[3]={coor[nodal[nodalI[0]+1+2]*3+0]-coor[nodal[nodalI[0]+1+0]*3+0],
6493 coor[nodal[nodalI[0]+1+2]*3+1]-coor[nodal[nodalI[0]+1+0]*3+1],
6494 coor[nodal[nodalI[0]+1+2]*3+2]-coor[nodal[nodalI[0]+1+0]*3+2]};
6495 double cc[3]={aa[1]*bb[2]-aa[2]*bb[1],aa[2]*bb[0]-aa[0]*bb[2],aa[0]*bb[1]-aa[1]*bb[0]};
6496 for(int j=0;j<3;j++)
6498 int nodeId(nodal[nodalI[0]+1+j]);
6499 if(nodeId>=0 && nodeId<nbOfNodes)
6500 std::copy(coor+nodeId*3,coor+(nodeId+1)*3,matrix+4*j);
6503 std::ostringstream oss; oss << "MEDCouplingUMesh::computePlaneEquationOf3DFaces : invalid 2D cell #" << i << " ! This cell points to an invalid nodeId : " << nodeId << " !";
6504 throw INTERP_KERNEL::Exception(oss.str());
6507 if(sqrt(cc[0]*cc[0]+cc[1]*cc[1]+cc[2]*cc[2])>1e-7)
6509 INTERP_KERNEL::inverseMatrix(matrix,4,matrix2);
6510 retPtr[0]=matrix2[3]; retPtr[1]=matrix2[7]; retPtr[2]=matrix2[11]; retPtr[3]=matrix2[15];
6514 if(nodalI[1]-nodalI[0]==4)
6516 std::ostringstream oss; oss << "MEDCouplingUMesh::computePlaneEquationOf3DFaces : cell" << i << " : Presence of The 3 colinear points !";
6517 throw INTERP_KERNEL::Exception(oss.str());
6520 double dd[3]={0.,0.,0.};
6521 for(int offset=nodalI[0]+1;offset<nodalI[1];offset++)
6522 std::transform(coor+3*nodal[offset],coor+3*(nodal[offset]+1),dd,dd,std::plus<double>());
6523 int nbOfNodesInCell(nodalI[1]-nodalI[0]-1);
6524 std::transform(dd,dd+3,dd,std::bind2nd(std::multiplies<double>(),1./(double)nbOfNodesInCell));
6525 std::copy(dd,dd+3,matrix+4*2);
6526 INTERP_KERNEL::inverseMatrix(matrix,4,matrix2);
6527 retPtr[0]=matrix2[3]; retPtr[1]=matrix2[7]; retPtr[2]=matrix2[11]; retPtr[3]=matrix2[15];
6532 std::ostringstream oss; oss << "MEDCouplingUMesh::computePlaneEquationOf3DFaces : invalid 2D cell #" << i << " ! Must be constitued by more than 3 nodes !";
6533 throw INTERP_KERNEL::Exception(oss.str());
6540 * This method expects as input a DataArrayDouble non nul instance 'da' that should be allocated. If not an exception is thrown.
6543 MEDCouplingUMesh *MEDCouplingUMesh::Build0DMeshFromCoords(DataArrayDouble *da)
6546 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::Build0DMeshFromCoords : instance of DataArrayDouble must be not null !");
6547 da->checkAllocated();
6548 std::string name(da->getName());
6549 MCAuto<MEDCouplingUMesh> ret(MEDCouplingUMesh::New(name,0));
6551 ret->setName("Mesh");
6553 int nbOfTuples(da->getNumberOfTuples());
6554 MCAuto<DataArrayInt> c(DataArrayInt::New()),cI(DataArrayInt::New());
6555 c->alloc(2*nbOfTuples,1);
6556 cI->alloc(nbOfTuples+1,1);
6557 int *cp(c->getPointer()),*cip(cI->getPointer());
6559 for(int i=0;i<nbOfTuples;i++)
6561 *cp++=INTERP_KERNEL::NORM_POINT1;
6565 ret->setConnectivity(c,cI,true);
6569 MCAuto<MEDCouplingUMesh> MEDCouplingUMesh::Build1DMeshFromCoords(DataArrayDouble *da)
6572 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::Build01MeshFromCoords : instance of DataArrayDouble must be not null !");
6573 da->checkAllocated();
6574 std::string name(da->getName());
6575 MCAuto<MEDCouplingUMesh> ret;
6577 MCAuto<MEDCouplingCMesh> tmp(MEDCouplingCMesh::New());
6578 MCAuto<DataArrayDouble> arr(DataArrayDouble::New());
6579 arr->alloc(da->getNumberOfTuples());
6580 tmp->setCoordsAt(0,arr);
6581 ret=tmp->buildUnstructured();
6585 ret->setName("Mesh");
6592 * Creates a new MEDCouplingUMesh by concatenating two given meshes of the same dimension.
6593 * Cells and nodes of
6594 * the first mesh precede cells and nodes of the second mesh within the result mesh.
6595 * \param [in] mesh1 - the first mesh.
6596 * \param [in] mesh2 - the second mesh.
6597 * \return MEDCouplingUMesh * - the result mesh. It is a new instance of
6598 * MEDCouplingUMesh. The caller is to delete this mesh using decrRef() as it
6599 * is no more needed.
6600 * \throw If \a mesh1 == NULL or \a mesh2 == NULL.
6601 * \throw If the coordinates array is not set in none of the meshes.
6602 * \throw If \a mesh1->getMeshDimension() < 0 or \a mesh2->getMeshDimension() < 0.
6603 * \throw If \a mesh1->getMeshDimension() != \a mesh2->getMeshDimension().
6605 MEDCouplingUMesh *MEDCouplingUMesh::MergeUMeshes(const MEDCouplingUMesh *mesh1, const MEDCouplingUMesh *mesh2)
6607 std::vector<const MEDCouplingUMesh *> tmp(2);
6608 tmp[0]=const_cast<MEDCouplingUMesh *>(mesh1); tmp[1]=const_cast<MEDCouplingUMesh *>(mesh2);
6609 return MergeUMeshes(tmp);
6613 * Creates a new MEDCouplingUMesh by concatenating all given meshes of the same dimension.
6614 * Cells and nodes of
6615 * the *i*-th mesh precede cells and nodes of the (*i*+1)-th mesh within the result mesh.
6616 * \param [in] a - a vector of meshes (MEDCouplingUMesh) to concatenate.
6617 * \return MEDCouplingUMesh * - the result mesh. It is a new instance of
6618 * MEDCouplingUMesh. The caller is to delete this mesh using decrRef() as it
6619 * is no more needed.
6620 * \throw If \a a.size() == 0.
6621 * \throw If \a a[ *i* ] == NULL.
6622 * \throw If the coordinates array is not set in none of the meshes.
6623 * \throw If \a a[ *i* ]->getMeshDimension() < 0.
6624 * \throw If the meshes in \a a are of different dimension (getMeshDimension()).
6626 MEDCouplingUMesh *MEDCouplingUMesh::MergeUMeshes(const std::vector<const MEDCouplingUMesh *>& a)
6628 std::size_t sz=a.size();
6630 return MergeUMeshesLL(a);
6631 for(std::size_t ii=0;ii<sz;ii++)
6634 std::ostringstream oss; oss << "MEDCouplingUMesh::MergeUMeshes : item #" << ii << " in input array of size "<< sz << " is empty !";
6635 throw INTERP_KERNEL::Exception(oss.str());
6637 std::vector< MCAuto<MEDCouplingUMesh> > bb(sz);
6638 std::vector< const MEDCouplingUMesh * > aa(sz);
6640 for(std::size_t i=0;i<sz && spaceDim==-3;i++)
6642 const MEDCouplingUMesh *cur=a[i];
6643 const DataArrayDouble *coo=cur->getCoords();
6645 spaceDim=coo->getNumberOfComponents();
6648 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::MergeUMeshes : no spaceDim specified ! unable to perform merge !");
6649 for(std::size_t i=0;i<sz;i++)
6651 bb[i]=a[i]->buildSetInstanceFromThis(spaceDim);
6654 return MergeUMeshesLL(aa);
6658 * Creates a new MEDCouplingUMesh by concatenating cells of two given meshes of same
6659 * dimension and sharing the node coordinates array.
6660 * All cells of the first mesh precede all cells of the second mesh
6661 * within the result mesh.
6662 * \param [in] mesh1 - the first mesh.
6663 * \param [in] mesh2 - the second mesh.
6664 * \return MEDCouplingUMesh * - the result mesh. It is a new instance of
6665 * MEDCouplingUMesh. The caller is to delete this mesh using decrRef() as it
6666 * is no more needed.
6667 * \throw If \a mesh1 == NULL or \a mesh2 == NULL.
6668 * \throw If the meshes do not share the node coordinates array.
6669 * \throw If \a mesh1->getMeshDimension() < 0 or \a mesh2->getMeshDimension() < 0.
6670 * \throw If \a mesh1->getMeshDimension() != \a mesh2->getMeshDimension().
6672 MEDCouplingUMesh *MEDCouplingUMesh::MergeUMeshesOnSameCoords(const MEDCouplingUMesh *mesh1, const MEDCouplingUMesh *mesh2)
6674 std::vector<const MEDCouplingUMesh *> tmp(2);
6675 tmp[0]=mesh1; tmp[1]=mesh2;
6676 return MergeUMeshesOnSameCoords(tmp);
6680 * Creates a new MEDCouplingUMesh by concatenating cells of all given meshes of same
6681 * dimension and sharing the node coordinates array.
6682 * All cells of the *i*-th mesh precede all cells of the
6683 * (*i*+1)-th mesh within the result mesh.
6684 * \param [in] meshes - a vector of meshes (MEDCouplingUMesh) to concatenate.
6685 * \return MEDCouplingUMesh * - the result mesh. It is a new instance of
6686 * MEDCouplingUMesh. The caller is to delete this mesh using decrRef() as it
6687 * is no more needed.
6688 * \throw If \a a.size() == 0.
6689 * \throw If \a a[ *i* ] == NULL.
6690 * \throw If the meshes do not share the node coordinates array.
6691 * \throw If \a a[ *i* ]->getMeshDimension() < 0.
6692 * \throw If the meshes in \a a are of different dimension (getMeshDimension()).
6694 MEDCouplingUMesh *MEDCouplingUMesh::MergeUMeshesOnSameCoords(const std::vector<const MEDCouplingUMesh *>& meshes)
6697 throw INTERP_KERNEL::Exception("meshes input parameter is expected to be non empty.");
6698 for(std::size_t ii=0;ii<meshes.size();ii++)
6701 std::ostringstream oss; oss << "MEDCouplingUMesh::MergeUMeshesOnSameCoords : item #" << ii << " in input array of size "<< meshes.size() << " is empty !";
6702 throw INTERP_KERNEL::Exception(oss.str());
6704 const DataArrayDouble *coords=meshes.front()->getCoords();
6705 int meshDim=meshes.front()->getMeshDimension();
6706 std::vector<const MEDCouplingUMesh *>::const_iterator iter=meshes.begin();
6708 int meshIndexLgth=0;
6709 for(;iter!=meshes.end();iter++)
6711 if(coords!=(*iter)->getCoords())
6712 throw INTERP_KERNEL::Exception("meshes does not share the same coords ! Try using tryToShareSameCoords method !");
6713 if(meshDim!=(*iter)->getMeshDimension())
6714 throw INTERP_KERNEL::Exception("Mesh dimensions mismatches, FuseUMeshesOnSameCoords impossible !");
6715 meshLgth+=(*iter)->getNodalConnectivityArrayLen();
6716 meshIndexLgth+=(*iter)->getNumberOfCells();
6718 MCAuto<DataArrayInt> nodal=DataArrayInt::New();
6719 nodal->alloc(meshLgth,1);
6720 int *nodalPtr=nodal->getPointer();
6721 MCAuto<DataArrayInt> nodalIndex=DataArrayInt::New();
6722 nodalIndex->alloc(meshIndexLgth+1,1);
6723 int *nodalIndexPtr=nodalIndex->getPointer();
6725 for(iter=meshes.begin();iter!=meshes.end();iter++)
6727 const int *nod=(*iter)->getNodalConnectivity()->begin();
6728 const int *index=(*iter)->getNodalConnectivityIndex()->begin();
6729 int nbOfCells=(*iter)->getNumberOfCells();
6730 int meshLgth2=(*iter)->getNodalConnectivityArrayLen();
6731 nodalPtr=std::copy(nod,nod+meshLgth2,nodalPtr);
6732 if(iter!=meshes.begin())
6733 nodalIndexPtr=std::transform(index+1,index+nbOfCells+1,nodalIndexPtr,std::bind2nd(std::plus<int>(),offset));
6735 nodalIndexPtr=std::copy(index,index+nbOfCells+1,nodalIndexPtr);
6738 MEDCouplingUMesh *ret=MEDCouplingUMesh::New();
6739 ret->setName("merge");
6740 ret->setMeshDimension(meshDim);
6741 ret->setConnectivity(nodal,nodalIndex,true);
6742 ret->setCoords(coords);
6747 * Creates a new MEDCouplingUMesh by concatenating cells of all given meshes of same
6748 * dimension and sharing the node coordinates array. Cells of the *i*-th mesh precede
6749 * cells of the (*i*+1)-th mesh within the result mesh. Duplicates of cells are
6750 * removed from \a this mesh and arrays mapping between new and old cell ids in "Old to
6751 * New" mode are returned for each input mesh.
6752 * \param [in] meshes - a vector of meshes (MEDCouplingUMesh) to concatenate.
6753 * \param [in] compType - specifies a cell comparison technique. For meaning of its
6754 * valid values [0,1,2], see zipConnectivityTraducer().
6755 * \param [in,out] corr - an array of DataArrayInt, of the same size as \a
6756 * meshes. The *i*-th array describes cell ids mapping for \a meshes[ *i* ]
6757 * mesh. The caller is to delete each of the arrays using decrRef() as it is
6759 * \return MEDCouplingUMesh * - the result mesh. It is a new instance of
6760 * MEDCouplingUMesh. The caller is to delete this mesh using decrRef() as it
6761 * is no more needed.
6762 * \throw If \a meshes.size() == 0.
6763 * \throw If \a meshes[ *i* ] == NULL.
6764 * \throw If the meshes do not share the node coordinates array.
6765 * \throw If \a meshes[ *i* ]->getMeshDimension() < 0.
6766 * \throw If the \a meshes are of different dimension (getMeshDimension()).
6767 * \throw If the nodal connectivity of cells of any of \a meshes is not defined.
6768 * \throw If the nodal connectivity any of \a meshes includes an invalid id.
6770 MEDCouplingUMesh *MEDCouplingUMesh::FuseUMeshesOnSameCoords(const std::vector<const MEDCouplingUMesh *>& meshes, int compType, std::vector<DataArrayInt *>& corr)
6772 //All checks are delegated to MergeUMeshesOnSameCoords
6773 MCAuto<MEDCouplingUMesh> ret=MergeUMeshesOnSameCoords(meshes);
6774 MCAuto<DataArrayInt> o2n=ret->zipConnectivityTraducer(compType);
6775 corr.resize(meshes.size());
6776 std::size_t nbOfMeshes=meshes.size();
6778 const int *o2nPtr=o2n->begin();
6779 for(std::size_t i=0;i<nbOfMeshes;i++)
6781 DataArrayInt *tmp=DataArrayInt::New();
6782 int curNbOfCells=meshes[i]->getNumberOfCells();
6783 tmp->alloc(curNbOfCells,1);
6784 std::copy(o2nPtr+offset,o2nPtr+offset+curNbOfCells,tmp->getPointer());
6785 offset+=curNbOfCells;
6786 tmp->setName(meshes[i]->getName());
6793 * Makes all given meshes share the nodal connectivity array. The common connectivity
6794 * array is created by concatenating the connectivity arrays of all given meshes. All
6795 * the given meshes must be of the same space dimension but dimension of cells **can
6796 * differ**. This method is particularly useful in MEDLoader context to build a \ref
6797 * MEDCoupling::MEDFileUMesh "MEDFileUMesh" instance that expects that underlying
6798 * MEDCouplingUMesh'es of different dimension share the same nodal connectivity array.
6799 * \param [in,out] meshes - a vector of meshes to update.
6800 * \throw If any of \a meshes is NULL.
6801 * \throw If the coordinates array is not set in any of \a meshes.
6802 * \throw If the nodal connectivity of cells is not defined in any of \a meshes.
6803 * \throw If \a meshes are of different space dimension.
6805 void MEDCouplingUMesh::PutUMeshesOnSameAggregatedCoords(const std::vector<MEDCouplingUMesh *>& meshes)
6807 std::size_t sz=meshes.size();
6810 std::vector< const DataArrayDouble * > coords(meshes.size());
6811 std::vector< const DataArrayDouble * >::iterator it2=coords.begin();
6812 for(std::vector<MEDCouplingUMesh *>::const_iterator it=meshes.begin();it!=meshes.end();it++,it2++)
6816 (*it)->checkConnectivityFullyDefined();
6817 const DataArrayDouble *coo=(*it)->getCoords();
6822 std::ostringstream oss; oss << " MEDCouplingUMesh::PutUMeshesOnSameAggregatedCoords : Item #" << std::distance(meshes.begin(),it) << " inside the vector of length " << meshes.size();
6823 oss << " has no coordinate array defined !";
6824 throw INTERP_KERNEL::Exception(oss.str());
6829 std::ostringstream oss; oss << " MEDCouplingUMesh::PutUMeshesOnSameAggregatedCoords : Item #" << std::distance(meshes.begin(),it) << " inside the vector of length " << meshes.size();
6830 oss << " is null !";
6831 throw INTERP_KERNEL::Exception(oss.str());
6834 MCAuto<DataArrayDouble> res=DataArrayDouble::Aggregate(coords);
6835 std::vector<MEDCouplingUMesh *>::const_iterator it=meshes.begin();
6836 int offset=(*it)->getNumberOfNodes();
6837 (*it++)->setCoords(res);
6838 for(;it!=meshes.end();it++)
6840 int oldNumberOfNodes=(*it)->getNumberOfNodes();
6841 (*it)->setCoords(res);
6842 (*it)->shiftNodeNumbersInConn(offset);
6843 offset+=oldNumberOfNodes;
6848 * Merges nodes coincident with a given precision within all given meshes that share
6849 * the nodal connectivity array. The given meshes **can be of different** mesh
6850 * dimension. This method is particularly useful in MEDLoader context to build a \ref
6851 * MEDCoupling::MEDFileUMesh "MEDFileUMesh" instance that expects that underlying
6852 * MEDCouplingUMesh'es of different dimension share the same nodal connectivity array.
6853 * \param [in,out] meshes - a vector of meshes to update.
6854 * \param [in] eps - the precision used to detect coincident nodes (infinite norm).
6855 * \throw If any of \a meshes is NULL.
6856 * \throw If the \a meshes do not share the same node coordinates array.
6857 * \throw If the nodal connectivity of cells is not defined in any of \a meshes.
6859 void MEDCouplingUMesh::MergeNodesOnUMeshesSharingSameCoords(const std::vector<MEDCouplingUMesh *>& meshes, double eps)
6863 std::set<const DataArrayDouble *> s;
6864 for(std::vector<MEDCouplingUMesh *>::const_iterator it=meshes.begin();it!=meshes.end();it++)
6867 s.insert((*it)->getCoords());
6870 std::ostringstream oss; oss << "MEDCouplingUMesh::MergeNodesOnUMeshesSharingSameCoords : In input vector of unstructured meshes of size " << meshes.size() << " the element #" << std::distance(meshes.begin(),it) << " is null !";
6871 throw INTERP_KERNEL::Exception(oss.str());
6876 std::ostringstream oss; oss << "MEDCouplingUMesh::MergeNodesOnUMeshesSharingSameCoords : In input vector of unstructured meshes of size " << meshes.size() << ", it appears that they do not share the same instance of DataArrayDouble for coordiantes ! tryToShareSameCoordsPermute method can help to reach that !";
6877 throw INTERP_KERNEL::Exception(oss.str());
6879 const DataArrayDouble *coo=*(s.begin());
6883 DataArrayInt *comm,*commI;
6884 coo->findCommonTuples(eps,-1,comm,commI);
6885 MCAuto<DataArrayInt> tmp1(comm),tmp2(commI);
6886 int oldNbOfNodes=coo->getNumberOfTuples();
6888 MCAuto<DataArrayInt> o2n=DataArrayInt::ConvertIndexArrayToO2N(oldNbOfNodes,comm->begin(),commI->begin(),commI->end(),newNbOfNodes);
6889 if(oldNbOfNodes==newNbOfNodes)
6891 MCAuto<DataArrayDouble> newCoords=coo->renumberAndReduce(o2n->begin(),newNbOfNodes);
6892 for(std::vector<MEDCouplingUMesh *>::const_iterator it=meshes.begin();it!=meshes.end();it++)
6894 (*it)->renumberNodesInConn(o2n->begin());
6895 (*it)->setCoords(newCoords);
6901 * This static operates only for coords in 3D. The polygon is specified by its connectivity nodes in [ \a begin , \a end ).
6903 bool MEDCouplingUMesh::IsPolygonWellOriented(bool isQuadratic, const double *vec, const int *begin, const int *end, const double *coords)
6906 double v[3]={0.,0.,0.};
6907 std::size_t sz=std::distance(begin,end);
6912 v[0]+=coords[3*begin[i]+1]*coords[3*begin[(i+1)%sz]+2]-coords[3*begin[i]+2]*coords[3*begin[(i+1)%sz]+1];
6913 v[1]+=coords[3*begin[i]+2]*coords[3*begin[(i+1)%sz]]-coords[3*begin[i]]*coords[3*begin[(i+1)%sz]+2];
6914 v[2]+=coords[3*begin[i]]*coords[3*begin[(i+1)%sz]+1]-coords[3*begin[i]+1]*coords[3*begin[(i+1)%sz]];
6916 double ret = vec[0]*v[0]+vec[1]*v[1]+vec[2]*v[2];
6918 // Try using quadratic points if standard points are degenerated (for example a QPOLYG with two
6919 // SEG3 forming a circle):
6920 if (fabs(ret) < INTERP_KERNEL::DEFAULT_ABS_TOL && isQuadratic)
6922 v[0] = 0.0; v[1] = 0.0; v[2] = 0.0;
6923 for(std::size_t j=0;j<sz;j++)
6925 if (j%2) // current point i is quadratic, next point i+1 is standard
6928 ip1 = (j+1)%sz; // ip1 = "i+1"
6930 else // current point i is standard, next point i+1 is quadratic
6935 v[0]+=coords[3*begin[i]+1]*coords[3*begin[ip1]+2]-coords[3*begin[i]+2]*coords[3*begin[ip1]+1];
6936 v[1]+=coords[3*begin[i]+2]*coords[3*begin[ip1]]-coords[3*begin[i]]*coords[3*begin[ip1]+2];
6937 v[2]+=coords[3*begin[i]]*coords[3*begin[ip1]+1]-coords[3*begin[i]+1]*coords[3*begin[ip1]];
6939 ret = vec[0]*v[0]+vec[1]*v[1]+vec[2]*v[2];
6945 * The polyhedron is specified by its connectivity nodes in [ \a begin , \a end ).
6947 bool MEDCouplingUMesh::IsPolyhedronWellOriented(const int *begin, const int *end, const double *coords)
6949 std::vector<std::pair<int,int> > edges;
6950 std::size_t nbOfFaces=std::count(begin,end,-1)+1;
6951 const int *bgFace=begin;
6952 for(std::size_t i=0;i<nbOfFaces;i++)
6954 const int *endFace=std::find(bgFace+1,end,-1);
6955 std::size_t nbOfEdgesInFace=std::distance(bgFace,endFace);
6956 for(std::size_t j=0;j<nbOfEdgesInFace;j++)
6958 std::pair<int,int> p1(bgFace[j],bgFace[(j+1)%nbOfEdgesInFace]);
6959 if(std::find(edges.begin(),edges.end(),p1)!=edges.end())
6961 edges.push_back(p1);
6965 return INTERP_KERNEL::calculateVolumeForPolyh2<int,INTERP_KERNEL::ALL_C_MODE>(begin,(int)std::distance(begin,end),coords)>-EPS_FOR_POLYH_ORIENTATION;
6969 * The 3D extruded static cell (PENTA6,HEXA8,HEXAGP12...) its connectivity nodes in [ \a begin , \a end ).
6971 bool MEDCouplingUMesh::Is3DExtrudedStaticCellWellOriented(const int *begin, const int *end, const double *coords)
6973 double vec0[3],vec1[3];
6974 std::size_t sz=std::distance(begin,end);
6976 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::Is3DExtrudedStaticCellWellOriented : the length of nodal connectivity of extruded cell is not even !");
6977 int nbOfNodes=(int)sz/2;
6978 INTERP_KERNEL::areaVectorOfPolygon<int,INTERP_KERNEL::ALL_C_MODE>(begin,nbOfNodes,coords,vec0);
6979 const double *pt0=coords+3*begin[0];
6980 const double *pt1=coords+3*begin[nbOfNodes];
6981 vec1[0]=pt1[0]-pt0[0]; vec1[1]=pt1[1]-pt0[1]; vec1[2]=pt1[2]-pt0[2];
6982 return (vec0[0]*vec1[0]+vec0[1]*vec1[1]+vec0[2]*vec1[2])<0.;
6985 void MEDCouplingUMesh::CorrectExtrudedStaticCell(int *begin, int *end)
6987 std::size_t sz=std::distance(begin,end);
6988 INTERP_KERNEL::AutoPtr<int> tmp=new int[sz];
6989 std::size_t nbOfNodes(sz/2);
6990 std::copy(begin,end,(int *)tmp);
6991 for(std::size_t j=1;j<nbOfNodes;j++)
6993 begin[j]=tmp[nbOfNodes-j];
6994 begin[j+nbOfNodes]=tmp[nbOfNodes+nbOfNodes-j];
6998 bool MEDCouplingUMesh::IsTetra4WellOriented(const int *begin, const int *end, const double *coords)
7000 std::size_t sz=std::distance(begin,end);
7002 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::IsTetra4WellOriented : Tetra4 cell with not 4 nodes ! Call checkConsistency !");
7003 double vec0[3],vec1[3];
7004 const double *pt0=coords+3*begin[0],*pt1=coords+3*begin[1],*pt2=coords+3*begin[2],*pt3=coords+3*begin[3];
7005 vec0[0]=pt1[0]-pt0[0]; vec0[1]=pt1[1]-pt0[1]; vec0[2]=pt1[2]-pt0[2]; vec1[0]=pt2[0]-pt0[0]; vec1[1]=pt2[1]-pt0[1]; vec1[2]=pt2[2]-pt0[2];
7006 return ((vec0[1]*vec1[2]-vec0[2]*vec1[1])*(pt3[0]-pt0[0])+(vec0[2]*vec1[0]-vec0[0]*vec1[2])*(pt3[1]-pt0[1])+(vec0[0]*vec1[1]-vec0[1]*vec1[0])*(pt3[2]-pt0[2]))<0;
7009 bool MEDCouplingUMesh::IsPyra5WellOriented(const int *begin, const int *end, const double *coords)
7011 std::size_t sz=std::distance(begin,end);
7013 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::IsPyra5WellOriented : Pyra5 cell with not 5 nodes ! Call checkConsistency !");
7015 INTERP_KERNEL::areaVectorOfPolygon<int,INTERP_KERNEL::ALL_C_MODE>(begin,4,coords,vec0);
7016 const double *pt0=coords+3*begin[0],*pt1=coords+3*begin[4];
7017 return (vec0[0]*(pt1[0]-pt0[0])+vec0[1]*(pt1[1]-pt0[1])+vec0[2]*(pt1[2]-pt0[2]))<0.;
7021 * This method performs a simplyfication of a single polyedron cell. To do that each face of cell whose connectivity is defined by [ \b begin , \b end )
7022 * is compared with the others in order to find faces in the same plane (with approx of eps). If any, the cells are grouped together and projected to
7025 * \param [in] eps is a relative precision that allows to establish if some 3D plane are coplanar or not.
7026 * \param [in] coords the coordinates with nb of components exactly equal to 3
7027 * \param [in] begin begin of the nodal connectivity (geometric type included) of a single polyhedron cell
7028 * \param [in] end end of nodal connectivity of a single polyhedron cell (excluded)
7029 * \param [out] res the result is put at the end of the vector without any alteration of the data.
7031 void MEDCouplingUMesh::SimplifyPolyhedronCell(double eps, const DataArrayDouble *coords, int index, DataArrayInt *res, MEDCouplingUMesh *faces,
7032 DataArrayInt *E_Fi, DataArrayInt *E_F, DataArrayInt *F_Ei, DataArrayInt *F_E)
7034 int nbFaces = E_Fi->getIJ(index + 1, 0) - E_Fi->getIJ(index, 0);
7035 MCAuto<DataArrayDouble> v=DataArrayDouble::New(); v->alloc(nbFaces,3);
7036 double *vPtr=v->getPointer();
7037 MCAuto<DataArrayDouble> p=DataArrayDouble::New(); p->alloc(nbFaces,2);
7038 double *pPtr=p->getPointer();
7039 int *e_fi = E_Fi->getPointer(), *e_f = E_F->getPointer(), *f_ei = F_Ei->getPointer(), *f_e = F_E->getPointer();
7040 const int *f_idx = faces->getNodalConnectivityIndex()->getPointer(), *f_cnn = faces->getNodalConnectivity()->getPointer();
7041 for(int i=0;i<nbFaces;i++,vPtr+=3,pPtr++)
7043 int face = e_f[e_fi[index] + i];
7044 ComputeVecAndPtOfFace(eps, coords->begin(), f_cnn + f_idx[face] + 1, f_cnn + f_idx[face + 1], vPtr, pPtr);
7045 // to differentiate faces going to different cells:
7047 for (int j = f_ei[face]; j < f_ei[face + 1]; j++)
7050 pPtr=p->getPointer(); vPtr=v->getPointer();
7051 DataArrayInt *comm1=0,*commI1=0;
7052 v->findCommonTuples(eps,-1,comm1,commI1);
7053 for (int i = 0; i < nbFaces; i++)
7054 if (comm1->findIdFirstEqual(i) < 0)
7056 comm1->pushBackSilent(i);
7057 commI1->pushBackSilent(comm1->getNumberOfTuples());
7059 MCAuto<DataArrayInt> comm1Auto(comm1),commI1Auto(commI1);
7060 const int *comm1Ptr=comm1->begin();
7061 const int *commI1Ptr=commI1->begin();
7062 int nbOfGrps1=commI1Auto->getNumberOfTuples()-1;
7063 res->pushBackSilent((int)INTERP_KERNEL::NORM_POLYHED);
7065 for(int i=0;i<nbOfGrps1;i++)
7067 int vecId=comm1Ptr[commI1Ptr[i]];
7068 MCAuto<DataArrayDouble> tmpgrp2=p->selectByTupleId(comm1Ptr+commI1Ptr[i],comm1Ptr+commI1Ptr[i+1]);
7069 DataArrayInt *comm2=0,*commI2=0;
7070 tmpgrp2->findCommonTuples(eps,-1,comm2,commI2);
7071 for (int j = 0; j < commI1Ptr[i+1] - commI1Ptr[i]; j++)
7072 if (comm2->findIdFirstEqual(j) < 0)
7074 comm2->pushBackSilent(j);
7075 commI2->pushBackSilent(comm2->getNumberOfTuples());
7077 MCAuto<DataArrayInt> comm2Auto(comm2),commI2Auto(commI2);
7078 const int *comm2Ptr=comm2->begin();
7079 const int *commI2Ptr=commI2->begin();
7080 int nbOfGrps2=commI2Auto->getNumberOfTuples()-1;
7081 for(int j=0;j<nbOfGrps2;j++)
7083 if(commI2Ptr[j+1] == commI2Ptr[j] + 1)
7085 int face = e_f[e_fi[index] + comm1Ptr[commI1Ptr[i] + comm2Ptr[commI2Ptr[j]]]]; //hmmm
7086 res->insertAtTheEnd(f_cnn + f_idx[face] + 1, f_cnn + f_idx[face + 1]);
7087 res->pushBackSilent(-1);
7091 int pointId=comm1Ptr[commI1Ptr[i]+comm2Ptr[commI2Ptr[j]]];
7092 MCAuto<DataArrayInt> ids2=comm2->selectByTupleIdSafeSlice(commI2Ptr[j],commI2Ptr[j+1],1);
7093 ids2->transformWithIndArr(comm1Ptr+commI1Ptr[i],comm1Ptr+commI1Ptr[i+1]);
7094 ids2->transformWithIndArr(e_f + e_fi[index], e_f + e_fi[index + 1]);
7095 MCAuto<MEDCouplingUMesh> mm3=static_cast<MEDCouplingUMesh *>(faces->buildPartOfMySelf(ids2->begin(),ids2->end(),true));
7096 MCAuto<DataArrayInt> idsNodeTmp=mm3->zipCoordsTraducer();
7097 MCAuto<DataArrayInt> idsNode=idsNodeTmp->invertArrayO2N2N2O(mm3->getNumberOfNodes());
7098 const int *idsNodePtr=idsNode->begin();
7099 double center[3]; center[0]=pPtr[2*pointId]*vPtr[3*vecId]; center[1]=pPtr[2*pointId]*vPtr[3*vecId+1]; center[2]=pPtr[2*pointId]*vPtr[3*vecId+2];
7100 double vec[3]; vec[0]=vPtr[3*vecId+1]; vec[1]=-vPtr[3*vecId]; vec[2]=0.;
7101 double norm=vec[0]*vec[0]+vec[1]*vec[1]+vec[2]*vec[2];
7102 if(std::abs(norm)>eps)
7104 double angle=INTERP_KERNEL::EdgeArcCircle::SafeAsin(norm);
7105 mm3->rotate(center,vec,angle);
7107 mm3->changeSpaceDimension(2);
7108 MCAuto<MEDCouplingUMesh> mm4=mm3->buildSpreadZonesWithPoly();
7109 const int *conn4=mm4->getNodalConnectivity()->begin();
7110 const int *connI4=mm4->getNodalConnectivityIndex()->begin();
7111 int nbOfCells=mm4->getNumberOfCells();
7112 for(int k=0;k<nbOfCells;k++)
7115 for(const int *work=conn4+connI4[k]+1;work!=conn4+connI4[k+1];work++,l++)
7116 res->pushBackSilent(idsNodePtr[*work]);
7117 res->pushBackSilent(-1);
7122 res->popBackSilent();
7126 * This method computes the normalized vector of the plane and the pos of the point belonging to the plane and the line defined by the vector going
7127 * through origin. The plane is defined by its nodal connectivity [ \b begin, \b end ).
7129 * \param [in] eps below that value the dot product of 2 vectors is considered as colinears
7130 * \param [in] coords coordinates expected to have 3 components.
7131 * \param [in] begin start of the nodal connectivity of the face.
7132 * \param [in] end end of the nodal connectivity (excluded) of the face.
7133 * \param [out] v the normalized vector of size 3
7134 * \param [out] p the pos of plane
7136 void MEDCouplingUMesh::ComputeVecAndPtOfFace(double eps, const double *coords, const int *begin, const int *end, double *v, double *p)
7138 std::size_t nbPoints=std::distance(begin,end);
7140 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ComputeVecAndPtOfFace : < of 3 points in face ! not able to find a plane on that face !");
7141 double vec[3]={0.,0.,0.};
7143 bool refFound=false;
7144 for(;j<nbPoints-1 && !refFound;j++)
7146 vec[0]=coords[3*begin[j+1]]-coords[3*begin[j]];
7147 vec[1]=coords[3*begin[j+1]+1]-coords[3*begin[j]+1];
7148 vec[2]=coords[3*begin[j+1]+2]-coords[3*begin[j]+2];
7149 double norm=sqrt(vec[0]*vec[0]+vec[1]*vec[1]+vec[2]*vec[2]);
7153 vec[0]/=norm; vec[1]/=norm; vec[2]/=norm;
7156 for(std::size_t i=j;i<nbPoints-1;i++)
7159 curVec[0]=coords[3*begin[i+1]]-coords[3*begin[i]];
7160 curVec[1]=coords[3*begin[i+1]+1]-coords[3*begin[i]+1];
7161 curVec[2]=coords[3*begin[i+1]+2]-coords[3*begin[i]+2];
7162 double norm=sqrt(curVec[0]*curVec[0]+curVec[1]*curVec[1]+curVec[2]*curVec[2]);
7165 curVec[0]/=norm; curVec[1]/=norm; curVec[2]/=norm;
7166 v[0]=vec[1]*curVec[2]-vec[2]*curVec[1]; v[1]=vec[2]*curVec[0]-vec[0]*curVec[2]; v[2]=vec[0]*curVec[1]-vec[1]*curVec[0];
7167 norm=sqrt(v[0]*v[0]+v[1]*v[1]+v[2]*v[2]);
7170 v[0]/=norm; v[1]/=norm; v[2]/=norm;
7171 *p=v[0]*coords[3*begin[i]]+v[1]*coords[3*begin[i]+1]+v[2]*coords[3*begin[i]+2];
7175 throw INTERP_KERNEL::Exception("Not able to find a normal vector of that 3D face !");
7179 * This method tries to obtain a well oriented polyhedron.
7180 * If the algorithm fails, an exception will be thrown.
7182 void MEDCouplingUMesh::TryToCorrectPolyhedronOrientation(int *begin, int *end, const double *coords)
7184 std::list< std::pair<int,int> > edgesOK,edgesFinished;
7185 std::size_t nbOfFaces=std::count(begin,end,-1)+1;
7186 std::vector<bool> isPerm(nbOfFaces,false);//field on faces False: I don't know, True : oriented
7188 int *bgFace=begin,*endFace=std::find(begin+1,end,-1);
7189 std::size_t nbOfEdgesInFace=std::distance(bgFace,endFace);
7190 for(std::size_t l=0;l<nbOfEdgesInFace;l++) { std::pair<int,int> p1(bgFace[l],bgFace[(l+1)%nbOfEdgesInFace]); edgesOK.push_back(p1); }
7192 while(std::find(isPerm.begin(),isPerm.end(),false)!=isPerm.end())
7195 std::size_t smthChanged=0;
7196 for(std::size_t i=0;i<nbOfFaces;i++)
7198 endFace=std::find(bgFace+1,end,-1);
7199 nbOfEdgesInFace=std::distance(bgFace,endFace);
7203 for(std::size_t j=0;j<nbOfEdgesInFace;j++)
7205 std::pair<int,int> p1(bgFace[j],bgFace[(j+1)%nbOfEdgesInFace]);
7206 std::pair<int,int> p2(p1.second,p1.first);
7207 bool b1=std::find(edgesOK.begin(),edgesOK.end(),p1)!=edgesOK.end();
7208 bool b2=std::find(edgesOK.begin(),edgesOK.end(),p2)!=edgesOK.end();
7209 if(b1 || b2) { b=b2; isPerm[i]=true; smthChanged++; break; }
7214 std::reverse(bgFace+1,endFace);
7215 for(std::size_t j=0;j<nbOfEdgesInFace;j++)
7217 std::pair<int,int> p1(bgFace[j],bgFace[(j+1)%nbOfEdgesInFace]);
7218 std::pair<int,int> p2(p1.second,p1.first);
7219 if(std::find(edgesOK.begin(),edgesOK.end(),p1)!=edgesOK.end())
7220 { std::ostringstream oss; oss << "Face #" << j << " of polyhedron looks bad !"; throw INTERP_KERNEL::Exception(oss.str()); }
7221 if(std::find(edgesFinished.begin(),edgesFinished.end(),p1)!=edgesFinished.end() || std::find(edgesFinished.begin(),edgesFinished.end(),p2)!=edgesFinished.end())
7222 { std::ostringstream oss; oss << "Face #" << j << " of polyhedron looks bad !"; throw INTERP_KERNEL::Exception(oss.str()); }
7223 std::list< std::pair<int,int> >::iterator it=std::find(edgesOK.begin(),edgesOK.end(),p2);
7224 if(it!=edgesOK.end())
7227 edgesFinished.push_back(p1);
7230 edgesOK.push_back(p1);
7237 { throw INTERP_KERNEL::Exception("The polyhedron looks too bad to be repaired !"); }
7239 if(!edgesOK.empty())
7240 { throw INTERP_KERNEL::Exception("The polyhedron looks too bad to be repaired : Some edges are shared only once !"); }
7241 if(INTERP_KERNEL::calculateVolumeForPolyh2<int,INTERP_KERNEL::ALL_C_MODE>(begin,(int)std::distance(begin,end),coords)<-EPS_FOR_POLYH_ORIENTATION)
7242 {//not lucky ! The first face was not correctly oriented : reorient all faces...
7244 for(std::size_t i=0;i<nbOfFaces;i++)
7246 endFace=std::find(bgFace+1,end,-1);
7247 std::reverse(bgFace+1,endFace);
7255 * This method makes the assumption spacedimension == meshdimension == 2.
7256 * This method works only for linear cells.
7258 * \return a newly allocated array containing the connectivity of a polygon type enum included (NORM_POLYGON in pos#0)
7260 DataArrayInt *MEDCouplingUMesh::buildUnionOf2DMesh() const
7262 if(getMeshDimension()!=2 || getSpaceDimension()!=2)
7263 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildUnionOf2DMesh : meshdimension, spacedimension must be equal to 2 !");
7264 MCAuto<MEDCouplingUMesh> skin(computeSkin());
7265 int oldNbOfNodes(skin->getNumberOfNodes());
7266 MCAuto<DataArrayInt> o2n(skin->zipCoordsTraducer());
7267 int nbOfNodesExpected(skin->getNumberOfNodes());
7268 MCAuto<DataArrayInt> n2o(o2n->invertArrayO2N2N2O(oldNbOfNodes));
7269 int nbCells(skin->getNumberOfCells());
7270 if(nbCells==nbOfNodesExpected)
7271 return buildUnionOf2DMeshLinear(skin,n2o);
7272 else if(2*nbCells==nbOfNodesExpected)
7273 return buildUnionOf2DMeshQuadratic(skin,n2o);
7275 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildUnionOf2DMesh : the mesh 2D in input appears to be not in a single part of a 2D mesh !");
7279 * This method makes the assumption spacedimension == meshdimension == 3.
7280 * This method works only for linear cells.
7282 * \return a newly allocated array containing the connectivity of a polygon type enum included (NORM_POLYHED in pos#0)
7284 DataArrayInt *MEDCouplingUMesh::buildUnionOf3DMesh() const
7286 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
7287 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildUnionOf3DMesh : meshdimension, spacedimension must be equal to 2 !");
7288 MCAuto<MEDCouplingUMesh> m=computeSkin();
7289 const int *conn=m->getNodalConnectivity()->begin();
7290 const int *connI=m->getNodalConnectivityIndex()->begin();
7291 int nbOfCells=m->getNumberOfCells();
7292 MCAuto<DataArrayInt> ret=DataArrayInt::New(); ret->alloc(m->getNodalConnectivity()->getNumberOfTuples(),1);
7293 int *work=ret->getPointer(); *work++=INTERP_KERNEL::NORM_POLYHED;
7296 work=std::copy(conn+connI[0]+1,conn+connI[1],work);
7297 for(int i=1;i<nbOfCells;i++)
7300 work=std::copy(conn+connI[i]+1,conn+connI[i+1],work);
7306 * \brief Creates a graph of cell neighbors
7307 * \return MEDCouplingSkyLineArray * - an sky line array the user should delete.
7308 * In the sky line array, graph arcs are stored in terms of (index,value) notation.
7310 * - index: 0 3 5 6 6
7311 * - value: 1 2 3 2 3 3
7312 * means 6 arcs (0,1), (0,2), (0,3), (1,2), (1,3), (2,3)
7313 * Arcs are not doubled but reflexive (1,1) arcs are present for each cell
7315 MEDCouplingSkyLineArray* MEDCouplingUMesh::generateGraph() const
7317 checkConnectivityFullyDefined();
7319 int meshDim = this->getMeshDimension();
7320 MEDCoupling::DataArrayInt* indexr=MEDCoupling::DataArrayInt::New();
7321 MEDCoupling::DataArrayInt* revConn=MEDCoupling::DataArrayInt::New();
7322 this->getReverseNodalConnectivity(revConn,indexr);
7323 const int* indexr_ptr=indexr->begin();
7324 const int* revConn_ptr=revConn->begin();
7326 const MEDCoupling::DataArrayInt* index;
7327 const MEDCoupling::DataArrayInt* conn;
7328 conn=this->getNodalConnectivity(); // it includes a type as the 1st element!!!
7329 index=this->getNodalConnectivityIndex();
7330 int nbCells=this->getNumberOfCells();
7331 const int* index_ptr=index->begin();
7332 const int* conn_ptr=conn->begin();
7334 //creating graph arcs (cell to cell relations)
7335 //arcs are stored in terms of (index,value) notation
7338 // means 6 arcs (0,1), (0,2), (0,3), (1,2), (1,3), (2,3)
7339 // in present version arcs are not doubled but reflexive (1,1) arcs are present for each cell
7341 //warning here one node have less than or equal effective number of cell with it
7342 //but cell could have more than effective nodes
7343 //because other equals nodes in other domain (with other global inode)
7344 std::vector <int> cell2cell_index(nbCells+1,0);
7345 std::vector <int> cell2cell;
7346 cell2cell.reserve(3*nbCells);
7348 for (int icell=0; icell<nbCells;icell++)
7350 std::map<int,int > counter;
7351 for (int iconn=index_ptr[icell]+1; iconn<index_ptr[icell+1];iconn++)
7353 int inode=conn_ptr[iconn];
7354 for (int iconnr=indexr_ptr[inode]; iconnr<indexr_ptr[inode+1];iconnr++)
7356 int icell2=revConn_ptr[iconnr];
7357 std::map<int,int>::iterator iter=counter.find(icell2);
7358 if (iter!=counter.end()) (iter->second)++;
7359 else counter.insert(std::make_pair(icell2,1));
7362 for (std::map<int,int>::const_iterator iter=counter.begin();
7363 iter!=counter.end(); iter++)
7364 if (iter->second >= meshDim)
7366 cell2cell_index[icell+1]++;
7367 cell2cell.push_back(iter->first);
7372 cell2cell_index[0]=0;
7373 for (int icell=0; icell<nbCells;icell++)
7374 cell2cell_index[icell+1]=cell2cell_index[icell]+cell2cell_index[icell+1];
7376 //filling up index and value to create skylinearray structure
7377 MEDCouplingSkyLineArray * array(MEDCouplingSkyLineArray::New(cell2cell_index,cell2cell));
7382 void MEDCouplingUMesh::writeVTKLL(std::ostream& ofs, const std::string& cellData, const std::string& pointData, DataArrayByte *byteData) const
7384 int nbOfCells=getNumberOfCells();
7386 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::writeVTK : the unstructured mesh has no cells !");
7387 ofs << " <" << getVTKDataSetType() << ">\n";
7388 ofs << " <Piece NumberOfPoints=\"" << getNumberOfNodes() << "\" NumberOfCells=\"" << nbOfCells << "\">\n";
7389 ofs << " <PointData>\n" << pointData << std::endl;
7390 ofs << " </PointData>\n";
7391 ofs << " <CellData>\n" << cellData << std::endl;
7392 ofs << " </CellData>\n";
7393 ofs << " <Points>\n";
7394 if(getSpaceDimension()==3)
7395 _coords->writeVTK(ofs,8,"Points",byteData);
7398 MCAuto<DataArrayDouble> coo=_coords->changeNbOfComponents(3,0.);
7399 coo->writeVTK(ofs,8,"Points",byteData);
7401 ofs << " </Points>\n";
7402 ofs << " <Cells>\n";
7403 const int *cPtr=_nodal_connec->begin();
7404 const int *cIPtr=_nodal_connec_index->begin();
7405 MCAuto<DataArrayInt> faceoffsets=DataArrayInt::New(); faceoffsets->alloc(nbOfCells,1);
7406 MCAuto<DataArrayInt> types=DataArrayInt::New(); types->alloc(nbOfCells,1);
7407 MCAuto<DataArrayInt> offsets=DataArrayInt::New(); offsets->alloc(nbOfCells,1);
7408 MCAuto<DataArrayInt> connectivity=DataArrayInt::New(); connectivity->alloc(_nodal_connec->getNumberOfTuples()-nbOfCells,1);
7409 int *w1=faceoffsets->getPointer(),*w2=types->getPointer(),*w3=offsets->getPointer(),*w4=connectivity->getPointer();
7410 int szFaceOffsets=0,szConn=0;
7411 for(int i=0;i<nbOfCells;i++,w1++,w2++,w3++)
7414 if((INTERP_KERNEL::NormalizedCellType)cPtr[cIPtr[i]]!=INTERP_KERNEL::NORM_POLYHED)
7417 *w3=szConn+cIPtr[i+1]-cIPtr[i]-1; szConn+=cIPtr[i+1]-cIPtr[i]-1;
7418 w4=std::copy(cPtr+cIPtr[i]+1,cPtr+cIPtr[i+1],w4);
7422 int deltaFaceOffset=cIPtr[i+1]-cIPtr[i]+1;
7423 *w1=szFaceOffsets+deltaFaceOffset; szFaceOffsets+=deltaFaceOffset;
7424 std::set<int> c(cPtr+cIPtr[i]+1,cPtr+cIPtr[i+1]); c.erase(-1);
7425 *w3=szConn+(int)c.size(); szConn+=(int)c.size();
7426 w4=std::copy(c.begin(),c.end(),w4);
7429 types->transformWithIndArr(MEDCOUPLING2VTKTYPETRADUCER,MEDCOUPLING2VTKTYPETRADUCER+INTERP_KERNEL::NORM_MAXTYPE+1);
7430 types->writeVTK(ofs,8,"UInt8","types",byteData);
7431 offsets->writeVTK(ofs,8,"Int32","offsets",byteData);
7432 if(szFaceOffsets!=0)
7433 {//presence of Polyhedra
7434 connectivity->reAlloc(szConn);
7435 faceoffsets->writeVTK(ofs,8,"Int32","faceoffsets",byteData);
7436 MCAuto<DataArrayInt> faces=DataArrayInt::New(); faces->alloc(szFaceOffsets,1);
7437 w1=faces->getPointer();
7438 for(int i=0;i<nbOfCells;i++)
7439 if((INTERP_KERNEL::NormalizedCellType)cPtr[cIPtr[i]]==INTERP_KERNEL::NORM_POLYHED)
7441 int nbFaces=std::count(cPtr+cIPtr[i]+1,cPtr+cIPtr[i+1],-1)+1;
7443 const int *w6=cPtr+cIPtr[i]+1,*w5=0;
7444 for(int j=0;j<nbFaces;j++)
7446 w5=std::find(w6,cPtr+cIPtr[i+1],-1);
7447 *w1++=(int)std::distance(w6,w5);
7448 w1=std::copy(w6,w5,w1);
7452 faces->writeVTK(ofs,8,"Int32","faces",byteData);
7454 connectivity->writeVTK(ofs,8,"Int32","connectivity",byteData);
7455 ofs << " </Cells>\n";
7456 ofs << " </Piece>\n";
7457 ofs << " </" << getVTKDataSetType() << ">\n";
7460 void MEDCouplingUMesh::reprQuickOverview(std::ostream& stream) const
7462 stream << "MEDCouplingUMesh C++ instance at " << this << ". Name : \"" << getName() << "\".";
7464 { stream << " Not set !"; return ; }
7465 stream << " Mesh dimension : " << _mesh_dim << ".";
7469 { stream << " No coordinates set !"; return ; }
7470 if(!_coords->isAllocated())
7471 { stream << " Coordinates set but not allocated !"; return ; }
7472 stream << " Space dimension : " << _coords->getNumberOfComponents() << "." << std::endl;
7473 stream << "Number of nodes : " << _coords->getNumberOfTuples() << ".";
7474 if(!_nodal_connec_index)
7475 { stream << std::endl << "Nodal connectivity NOT set !"; return ; }
7476 if(!_nodal_connec_index->isAllocated())
7477 { stream << std::endl << "Nodal connectivity set but not allocated !"; return ; }
7478 int lgth=_nodal_connec_index->getNumberOfTuples();
7479 int cpt=_nodal_connec_index->getNumberOfComponents();
7480 if(cpt!=1 || lgth<1)
7482 stream << std::endl << "Number of cells : " << lgth-1 << ".";
7485 std::string MEDCouplingUMesh::getVTKDataSetType() const
7487 return std::string("UnstructuredGrid");
7490 std::string MEDCouplingUMesh::getVTKFileExtension() const
7492 return std::string("vtu");
7498 * Provides a renumbering of the cells of this (which has to be a piecewise connected 1D line), so that
7499 * the segments of the line are indexed in consecutive order (i.e. cells \a i and \a i+1 are neighbors).
7500 * This doesn't modify the mesh. This method only works using nodal connectivity consideration. Coordinates of nodes are ignored here.
7501 * The caller is to deal with the resulting DataArrayInt.
7502 * \throw If the coordinate array is not set.
7503 * \throw If the nodal connectivity of the cells is not defined.
7504 * \throw If m1 is not a mesh of dimension 2, or m1 is not a mesh of dimension 1
7505 * \throw If m2 is not a (piecewise) line (i.e. if a point has more than 2 adjacent segments)
7507 * \sa DataArrayInt::sortEachPairToMakeALinkedList
7509 DataArrayInt *MEDCouplingUMesh::orderConsecutiveCells1D() const
7511 checkFullyDefined();
7512 if(getMeshDimension()!=1)
7513 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::orderConsecutiveCells1D works on unstructured mesh with meshdim = 1 !");
7515 // Check that this is a line (and not a more complex 1D mesh) - each point is used at most by 2 segments:
7516 MCAuto<DataArrayInt> _d(DataArrayInt::New()),_dI(DataArrayInt::New());
7517 MCAuto<DataArrayInt> _rD(DataArrayInt::New()),_rDI(DataArrayInt::New());
7518 MCAuto<MEDCouplingUMesh> m_points(buildDescendingConnectivity(_d, _dI, _rD, _rDI));
7519 const int *d(_d->begin()), *dI(_dI->begin());
7520 const int *rD(_rD->begin()), *rDI(_rDI->begin());
7521 MCAuto<DataArrayInt> _dsi(_rDI->deltaShiftIndex());
7522 const int * dsi(_dsi->begin());
7523 MCAuto<DataArrayInt> dsii = _dsi->findIdsNotInRange(0,3);
7525 if (dsii->getNumberOfTuples())
7526 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::orderConsecutiveCells1D only work with a mesh being a (piecewise) connected line!");
7528 int nc(getNumberOfCells());
7529 MCAuto<DataArrayInt> result(DataArrayInt::New());
7530 result->alloc(nc,1);
7532 // set of edges not used so far
7533 std::set<int> edgeSet;
7534 for (int i=0; i<nc; edgeSet.insert(i), i++);
7538 // while we have points with only one neighbor segments
7541 std::list<int> linePiece;
7542 // fills a list of consecutive segment linked to startSeg. This can go forward or backward.
7543 for (int direction=0;direction<2;direction++) // direction=0 --> forward, direction=1 --> backward
7545 // Fill the list forward (resp. backward) from the start segment:
7546 int activeSeg = startSeg;
7547 int prevPointId = -20;
7549 while (!edgeSet.empty())
7551 if (!(direction == 1 && prevPointId==-20)) // prevent adding twice startSeg
7554 linePiece.push_back(activeSeg);
7556 linePiece.push_front(activeSeg);
7557 edgeSet.erase(activeSeg);
7560 int ptId1 = d[dI[activeSeg]], ptId2 = d[dI[activeSeg]+1];
7561 ptId = direction ? (ptId1 == prevPointId ? ptId2 : ptId1) : (ptId2 == prevPointId ? ptId1 : ptId2);
7562 if (dsi[ptId] == 1) // hitting the end of the line
7565 int seg1 = rD[rDI[ptId]], seg2 = rD[rDI[ptId]+1];
7566 activeSeg = (seg1 == activeSeg) ? seg2 : seg1;
7569 // Done, save final piece into DA:
7570 std::copy(linePiece.begin(), linePiece.end(), result->getPointer()+newIdx);
7571 newIdx += linePiece.size();
7573 // identify next valid start segment (one which is not consumed)
7574 if(!edgeSet.empty())
7575 startSeg = *(edgeSet.begin());
7577 while (!edgeSet.empty());
7578 return result.retn();
7582 * This method split some of edges of 2D cells in \a this. The edges to be split are specified in \a subNodesInSeg
7583 * and in \a subNodesInSegI using \ref numbering-indirect storage mode.
7584 * To do the work this method can optionally needs information about middle of subedges for quadratic cases if
7585 * a minimal creation of new nodes is wanted.
7586 * So this method try to reduce at most the number of new nodes. The only case that can lead this method to add
7587 * nodes if a SEG3 is split without information of middle.
7588 * \b WARNING : is returned value is different from 0 a call to MEDCouplingUMesh::mergeNodes is necessary to
7589 * avoid to have a non conform mesh.
7591 * \return int - the number of new nodes created (in most of cases 0).
7593 * \throw If \a this is not coherent.
7594 * \throw If \a this has not spaceDim equal to 2.
7595 * \throw If \a this has not meshDim equal to 2.
7596 * \throw If some subcells needed to be split are orphan.
7597 * \sa MEDCouplingUMesh::conformize2D
7599 int MEDCouplingUMesh::split2DCells(const DataArrayInt *desc, const DataArrayInt *descI, const DataArrayInt *subNodesInSeg, const DataArrayInt *subNodesInSegI, const DataArrayInt *midOpt, const DataArrayInt *midOptI)
7601 if(!desc || !descI || !subNodesInSeg || !subNodesInSegI)
7602 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::split2DCells : the 4 first arrays must be not null !");
7603 desc->checkAllocated(); descI->checkAllocated(); subNodesInSeg->checkAllocated(); subNodesInSegI->checkAllocated();
7604 if(getSpaceDimension()!=2 || getMeshDimension()!=2)
7605 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::split2DCells : This method only works for meshes with spaceDim=2 and meshDim=2 !");
7606 if(midOpt==0 && midOptI==0)
7608 split2DCellsLinear(desc,descI,subNodesInSeg,subNodesInSegI);
7611 else if(midOpt!=0 && midOptI!=0)
7612 return split2DCellsQuadratic(desc,descI,subNodesInSeg,subNodesInSegI,midOpt,midOptI);
7614 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::split2DCells : middle parameters must be set to null for all or not null for all.");
7618 * This method compute the convex hull of a single 2D cell. This method tries to conserve at maximum the given input connectivity. In particular, if the orientation of cell is not clockwise
7619 * as in MED format norm. If definitely the result of Jarvis algorithm is not matchable with the input connectivity, the result will be copied into \b nodalConnecOut parameter and
7620 * the geometric cell type set to INTERP_KERNEL::NORM_POLYGON.
7621 * This method excepts that \b coords parameter is expected to be in dimension 2. [ \b nodalConnBg , \b nodalConnEnd ) is the nodal connectivity of the input
7622 * cell (geometric cell type included at the position 0). If the meshdimension of the input cell is not equal to 2 an INTERP_KERNEL::Exception will be thrown.
7624 * \return false if the input connectivity represents already the convex hull, true if the input cell needs to be reordered.
7626 bool MEDCouplingUMesh::BuildConvexEnvelopOf2DCellJarvis(const double *coords, const int *nodalConnBg, const int *nodalConnEnd, DataArrayInt *nodalConnecOut)
7628 std::size_t sz=std::distance(nodalConnBg,nodalConnEnd);
7631 const INTERP_KERNEL::CellModel& cm=INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)*nodalConnBg);
7632 if(cm.getDimension()==2)
7634 const int *node=nodalConnBg+1;
7635 int startNode=*node++;
7636 double refX=coords[2*startNode];
7637 for(;node!=nodalConnEnd;node++)
7639 if(coords[2*(*node)]<refX)
7642 refX=coords[2*startNode];
7645 std::vector<int> tmpOut; tmpOut.reserve(sz); tmpOut.push_back(startNode);
7649 double angle0=-M_PI/2;
7654 double angleNext=0.;
7655 while(nextNode!=startNode)
7659 for(node=nodalConnBg+1;node!=nodalConnEnd;node++)
7661 if(*node!=tmpOut.back() && *node!=prevNode)
7663 tmp2[0]=coords[2*(*node)]-coords[2*tmpOut.back()]; tmp2[1]=coords[2*(*node)+1]-coords[2*tmpOut.back()+1];
7664 double angleM=INTERP_KERNEL::EdgeArcCircle::GetAbsoluteAngle(tmp2,tmp1);
7669 res=angle0-angleM+2.*M_PI;
7678 if(nextNode!=startNode)
7680 angle0=angleNext-M_PI;
7683 prevNode=tmpOut.back();
7684 tmpOut.push_back(nextNode);
7687 std::vector<int> tmp3(2*(sz-1));
7688 std::vector<int>::iterator it=std::copy(nodalConnBg+1,nodalConnEnd,tmp3.begin());
7689 std::copy(nodalConnBg+1,nodalConnEnd,it);
7690 if(std::search(tmp3.begin(),tmp3.end(),tmpOut.begin(),tmpOut.end())!=tmp3.end())
7692 nodalConnecOut->insertAtTheEnd(nodalConnBg,nodalConnEnd);
7695 if(std::search(tmp3.rbegin(),tmp3.rend(),tmpOut.begin(),tmpOut.end())!=tmp3.rend())
7697 nodalConnecOut->insertAtTheEnd(nodalConnBg,nodalConnEnd);
7702 nodalConnecOut->pushBackSilent((int)INTERP_KERNEL::NORM_POLYGON);
7703 nodalConnecOut->insertAtTheEnd(tmpOut.begin(),tmpOut.end());
7708 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::BuildConvexEnvelopOf2DCellJarvis : invalid 2D cell connectivity !");
7711 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::BuildConvexEnvelopOf2DCellJarvis : invalid 2D cell connectivity !");
7715 * This method works on an input pair (\b arr, \b arrIndx) where \b arr indexes is in \b arrIndx.
7716 * This method will not impact the size of inout parameter \b arrIndx but the size of \b arr will be modified in case of suppression.
7718 * \param [in] idsToRemoveBg begin of set of ids to remove in \b arr (included)
7719 * \param [in] idsToRemoveEnd end of set of ids to remove in \b arr (excluded)
7720 * \param [in,out] arr array in which the remove operation will be done.
7721 * \param [in,out] arrIndx array in the remove operation will modify
7722 * \param [in] offsetForRemoval (by default 0) offset so that for each i in [0,arrIndx->getNumberOfTuples()-1) removal process will be performed in the following range [arr+arrIndx[i]+offsetForRemoval,arr+arr[i+1])
7723 * \return true if \b arr and \b arrIndx have been modified, false if not.
7725 bool MEDCouplingUMesh::RemoveIdsFromIndexedArrays(const int *idsToRemoveBg, const int *idsToRemoveEnd, DataArrayInt *arr, DataArrayInt *arrIndx, int offsetForRemoval)
7727 if(!arrIndx || !arr)
7728 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::RemoveIdsFromIndexedArrays : some input arrays are empty !");
7729 if(offsetForRemoval<0)
7730 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::RemoveIdsFromIndexedArrays : offsetForRemoval should be >=0 !");
7731 std::set<int> s(idsToRemoveBg,idsToRemoveEnd);
7732 int nbOfGrps=arrIndx->getNumberOfTuples()-1;
7733 int *arrIPtr=arrIndx->getPointer();
7736 const int *arrPtr=arr->begin();
7737 std::vector<int> arrOut;//no utility to switch to DataArrayInt because copy always needed
7738 for(int i=0;i<nbOfGrps;i++,arrIPtr++)
7740 if(*arrIPtr-previousArrI>offsetForRemoval)
7742 for(const int *work=arrPtr+previousArrI+offsetForRemoval;work!=arrPtr+*arrIPtr;work++)
7744 if(s.find(*work)==s.end())
7745 arrOut.push_back(*work);
7748 previousArrI=*arrIPtr;
7749 *arrIPtr=(int)arrOut.size();
7751 if(arr->getNumberOfTuples()==arrOut.size())
7753 arr->alloc((int)arrOut.size(),1);
7754 std::copy(arrOut.begin(),arrOut.end(),arr->getPointer());
7759 * This method works on a pair input (\b arrIn, \b arrIndxIn) where \b arrIn indexes is in \b arrIndxIn
7760 * (\ref numbering-indirect).
7761 * This method returns the result of the extraction ( specified by a set of ids in [\b idsOfSelectBg , \b idsOfSelectEnd ) ).
7762 * The selection of extraction is done standardly in new2old format.
7763 * This method returns indexed arrays (\ref numbering-indirect) using 2 arrays (arrOut,arrIndexOut).
7765 * \param [in] idsOfSelectBg begin of set of ids of the input extraction (included)
7766 * \param [in] idsOfSelectEnd end of set of ids of the input extraction (excluded)
7767 * \param [in] arrIn arr origin array from which the extraction will be done.
7768 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
7769 * \param [out] arrOut the resulting array
7770 * \param [out] arrIndexOut the index array of the resulting array \b arrOut
7771 * \sa MEDCouplingUMesh::ExtractFromIndexedArraysSlice
7773 void MEDCouplingUMesh::ExtractFromIndexedArrays(const int *idsOfSelectBg, const int *idsOfSelectEnd, const DataArrayInt *arrIn, const DataArrayInt *arrIndxIn,
7774 DataArrayInt* &arrOut, DataArrayInt* &arrIndexOut)
7776 if(!arrIn || !arrIndxIn)
7777 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ExtractFromIndexedArrays : input pointer is NULL !");
7778 arrIn->checkAllocated(); arrIndxIn->checkAllocated();
7779 if(arrIn->getNumberOfComponents()!=1 || arrIndxIn->getNumberOfComponents()!=1)
7780 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ExtractFromIndexedArrays : input arrays must have exactly one component !");
7781 std::size_t sz=std::distance(idsOfSelectBg,idsOfSelectEnd);
7782 const int *arrInPtr=arrIn->begin();
7783 const int *arrIndxPtr=arrIndxIn->begin();
7784 int nbOfGrps=arrIndxIn->getNumberOfTuples()-1;
7786 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ExtractFromIndexedArrays : The format of \"arrIndxIn\" is invalid ! Its nb of tuples should be >=1 !");
7787 int maxSizeOfArr=arrIn->getNumberOfTuples();
7788 MCAuto<DataArrayInt> arro=DataArrayInt::New();
7789 MCAuto<DataArrayInt> arrIo=DataArrayInt::New();
7790 arrIo->alloc((int)(sz+1),1);
7791 const int *idsIt=idsOfSelectBg;
7792 int *work=arrIo->getPointer();
7795 for(std::size_t i=0;i<sz;i++,work++,idsIt++)
7797 if(*idsIt>=0 && *idsIt<nbOfGrps)
7798 lgth+=arrIndxPtr[*idsIt+1]-arrIndxPtr[*idsIt];
7801 std::ostringstream oss; oss << "MEDCouplingUMesh::ExtractFromIndexedArrays : id located on pos #" << i << " value is " << *idsIt << " ! Must be in [0," << nbOfGrps << ") !";
7802 throw INTERP_KERNEL::Exception(oss.str());
7808 std::ostringstream oss; oss << "MEDCouplingUMesh::ExtractFromIndexedArrays : id located on pos #" << i << " value is " << *idsIt << " and at this pos arrIndxIn[" << *idsIt;
7809 oss << "+1]-arrIndxIn[" << *idsIt << "] < 0 ! The input index array is bugged !";
7810 throw INTERP_KERNEL::Exception(oss.str());
7813 arro->alloc(lgth,1);
7814 work=arro->getPointer();
7815 idsIt=idsOfSelectBg;
7816 for(std::size_t i=0;i<sz;i++,idsIt++)
7818 if(arrIndxPtr[*idsIt]>=0 && arrIndxPtr[*idsIt+1]<=maxSizeOfArr)
7819 work=std::copy(arrInPtr+arrIndxPtr[*idsIt],arrInPtr+arrIndxPtr[*idsIt+1],work);
7822 std::ostringstream oss; oss << "MEDCouplingUMesh::ExtractFromIndexedArrays : id located on pos #" << i << " value is " << *idsIt << " arrIndx[" << *idsIt << "] must be >= 0 and arrIndx[";
7823 oss << *idsIt << "+1] <= " << maxSizeOfArr << " (the size of arrIn)!";
7824 throw INTERP_KERNEL::Exception(oss.str());
7828 arrIndexOut=arrIo.retn();
7832 * This method works on a pair input (\b arrIn, \b arrIndxIn) where \b arrIn indexes is in \b arrIndxIn
7833 * (\ref numbering-indirect).
7834 * This method returns the result of the extraction ( specified by a set of ids with a slice given by \a idsOfSelectStart, \a idsOfSelectStop and \a idsOfSelectStep ).
7835 * The selection of extraction is done standardly in new2old format.
7836 * This method returns indexed arrays (\ref numbering-indirect) using 2 arrays (arrOut,arrIndexOut).
7838 * \param [in] idsOfSelectStart begin of set of ids of the input extraction (included)
7839 * \param [in] idsOfSelectStop end of set of ids of the input extraction (excluded)
7840 * \param [in] idsOfSelectStep
7841 * \param [in] arrIn arr origin array from which the extraction will be done.
7842 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
7843 * \param [out] arrOut the resulting array
7844 * \param [out] arrIndexOut the index array of the resulting array \b arrOut
7845 * \sa MEDCouplingUMesh::ExtractFromIndexedArrays
7847 void MEDCouplingUMesh::ExtractFromIndexedArraysSlice(int idsOfSelectStart, int idsOfSelectStop, int idsOfSelectStep, const DataArrayInt *arrIn, const DataArrayInt *arrIndxIn,
7848 DataArrayInt* &arrOut, DataArrayInt* &arrIndexOut)
7850 if(!arrIn || !arrIndxIn)
7851 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ExtractFromIndexedArraysSlice : input pointer is NULL !");
7852 arrIn->checkAllocated(); arrIndxIn->checkAllocated();
7853 if(arrIn->getNumberOfComponents()!=1 || arrIndxIn->getNumberOfComponents()!=1)
7854 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ExtractFromIndexedArraysSlice : input arrays must have exactly one component !");
7855 int sz=DataArrayInt::GetNumberOfItemGivenBESRelative(idsOfSelectStart,idsOfSelectStop,idsOfSelectStep,"MEDCouplingUMesh::ExtractFromIndexedArraysSlice : Input slice ");
7856 const int *arrInPtr=arrIn->begin();
7857 const int *arrIndxPtr=arrIndxIn->begin();
7858 int nbOfGrps=arrIndxIn->getNumberOfTuples()-1;
7860 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ExtractFromIndexedArraysSlice : The format of \"arrIndxIn\" is invalid ! Its nb of tuples should be >=1 !");
7861 int maxSizeOfArr=arrIn->getNumberOfTuples();
7862 MCAuto<DataArrayInt> arro=DataArrayInt::New();
7863 MCAuto<DataArrayInt> arrIo=DataArrayInt::New();
7864 arrIo->alloc((int)(sz+1),1);
7865 int idsIt=idsOfSelectStart;
7866 int *work=arrIo->getPointer();
7869 for(int i=0;i<sz;i++,work++,idsIt+=idsOfSelectStep)
7871 if(idsIt>=0 && idsIt<nbOfGrps)
7872 lgth+=arrIndxPtr[idsIt+1]-arrIndxPtr[idsIt];
7875 std::ostringstream oss; oss << "MEDCouplingUMesh::ExtractFromIndexedArraysSlice : id located on pos #" << i << " value is " << idsIt << " ! Must be in [0," << nbOfGrps << ") !";
7876 throw INTERP_KERNEL::Exception(oss.str());
7882 std::ostringstream oss; oss << "MEDCouplingUMesh::ExtractFromIndexedArraysSlice : id located on pos #" << i << " value is " << idsIt << " and at this pos arrIndxIn[" << idsIt;
7883 oss << "+1]-arrIndxIn[" << idsIt << "] < 0 ! The input index array is bugged !";
7884 throw INTERP_KERNEL::Exception(oss.str());
7887 arro->alloc(lgth,1);
7888 work=arro->getPointer();
7889 idsIt=idsOfSelectStart;
7890 for(int i=0;i<sz;i++,idsIt+=idsOfSelectStep)
7892 if(arrIndxPtr[idsIt]>=0 && arrIndxPtr[idsIt+1]<=maxSizeOfArr)
7893 work=std::copy(arrInPtr+arrIndxPtr[idsIt],arrInPtr+arrIndxPtr[idsIt+1],work);
7896 std::ostringstream oss; oss << "MEDCouplingUMesh::ExtractFromIndexedArraysSlice : id located on pos #" << i << " value is " << idsIt << " arrIndx[" << idsIt << "] must be >= 0 and arrIndx[";
7897 oss << idsIt << "+1] <= " << maxSizeOfArr << " (the size of arrIn)!";
7898 throw INTERP_KERNEL::Exception(oss.str());
7902 arrIndexOut=arrIo.retn();
7906 * This method works on an input pair (\b arrIn, \b arrIndxIn) where \b arrIn indexes is in \b arrIndxIn.
7907 * This method builds an output pair (\b arrOut,\b arrIndexOut) that is a copy from \b arrIn for all cell ids \b not \b in [ \b idsOfSelectBg , \b idsOfSelectEnd ) and for
7908 * cellIds \b in [ \b idsOfSelectBg , \b idsOfSelectEnd ) a copy coming from the corresponding values in input pair (\b srcArr, \b srcArrIndex).
7909 * This method is an generalization of MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx that performs the same thing but by without building explicitly a result output arrays.
7911 * \param [in] idsOfSelectBg begin of set of ids of the input extraction (included)
7912 * \param [in] idsOfSelectEnd end of set of ids of the input extraction (excluded)
7913 * \param [in] arrIn arr origin array from which the extraction will be done.
7914 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
7915 * \param [in] srcArr input array that will be used as source of copy for ids in [ \b idsOfSelectBg, \b idsOfSelectEnd )
7916 * \param [in] srcArrIndex index array of \b srcArr
7917 * \param [out] arrOut the resulting array
7918 * \param [out] arrIndexOut the index array of the resulting array \b arrOut
7920 * \sa MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx
7922 void MEDCouplingUMesh::SetPartOfIndexedArrays(const int *idsOfSelectBg, const int *idsOfSelectEnd, const DataArrayInt *arrIn, const DataArrayInt *arrIndxIn,
7923 const DataArrayInt *srcArr, const DataArrayInt *srcArrIndex,
7924 DataArrayInt* &arrOut, DataArrayInt* &arrIndexOut)
7926 if(arrIn==0 || arrIndxIn==0 || srcArr==0 || srcArrIndex==0)
7927 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::SetPartOfIndexedArrays : presence of null pointer in input parameter !");
7928 MCAuto<DataArrayInt> arro=DataArrayInt::New();
7929 MCAuto<DataArrayInt> arrIo=DataArrayInt::New();
7930 int nbOfTuples=arrIndxIn->getNumberOfTuples()-1;
7931 std::vector<bool> v(nbOfTuples,true);
7933 const int *arrIndxInPtr=arrIndxIn->begin();
7934 const int *srcArrIndexPtr=srcArrIndex->begin();
7935 for(const int *it=idsOfSelectBg;it!=idsOfSelectEnd;it++,srcArrIndexPtr++)
7937 if(*it>=0 && *it<nbOfTuples)
7940 offset+=(srcArrIndexPtr[1]-srcArrIndexPtr[0])-(arrIndxInPtr[*it+1]-arrIndxInPtr[*it]);
7944 std::ostringstream oss; oss << "MEDCouplingUMesh::SetPartOfIndexedArrays : On pos #" << std::distance(idsOfSelectBg,it) << " value is " << *it << " not in [0," << nbOfTuples << ") !";
7945 throw INTERP_KERNEL::Exception(oss.str());
7948 srcArrIndexPtr=srcArrIndex->begin();
7949 arrIo->alloc(nbOfTuples+1,1);
7950 arro->alloc(arrIn->getNumberOfTuples()+offset,1);
7951 const int *arrInPtr=arrIn->begin();
7952 const int *srcArrPtr=srcArr->begin();
7953 int *arrIoPtr=arrIo->getPointer(); *arrIoPtr++=0;
7954 int *arroPtr=arro->getPointer();
7955 for(int ii=0;ii<nbOfTuples;ii++,arrIoPtr++)
7959 arroPtr=std::copy(arrInPtr+arrIndxInPtr[ii],arrInPtr+arrIndxInPtr[ii+1],arroPtr);
7960 *arrIoPtr=arrIoPtr[-1]+(arrIndxInPtr[ii+1]-arrIndxInPtr[ii]);
7964 std::size_t pos=std::distance(idsOfSelectBg,std::find(idsOfSelectBg,idsOfSelectEnd,ii));
7965 arroPtr=std::copy(srcArrPtr+srcArrIndexPtr[pos],srcArrPtr+srcArrIndexPtr[pos+1],arroPtr);
7966 *arrIoPtr=arrIoPtr[-1]+(srcArrIndexPtr[pos+1]-srcArrIndexPtr[pos]);
7970 arrIndexOut=arrIo.retn();
7974 * This method works on an input pair (\b arrIn, \b arrIndxIn) where \b arrIn indexes is in \b arrIndxIn.
7975 * This method is an specialization of MEDCouplingUMesh::SetPartOfIndexedArrays in the case of assignment do not modify the index in \b arrIndxIn.
7977 * \param [in] idsOfSelectBg begin of set of ids of the input extraction (included)
7978 * \param [in] idsOfSelectEnd end of set of ids of the input extraction (excluded)
7979 * \param [in,out] arrInOut arr origin array from which the extraction will be done.
7980 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
7981 * \param [in] srcArr input array that will be used as source of copy for ids in [ \b idsOfSelectBg , \b idsOfSelectEnd )
7982 * \param [in] srcArrIndex index array of \b srcArr
7984 * \sa MEDCouplingUMesh::SetPartOfIndexedArrays
7986 void MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx(const int *idsOfSelectBg, const int *idsOfSelectEnd, DataArrayInt *arrInOut, const DataArrayInt *arrIndxIn,
7987 const DataArrayInt *srcArr, const DataArrayInt *srcArrIndex)
7989 if(arrInOut==0 || arrIndxIn==0 || srcArr==0 || srcArrIndex==0)
7990 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx : presence of null pointer in input parameter !");
7991 int nbOfTuples=arrIndxIn->getNumberOfTuples()-1;
7992 const int *arrIndxInPtr=arrIndxIn->begin();
7993 const int *srcArrIndexPtr=srcArrIndex->begin();
7994 int *arrInOutPtr=arrInOut->getPointer();
7995 const int *srcArrPtr=srcArr->begin();
7996 for(const int *it=idsOfSelectBg;it!=idsOfSelectEnd;it++,srcArrIndexPtr++)
7998 if(*it>=0 && *it<nbOfTuples)
8000 if(srcArrIndexPtr[1]-srcArrIndexPtr[0]==arrIndxInPtr[*it+1]-arrIndxInPtr[*it])
8001 std::copy(srcArrPtr+srcArrIndexPtr[0],srcArrPtr+srcArrIndexPtr[1],arrInOutPtr+arrIndxInPtr[*it]);
8004 std::ostringstream oss; oss << "MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx : On pos #" << std::distance(idsOfSelectBg,it) << " id (idsOfSelectBg[" << std::distance(idsOfSelectBg,it)<< "]) is " << *it << " arrIndxIn[id+1]-arrIndxIn[id]!=srcArrIndex[pos+1]-srcArrIndex[pos] !";
8005 throw INTERP_KERNEL::Exception(oss.str());
8010 std::ostringstream oss; oss << "MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx : On pos #" << std::distance(idsOfSelectBg,it) << " value is " << *it << " not in [0," << nbOfTuples << ") !";
8011 throw INTERP_KERNEL::Exception(oss.str());
8017 * This method works on a pair input (\b arrIn, \b arrIndxIn) where \b arr indexes is in \b arrIndxIn.
8018 * This method expects that these two input arrays come from the output of MEDCouplingUMesh::computeNeighborsOfCells method.
8019 * This method start from id 0 that will be contained in output DataArrayInt. It searches then all neighbors of id0 looking at arrIn[arrIndxIn[0]:arrIndxIn[0+1]].
8020 * Then it is repeated recursively until either all ids are fetched or no more ids are reachable step by step.
8021 * A negative value in \b arrIn means that it is ignored.
8022 * This method is useful to see if a mesh is contiguous regarding its connectivity. If it is not the case the size of returned array is different from arrIndxIn->getNumberOfTuples()-1.
8024 * \param [in] arrIn arr origin array from which the extraction will be done.
8025 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
8026 * \return a newly allocated DataArray that stores all ids fetched by the gradually spread process.
8027 * \sa MEDCouplingUMesh::ComputeSpreadZoneGraduallyFromSeed, MEDCouplingUMesh::partitionBySpreadZone
8029 DataArrayInt *MEDCouplingUMesh::ComputeSpreadZoneGradually(const DataArrayInt *arrIn, const DataArrayInt *arrIndxIn)
8031 int seed=0,nbOfDepthPeelingPerformed=0;
8032 return ComputeSpreadZoneGraduallyFromSeed(&seed,&seed+1,arrIn,arrIndxIn,-1,nbOfDepthPeelingPerformed);
8036 * This method works on a pair input (\b arrIn, \b arrIndxIn) where \b arr indexes is in \b arrIndxIn.
8037 * This method expects that these two input arrays come from the output of MEDCouplingUMesh::computeNeighborsOfCells method.
8038 * This method start from id 0 that will be contained in output DataArrayInt. It searches then all neighbors of id0 regarding arrIn[arrIndxIn[0]:arrIndxIn[0+1]].
8039 * Then it is repeated recursively until either all ids are fetched or no more ids are reachable step by step.
8040 * A negative value in \b arrIn means that it is ignored.
8041 * This method is useful to see if a mesh is contiguous regarding its connectivity. If it is not the case the size of returned array is different from arrIndxIn->getNumberOfTuples()-1.
8042 * \param [in] seedBg the begin pointer (included) of an array containing the seed of the search zone
8043 * \param [in] seedEnd the end pointer (not included) of an array containing the seed of the search zone
8044 * \param [in] arrIn arr origin array from which the extraction will be done.
8045 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
8046 * \param [in] nbOfDepthPeeling the max number of peels requested in search. By default -1, that is to say, no limit.
8047 * \param [out] nbOfDepthPeelingPerformed the number of peels effectively performed. May be different from \a nbOfDepthPeeling
8048 * \return a newly allocated DataArray that stores all ids fetched by the gradually spread process.
8049 * \sa MEDCouplingUMesh::partitionBySpreadZone
8051 DataArrayInt *MEDCouplingUMesh::ComputeSpreadZoneGraduallyFromSeed(const int *seedBg, const int *seedEnd, const DataArrayInt *arrIn, const DataArrayInt *arrIndxIn, int nbOfDepthPeeling, int& nbOfDepthPeelingPerformed)
8053 nbOfDepthPeelingPerformed=0;
8055 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ComputeSpreadZoneGraduallyFromSeed : arrIndxIn input pointer is NULL !");
8056 int nbOfTuples=arrIndxIn->getNumberOfTuples()-1;
8059 DataArrayInt *ret=DataArrayInt::New(); ret->alloc(0,1);
8063 std::vector<bool> fetched(nbOfTuples,false);
8064 return ComputeSpreadZoneGraduallyFromSeedAlg(fetched,seedBg,seedEnd,arrIn,arrIndxIn,nbOfDepthPeeling,nbOfDepthPeelingPerformed);
8069 * This method works on an input pair (\b arrIn, \b arrIndxIn) where \b arrIn indexes is in \b arrIndxIn.
8070 * This method builds an output pair (\b arrOut,\b arrIndexOut) that is a copy from \b arrIn for all cell ids \b not \b in [ \b idsOfSelectBg , \b idsOfSelectEnd ) and for
8071 * cellIds \b in [\b idsOfSelectBg, \b idsOfSelectEnd) a copy coming from the corresponding values in input pair (\b srcArr, \b srcArrIndex).
8072 * This method is an generalization of MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx that performs the same thing but by without building explicitly a result output arrays.
8074 * \param [in] start begin of set of ids of the input extraction (included)
8075 * \param [in] end end of set of ids of the input extraction (excluded)
8076 * \param [in] step step of the set of ids in range mode.
8077 * \param [in] arrIn arr origin array from which the extraction will be done.
8078 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
8079 * \param [in] srcArr input array that will be used as source of copy for ids in [\b idsOfSelectBg, \b idsOfSelectEnd)
8080 * \param [in] srcArrIndex index array of \b srcArr
8081 * \param [out] arrOut the resulting array
8082 * \param [out] arrIndexOut the index array of the resulting array \b arrOut
8084 * \sa MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx MEDCouplingUMesh::SetPartOfIndexedArrays
8086 void MEDCouplingUMesh::SetPartOfIndexedArraysSlice(int start, int end, int step, const DataArrayInt *arrIn, const DataArrayInt *arrIndxIn,
8087 const DataArrayInt *srcArr, const DataArrayInt *srcArrIndex,
8088 DataArrayInt* &arrOut, DataArrayInt* &arrIndexOut)
8090 if(arrIn==0 || arrIndxIn==0 || srcArr==0 || srcArrIndex==0)
8091 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::SetPartOfIndexedArraysSlice : presence of null pointer in input parameter !");
8092 MCAuto<DataArrayInt> arro=DataArrayInt::New();
8093 MCAuto<DataArrayInt> arrIo=DataArrayInt::New();
8094 int nbOfTuples=arrIndxIn->getNumberOfTuples()-1;
8096 const int *arrIndxInPtr=arrIndxIn->begin();
8097 const int *srcArrIndexPtr=srcArrIndex->begin();
8098 int nbOfElemsToSet=DataArray::GetNumberOfItemGivenBESRelative(start,end,step,"MEDCouplingUMesh::SetPartOfIndexedArraysSlice : ");
8100 for(int i=0;i<nbOfElemsToSet;i++,srcArrIndexPtr++,it+=step)
8102 if(it>=0 && it<nbOfTuples)
8103 offset+=(srcArrIndexPtr[1]-srcArrIndexPtr[0])-(arrIndxInPtr[it+1]-arrIndxInPtr[it]);
8106 std::ostringstream oss; oss << "MEDCouplingUMesh::SetPartOfIndexedArraysSlice : On pos #" << i << " value is " << it << " not in [0," << nbOfTuples << ") !";
8107 throw INTERP_KERNEL::Exception(oss.str());
8110 srcArrIndexPtr=srcArrIndex->begin();
8111 arrIo->alloc(nbOfTuples+1,1);
8112 arro->alloc(arrIn->getNumberOfTuples()+offset,1);
8113 const int *arrInPtr=arrIn->begin();
8114 const int *srcArrPtr=srcArr->begin();
8115 int *arrIoPtr=arrIo->getPointer(); *arrIoPtr++=0;
8116 int *arroPtr=arro->getPointer();
8117 for(int ii=0;ii<nbOfTuples;ii++,arrIoPtr++)
8119 int pos=DataArray::GetPosOfItemGivenBESRelativeNoThrow(ii,start,end,step);
8122 arroPtr=std::copy(arrInPtr+arrIndxInPtr[ii],arrInPtr+arrIndxInPtr[ii+1],arroPtr);
8123 *arrIoPtr=arrIoPtr[-1]+(arrIndxInPtr[ii+1]-arrIndxInPtr[ii]);
8127 arroPtr=std::copy(srcArrPtr+srcArrIndexPtr[pos],srcArrPtr+srcArrIndexPtr[pos+1],arroPtr);
8128 *arrIoPtr=arrIoPtr[-1]+(srcArrIndexPtr[pos+1]-srcArrIndexPtr[pos]);
8132 arrIndexOut=arrIo.retn();
8136 * This method works on an input pair (\b arrIn, \b arrIndxIn) where \b arrIn indexes is in \b arrIndxIn.
8137 * This method is an specialization of MEDCouplingUMesh::SetPartOfIndexedArrays in the case of assignment do not modify the index in \b arrIndxIn.
8139 * \param [in] start begin of set of ids of the input extraction (included)
8140 * \param [in] end end of set of ids of the input extraction (excluded)
8141 * \param [in] step step of the set of ids in range mode.
8142 * \param [in,out] arrInOut arr origin array from which the extraction will be done.
8143 * \param [in] arrIndxIn is the input index array allowing to walk into \b arrIn
8144 * \param [in] srcArr input array that will be used as source of copy for ids in [\b idsOfSelectBg, \b idsOfSelectEnd)
8145 * \param [in] srcArrIndex index array of \b srcArr
8147 * \sa MEDCouplingUMesh::SetPartOfIndexedArraysSlice MEDCouplingUMesh::SetPartOfIndexedArraysSameIdx
8149 void MEDCouplingUMesh::SetPartOfIndexedArraysSameIdxSlice(int start, int end, int step, DataArrayInt *arrInOut, const DataArrayInt *arrIndxIn,
8150 const DataArrayInt *srcArr, const DataArrayInt *srcArrIndex)
8152 if(arrInOut==0 || arrIndxIn==0 || srcArr==0 || srcArrIndex==0)
8153 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::SetPartOfIndexedArraysSameIdxSlice : presence of null pointer in input parameter !");
8154 int nbOfTuples=arrIndxIn->getNumberOfTuples()-1;
8155 const int *arrIndxInPtr=arrIndxIn->begin();
8156 const int *srcArrIndexPtr=srcArrIndex->begin();
8157 int *arrInOutPtr=arrInOut->getPointer();
8158 const int *srcArrPtr=srcArr->begin();
8159 int nbOfElemsToSet=DataArray::GetNumberOfItemGivenBESRelative(start,end,step,"MEDCouplingUMesh::SetPartOfIndexedArraysSameIdxSlice : ");
8161 for(int i=0;i<nbOfElemsToSet;i++,srcArrIndexPtr++,it+=step)
8163 if(it>=0 && it<nbOfTuples)
8165 if(srcArrIndexPtr[1]-srcArrIndexPtr[0]==arrIndxInPtr[it+1]-arrIndxInPtr[it])
8166 std::copy(srcArrPtr+srcArrIndexPtr[0],srcArrPtr+srcArrIndexPtr[1],arrInOutPtr+arrIndxInPtr[it]);
8169 std::ostringstream oss; oss << "MEDCouplingUMesh::SetPartOfIndexedArraysSameIdxSlice : On pos #" << i << " id (idsOfSelectBg[" << i << "]) is " << it << " arrIndxIn[id+1]-arrIndxIn[id]!=srcArrIndex[pos+1]-srcArrIndex[pos] !";
8170 throw INTERP_KERNEL::Exception(oss.str());
8175 std::ostringstream oss; oss << "MEDCouplingUMesh::SetPartOfIndexedArraysSameIdxSlice : On pos #" << i << " value is " << it << " not in [0," << nbOfTuples << ") !";
8176 throw INTERP_KERNEL::Exception(oss.str());
8182 * \b this is expected to be a mesh fully defined whose spaceDim==meshDim.
8183 * It returns a new allocated mesh having the same mesh dimension and lying on same coordinates.
8184 * The returned mesh contains as poly cells as number of contiguous zone (regarding connectivity).
8185 * A spread contiguous zone is built using poly cells (polyhedra in 3D, polygons in 2D and polyline in 1D).
8186 * The sum of measure field of returned mesh is equal to the sum of measure field of this.
8188 * \return a newly allocated mesh lying on the same coords than \b this with same meshdimension than \b this.
8190 MEDCouplingUMesh *MEDCouplingUMesh::buildSpreadZonesWithPoly() const
8192 checkFullyDefined();
8193 int mdim=getMeshDimension();
8194 int spaceDim=getSpaceDimension();
8196 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSpreadZonesWithPoly : meshdimension and spacedimension do not match !");
8197 std::vector<DataArrayInt *> partition=partitionBySpreadZone();
8198 std::vector< MCAuto<DataArrayInt> > partitionAuto; partitionAuto.reserve(partition.size());
8199 std::copy(partition.begin(),partition.end(),std::back_insert_iterator<std::vector< MCAuto<DataArrayInt> > >(partitionAuto));
8200 MCAuto<MEDCouplingUMesh> ret=MEDCouplingUMesh::New(getName(),mdim);
8201 ret->setCoords(getCoords());
8202 ret->allocateCells((int)partition.size());
8204 for(std::vector<DataArrayInt *>::const_iterator it=partition.begin();it!=partition.end();it++)
8206 MCAuto<MEDCouplingUMesh> tmp=static_cast<MEDCouplingUMesh *>(buildPartOfMySelf((*it)->begin(),(*it)->end(),true));
8207 MCAuto<DataArrayInt> cell;
8211 cell=tmp->buildUnionOf2DMesh();
8214 cell=tmp->buildUnionOf3DMesh();
8217 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::buildSpreadZonesWithPoly : meshdimension supported are [2,3] ! Not implemented yet for others !");
8220 ret->insertNextCell((INTERP_KERNEL::NormalizedCellType)cell->getIJSafe(0,0),cell->getNumberOfTuples()-1,cell->begin()+1);
8223 ret->finishInsertingCells();
8228 * This method partitions \b this into contiguous zone.
8229 * This method only needs a well defined connectivity. Coordinates are not considered here.
8230 * This method returns a vector of \b newly allocated arrays that the caller has to deal with.
8232 std::vector<DataArrayInt *> MEDCouplingUMesh::partitionBySpreadZone() const
8234 DataArrayInt *neigh=0,*neighI=0;
8235 computeNeighborsOfCells(neigh,neighI);
8236 MCAuto<DataArrayInt> neighAuto(neigh),neighIAuto(neighI);
8237 return PartitionBySpreadZone(neighAuto,neighIAuto);
8240 std::vector<DataArrayInt *> MEDCouplingUMesh::PartitionBySpreadZone(const DataArrayInt *arrIn, const DataArrayInt *arrIndxIn)
8242 if(!arrIn || !arrIndxIn)
8243 throw INTERP_KERNEL::Exception("PartitionBySpreadZone : null input pointers !");
8244 arrIn->checkAllocated(); arrIndxIn->checkAllocated();
8245 int nbOfTuples(arrIndxIn->getNumberOfTuples());
8246 if(arrIn->getNumberOfComponents()!=1 || arrIndxIn->getNumberOfComponents()!=1 || nbOfTuples<1)
8247 throw INTERP_KERNEL::Exception("PartitionBySpreadZone : invalid arrays in input !");
8248 int nbOfCellsCur(nbOfTuples-1);
8249 std::vector<DataArrayInt *> ret;
8252 std::vector<bool> fetchedCells(nbOfCellsCur,false);
8253 std::vector< MCAuto<DataArrayInt> > ret2;
8255 while(seed<nbOfCellsCur)
8257 int nbOfPeelPerformed=0;
8258 ret2.push_back(ComputeSpreadZoneGraduallyFromSeedAlg(fetchedCells,&seed,&seed+1,arrIn,arrIndxIn,-1,nbOfPeelPerformed));
8259 seed=(int)std::distance(fetchedCells.begin(),std::find(fetchedCells.begin()+seed,fetchedCells.end(),false));
8261 for(std::vector< MCAuto<DataArrayInt> >::iterator it=ret2.begin();it!=ret2.end();it++)
8262 ret.push_back((*it).retn());
8267 * This method returns given a distribution of cell type (returned for example by MEDCouplingUMesh::getDistributionOfTypes method and customized after) a
8268 * newly allocated DataArrayInt instance with 2 components ready to be interpreted as input of DataArrayInt::findRangeIdForEachTuple method.
8270 * \param [in] code a code with the same format than those returned by MEDCouplingUMesh::getDistributionOfTypes except for the code[3*k+2] that should contain start id of chunck.
8271 * \return a newly allocated DataArrayInt to be managed by the caller.
8272 * \throw In case of \a code has not the right format (typically of size 3*n)
8274 DataArrayInt *MEDCouplingUMesh::ComputeRangesFromTypeDistribution(const std::vector<int>& code)
8276 MCAuto<DataArrayInt> ret=DataArrayInt::New();
8277 std::size_t nb=code.size()/3;
8278 if(code.size()%3!=0)
8279 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::ComputeRangesFromTypeDistribution : invalid input code !");
8280 ret->alloc((int)nb,2);
8281 int *retPtr=ret->getPointer();
8282 for(std::size_t i=0;i<nb;i++,retPtr+=2)
8284 retPtr[0]=code[3*i+2];
8285 retPtr[1]=code[3*i+2]+code[3*i+1];
8291 * This method expects that \a this a 3D mesh (spaceDim=3 and meshDim=3) with all coordinates and connectivities set.
8292 * All cells in \a this are expected to be linear 3D cells.
8293 * This method will split **all** 3D cells in \a this into INTERP_KERNEL::NORM_TETRA4 cells and put them in the returned mesh.
8294 * It leads to an increase to number of cells.
8295 * This method contrary to MEDCouplingUMesh::simplexize can append coordinates in \a this to perform its work.
8296 * The \a nbOfAdditionalPoints returned value informs about it. If > 0, the coordinates array in returned mesh will have \a nbOfAdditionalPoints
8297 * more tuples (nodes) than in \a this. Anyway, all the nodes in \a this (with the same order) will be in the returned mesh.
8299 * \param [in] policy - the policy of splitting that must be in (PLANAR_FACE_5, PLANAR_FACE_6, GENERAL_24, GENERAL_48). The policy will be used only for INTERP_KERNEL::NORM_HEXA8 cells.
8300 * For all other cells, the splitting policy will be ignored. See INTERP_KERNEL::SplittingPolicy for the images.
8301 * \param [out] nbOfAdditionalPoints - number of nodes added to \c this->_coords. If > 0 a new coordinates object will be constructed result of the aggregation of the old one and the new points added.
8302 * \param [out] n2oCells - A new instance of DataArrayInt holding, for each new cell,
8303 * an id of old cell producing it. The caller is to delete this array using
8304 * decrRef() as it is no more needed.
8305 * \return MEDCoupling1SGTUMesh * - the mesh containing only INTERP_KERNEL::NORM_TETRA4 cells.
8307 * \warning This method operates on each cells in this independently ! So it can leads to non conform mesh in returned value ! If you expect to have a conform mesh in output
8308 * the policy PLANAR_FACE_6 should be used on a mesh sorted with MEDCoupling1SGTUMesh::sortHexa8EachOther.
8310 * \throw If \a this is not a 3D mesh (spaceDim==3 and meshDim==3).
8311 * \throw If \a this is not fully constituted with linear 3D cells.
8312 * \sa MEDCouplingUMesh::simplexize, MEDCoupling1SGTUMesh::sortHexa8EachOther
8314 MEDCoupling1SGTUMesh *MEDCouplingUMesh::tetrahedrize(int policy, DataArrayInt *& n2oCells, int& nbOfAdditionalPoints) const
8316 INTERP_KERNEL::SplittingPolicy pol((INTERP_KERNEL::SplittingPolicy)policy);
8317 checkConnectivityFullyDefined();
8318 if(getMeshDimension()!=3 || getSpaceDimension()!=3)
8319 throw INTERP_KERNEL::Exception("MEDCouplingUMesh::tetrahedrize : only available for mesh with meshdim == 3 and spacedim == 3 !");
8320 int nbOfCells(getNumberOfCells()),nbNodes(getNumberOfNodes());
8321 MCAuto<MEDCoupling1SGTUMesh> ret0(MEDCoupling1SGTUMesh::New(getName(),INTERP_KERNEL::NORM_TETRA4));
8322 MCAuto<DataArrayInt> ret(DataArrayInt::New()); ret->alloc(nbOfCells,1);
8323 int *retPt(ret->getPointer());
8324 MCAuto<DataArrayInt> newConn(DataArrayInt::New()); newConn->alloc(0,1);
8325 MCAuto<DataArrayDouble> addPts(DataArrayDouble::New()); addPts->alloc(0,1);
8326 const int *oldc(_nodal_connec->begin());
8327 const int *oldci(_nodal_connec_index->begin());
8328 const double *coords(_coords->begin());
8329 for(int i=0;i<nbOfCells;i++,oldci++,retPt++)
8331 std::vector<int> a; std::vector<double> b;
8332 INTERP_KERNEL::SplitIntoTetras(pol,(INTERP_KERNEL::NormalizedCellType)oldc[oldci[0]],oldc+oldci[0]+1,oldc+oldci[1],coords,a,b);
8333 std::size_t nbOfTet(a.size()/4); *retPt=(int)nbOfTet;
8334 const int *aa(&a[0]);
8337 for(std::vector<int>::iterator it=a.begin();it!=a.end();it++)
8339 *it=(-(*(it))-1+nbNodes);
8340 addPts->insertAtTheEnd(b.begin(),b.end());
8341 nbNodes+=(int)b.size()/3;
8343 for(std::size_t j=0;j<nbOfTet;j++,aa+=4)
8344 newConn->insertAtTheEnd(aa,aa+4);
8346 if(!addPts->empty())
8348 addPts->rearrange(3);
8349 nbOfAdditionalPoints=addPts->getNumberOfTuples();
8350 addPts=DataArrayDouble::Aggregate(getCoords(),addPts);
8351 ret0->setCoords(addPts);
8355 nbOfAdditionalPoints=0;
8356 ret0->setCoords(getCoords());
8358 ret0->setNodalConnectivity(newConn);
8360 ret->computeOffsetsFull();
8361 n2oCells=ret->buildExplicitArrOfSliceOnScaledArr(0,nbOfCells,1);
8365 MEDCouplingUMeshCellIterator::MEDCouplingUMeshCellIterator(MEDCouplingUMesh *mesh):_mesh(mesh),_cell(new MEDCouplingUMeshCell(mesh)),
8366 _own_cell(true),_cell_id(-1),_nb_cell(0)
8371 _nb_cell=mesh->getNumberOfCells();
8375 MEDCouplingUMeshCellIterator::~MEDCouplingUMeshCellIterator()
8383 MEDCouplingUMeshCellIterator::MEDCouplingUMeshCellIterator(MEDCouplingUMesh *mesh, MEDCouplingUMeshCell *itc, int bg, int end):_mesh(mesh),_cell(itc),
8384 _own_cell(false),_cell_id(bg-1),
8391 MEDCouplingUMeshCell *MEDCouplingUMeshCellIterator::nextt()
8394 if(_cell_id<_nb_cell)
8403 MEDCouplingUMeshCellByTypeEntry::MEDCouplingUMeshCellByTypeEntry(MEDCouplingUMesh *mesh):_mesh(mesh)
8409 MEDCouplingUMeshCellByTypeIterator *MEDCouplingUMeshCellByTypeEntry::iterator()
8411 return new MEDCouplingUMeshCellByTypeIterator(_mesh);
8414 MEDCouplingUMeshCellByTypeEntry::~MEDCouplingUMeshCellByTypeEntry()
8420 MEDCouplingUMeshCellEntry::MEDCouplingUMeshCellEntry(MEDCouplingUMesh *mesh, INTERP_KERNEL::NormalizedCellType type, MEDCouplingUMeshCell *itc, int bg, int end):_mesh(mesh),_type(type),
8428 MEDCouplingUMeshCellEntry::~MEDCouplingUMeshCellEntry()
8434 INTERP_KERNEL::NormalizedCellType MEDCouplingUMeshCellEntry::getType() const
8439 int MEDCouplingUMeshCellEntry::getNumberOfElems() const
8444 MEDCouplingUMeshCellIterator *MEDCouplingUMeshCellEntry::iterator()
8446 return new MEDCouplingUMeshCellIterator(_mesh,_itc,_bg,_end);
8449 MEDCouplingUMeshCellByTypeIterator::MEDCouplingUMeshCellByTypeIterator(MEDCouplingUMesh *mesh):_mesh(mesh),_cell(new MEDCouplingUMeshCell(mesh)),_cell_id(0),_nb_cell(0)
8454 _nb_cell=mesh->getNumberOfCells();
8458 MEDCouplingUMeshCellByTypeIterator::~MEDCouplingUMeshCellByTypeIterator()
8465 MEDCouplingUMeshCellEntry *MEDCouplingUMeshCellByTypeIterator::nextt()
8467 const int *c=_mesh->getNodalConnectivity()->begin();
8468 const int *ci=_mesh->getNodalConnectivityIndex()->begin();
8469 if(_cell_id<_nb_cell)
8471 INTERP_KERNEL::NormalizedCellType type=(INTERP_KERNEL::NormalizedCellType)c[ci[_cell_id]];
8472 int nbOfElems=(int)std::distance(ci+_cell_id,std::find_if(ci+_cell_id,ci+_nb_cell,MEDCouplingImpl::ConnReader(c,type)));
8473 int startId=_cell_id;
8474 _cell_id+=nbOfElems;
8475 return new MEDCouplingUMeshCellEntry(_mesh,type,_cell,startId,_cell_id);
8481 MEDCouplingUMeshCell::MEDCouplingUMeshCell(MEDCouplingUMesh *mesh):_conn(0),_conn_indx(0),_conn_lgth(NOTICABLE_FIRST_VAL)
8485 _conn=mesh->getNodalConnectivity()->getPointer();
8486 _conn_indx=mesh->getNodalConnectivityIndex()->getPointer();
8490 void MEDCouplingUMeshCell::next()
8492 if(_conn_lgth!=NOTICABLE_FIRST_VAL)
8497 _conn_lgth=_conn_indx[1]-_conn_indx[0];
8500 std::string MEDCouplingUMeshCell::repr() const
8502 if(_conn_lgth!=NOTICABLE_FIRST_VAL)
8504 std::ostringstream oss; oss << "Cell Type " << INTERP_KERNEL::CellModel::GetCellModel((INTERP_KERNEL::NormalizedCellType)_conn[0]).getRepr();
8506 std::copy(_conn+1,_conn+_conn_lgth,std::ostream_iterator<int>(oss," "));
8510 return std::string("MEDCouplingUMeshCell::repr : Invalid pos");
8513 INTERP_KERNEL::NormalizedCellType MEDCouplingUMeshCell::getType() const
8515 if(_conn_lgth!=NOTICABLE_FIRST_VAL)
8516 return (INTERP_KERNEL::NormalizedCellType)_conn[0];
8518 return INTERP_KERNEL::NORM_ERROR;
8521 const int *MEDCouplingUMeshCell::getAllConn(int& lgth) const
8524 if(_conn_lgth!=NOTICABLE_FIRST_VAL)