-////void SolveSpaceSolver_Storage::addCoincidentPoints(
-//// const Slvs_hEntity& thePoint1, const Slvs_hEntity& thePoint2)
-////{
-//// std::vector< std::set<Slvs_hEntity> >::iterator aCIter = myCoincidentPoints.begin();
-//// std::vector< std::set<Slvs_hEntity> >::iterator aFoundIter = myCoincidentPoints.end(); // already found coincidence
-//// bool isFound = false;
-//// for (; aCIter != myCoincidentPoints.end(); aCIter++) {
-//// bool isFirstFound = aCIter->find(thePoint1) != aCIter->end();
-//// bool isSecondFound = aCIter->find(thePoint2) != aCIter->end();
-//// isFound = isFound || isFirstFound || isSecondFound;
-//// if (isFirstFound && isSecondFound)
-//// break; // already coincident
-//// else if (isFirstFound || isSecondFound) {
-//// if (aFoundIter != myCoincidentPoints.end()) {
-//// // merge two sets
-//// aFoundIter->insert(aCIter->begin(), aCIter->end());
-//// myCoincidentPoints.erase(aCIter);
-//// break;
-//// } else
-//// aFoundIter = aCIter;
-//// aCIter->insert(thePoint1);
-//// aCIter->insert(thePoint2);
-//// }
-//// }
-//// // coincident points not found
-//// if (!isFound) {
-//// std::set<Slvs_hEntity> aNewSet;
-//// aNewSet.insert(thePoint1);
-//// aNewSet.insert(thePoint2);
-//// myCoincidentPoints.push_back(aNewSet);
-//// }
-////}
-////
-////void SolveSpaceSolver_Storage::removeCoincidentPoint(const Slvs_hEntity& thePoint)
-////{
-//// std::vector< std::set<Slvs_hEntity> >::iterator aCIter = myCoincidentPoints.begin();
-//// for (; aCIter != myCoincidentPoints.end(); aCIter++)
-//// if (aCIter->find(thePoint) != aCIter->end()) {
-//// aCIter->erase(thePoint);
-//// if (aCIter->size() <= 1)
-//// myCoincidentPoints.erase(aCIter);
-//// break;
-//// }
-////}
-////
-////void SolveSpaceSolver_Storage::removeCoincidence(const Slvs_Constraint& theCoincidence)
-////{
-//// // Find set of coincident points
-//// std::vector< std::set<Slvs_hEntity> >::iterator aCIt = myCoincidentPoints.begin();
-//// for (; aCIt != myCoincidentPoints.end(); ++aCIt)
-//// if (aCIt->find(theCoincidence.ptA) != aCIt->end() ||
-//// aCIt->find(theCoincidence.ptB) != aCIt->end())
-//// break;
-//// if (aCIt == myCoincidentPoints.end())
-//// return;
-////
-//// // Leave only the points which are still coincident
-//// std::set<Slvs_hEntity> aRemainCoincidence;
-//// std::vector<Slvs_Constraint>::const_iterator aConstrIt = myConstraints.begin();
-//// for (; aConstrIt != myConstraints.end(); ++aConstrIt) {
-//// if (aConstrIt->type != SLVS_C_POINTS_COINCIDENT)
-//// continue;
-//// if (aCIt->find(aConstrIt->ptA) != aCIt->end() ||
-//// aCIt->find(aConstrIt->ptB) != aCIt->end()) {
-//// aRemainCoincidence.insert(aConstrIt->ptA);
-//// aRemainCoincidence.insert(aConstrIt->ptB);
-//// }
-//// }
-//// if (aRemainCoincidence.size() <= 1)
-//// myCoincidentPoints.erase(aCIt);
-//// else
-//// aCIt->swap(aRemainCoincidence);
-////}
-////
-////bool SolveSpaceSolver_Storage::isCoincident(
-//// const Slvs_hEntity& thePoint1, const Slvs_hEntity& thePoint2) const
-////{
-//// std::vector< std::set<Slvs_hEntity> >::const_iterator aCIter = myCoincidentPoints.begin();
-//// for (; aCIter != myCoincidentPoints.end(); aCIter++)
-//// if (aCIter->find(thePoint1) != aCIter->end() && aCIter->find(thePoint2) != aCIter->end())
-//// return true;
-//// return false;
-////}