mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-06 18:26:22 +03:00
8ae442a8cb
The methods PerformVerticesEE() and PerformVerticesEF() of the class BOPAlgo_PaveFiller have been replaced with the new PerformNewVertices() method. While splitting the Pave Blocks with extra paves, check that the new Pave Blocks have the valid intersection range. If the new Pave Block does not have such range do not create it and unify its vertices making SD vertex. Re-computation of the Shrunk Data for the modified Pave Blocks. The new method BOPDS_DS::IsValidShrunkData(const Handle(BOPDS_PaveBlock)& thePB) has been implemented to check that the Shrunk Data of the Pave Block is still valid. It may become invalid in case the tolerance values of the vertices of the Pave Block have been modified. The test case bugs/modalg_6/bug27448_2 has been marked as BAD, because it uses the invalid shapes as inputs for BOP. Test cases for the issue 0028690.
161 lines
7.6 KiB
C++
161 lines
7.6 KiB
C++
// Created by: Peter KURNEV
|
|
// Copyright (c) 1999-2014 OPEN CASCADE SAS
|
|
//
|
|
// This file is part of Open CASCADE Technology software library.
|
|
//
|
|
// This library is free software; you can redistribute it and/or modify it under
|
|
// the terms of the GNU Lesser General Public License version 2.1 as published
|
|
// by the Free Software Foundation, with special exception defined in the file
|
|
// OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
|
|
// distribution for complete text of the license and disclaimer of any warranty.
|
|
//
|
|
// Alternatively, this file may be used under the terms of Open CASCADE
|
|
// commercial license or contractual agreement.
|
|
|
|
#ifndef _BOPAlgo_Tools_HeaderFile
|
|
#define _BOPAlgo_Tools_HeaderFile
|
|
|
|
#include <Standard.hxx>
|
|
#include <Standard_DefineAlloc.hxx>
|
|
#include <Standard_Handle.hxx>
|
|
|
|
#include <BOPCol_BaseAllocator.hxx>
|
|
#include <BOPDS_IndexedDataMapOfPaveBlockListOfInteger.hxx>
|
|
#include <BOPCol_IndexedDataMapOfShapeReal.hxx>
|
|
#include <BOPCol_ListOfListOfShape.hxx>
|
|
#include <BOPDS_IndexedDataMapOfPaveBlockListOfPaveBlock.hxx>
|
|
#include <BOPDS_PDS.hxx>
|
|
#include <Standard_Integer.hxx>
|
|
|
|
class BOPDS_PaveBlock;
|
|
class BOPDS_CommonBlock;
|
|
class IntTools_Context;
|
|
class TopoDS_Shape;
|
|
|
|
class BOPAlgo_Tools
|
|
{
|
|
public:
|
|
|
|
//! Makes the chains of the connected elements from the given connexity map
|
|
template <class theType, class theTypeHasher>
|
|
static void MakeBlocks(const NCollection_IndexedDataMap<theType, NCollection_List<theType>, theTypeHasher>& theMILI,
|
|
NCollection_List<NCollection_List<theType>>& theMBlocks,
|
|
const BOPCol_BaseAllocator& theAllocator)
|
|
{
|
|
NCollection_Map<theType, theTypeHasher> aMFence;
|
|
Standard_Integer i, aNb = theMILI.Extent();
|
|
for (i = 1; i <= aNb; ++i) {
|
|
const theType& n = theMILI.FindKey(i);
|
|
if (!aMFence.Add(n))
|
|
continue;
|
|
//
|
|
// Start the chain
|
|
NCollection_List<theType>& aChain = theMBlocks.Append(NCollection_List<theType>(theAllocator));
|
|
aChain.Append(n);
|
|
// Look for connected elements
|
|
typename NCollection_List<theType>::Iterator aItLChain(aChain);
|
|
for (; aItLChain.More(); aItLChain.Next()) {
|
|
const theType& n1 = aItLChain.Value();
|
|
const NCollection_List<theType>& aLI = theMILI.FindFromKey(n1);
|
|
// Add connected elements into the chain
|
|
typename NCollection_List<theType>::Iterator aItLI(aLI);
|
|
for (; aItLI.More(); aItLI.Next()) {
|
|
const theType& n2 = aItLI.Value();
|
|
if (aMFence.Add(n2)) {
|
|
aChain.Append(n2);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
//! Fills the map with the connected entities
|
|
template <class theType, class theTypeHasher>
|
|
static void FillMap(const theType& n1,
|
|
const theType& n2,
|
|
NCollection_IndexedDataMap<theType, NCollection_List<theType>, theTypeHasher>& theMILI,
|
|
const BOPCol_BaseAllocator& theAllocator)
|
|
{
|
|
NCollection_List<theType> *pList1 = theMILI.ChangeSeek(n1);
|
|
if (!pList1) {
|
|
pList1 = &theMILI(theMILI.Add(n1, NCollection_List<theType>(theAllocator)));
|
|
}
|
|
pList1->Append(n2);
|
|
//
|
|
NCollection_List<theType> *pList2 = theMILI.ChangeSeek(n2);
|
|
if (!pList2) {
|
|
pList2 = &theMILI(theMILI.Add(n2, NCollection_List<theType>(theAllocator)));
|
|
}
|
|
pList2->Append(n1);
|
|
}
|
|
|
|
Standard_EXPORT static void FillMap(const Handle(BOPDS_PaveBlock)& thePB1,
|
|
const Standard_Integer theF,
|
|
BOPDS_IndexedDataMapOfPaveBlockListOfInteger& theMILI,
|
|
const BOPCol_BaseAllocator& theAllocator);
|
|
|
|
Standard_EXPORT static void PerformCommonBlocks(BOPDS_IndexedDataMapOfPaveBlockListOfPaveBlock& theMBlocks,
|
|
const BOPCol_BaseAllocator& theAllocator,
|
|
BOPDS_PDS& theDS);
|
|
|
|
Standard_EXPORT static void PerformCommonBlocks(const BOPDS_IndexedDataMapOfPaveBlockListOfInteger& theMBlocks,
|
|
const BOPCol_BaseAllocator& theAllocator,
|
|
BOPDS_PDS& pDS);
|
|
|
|
Standard_EXPORT static Standard_Real ComputeToleranceOfCB
|
|
(const Handle(BOPDS_CommonBlock)& theCB,
|
|
const BOPDS_PDS theDS,
|
|
const Handle(IntTools_Context)& theContext);
|
|
|
|
//! Creates planar wires from the given edges.<br>
|
|
//! The input edges are expected to be planar. And for the performance
|
|
//! sake the method does not check if the edges are really planar.<br>
|
|
//! Thus, the result wires will also be not planar if the input edges are not planar.<br>
|
|
//! The edges may be not shared, but the resulting wires will be sharing the
|
|
//! coinciding parts and intersecting parts.<br>
|
|
//! The output wires may be non-manifold and contain free and multi-connected vertices.<br>
|
|
//! Parameters:
|
|
//! <theEdges> - input edges;<br>
|
|
//! <theWires> - output wires;<br>
|
|
//! <theShared> - boolean flag which defines whether the input edges are already
|
|
//! shared or have to be intersected;<br>
|
|
//! <theAngTol> - the angular tolerance which will be used for distinguishing
|
|
//! the planes in which the edges are located. Default value is
|
|
//! 1.e-8 which is used for intersection of planes in IntTools_FaceFace.<br>
|
|
//! Method returns the following error statuses:<br>
|
|
//! 0 - in case of success (at least one wire has been built);<br>
|
|
//! 1 - in case there are no edges in the given shape;<br>
|
|
//! 2 - sharing of the edges has failed.<br>
|
|
Standard_EXPORT static Standard_Integer EdgesToWires(const TopoDS_Shape& theEdges,
|
|
TopoDS_Shape& theWires,
|
|
const Standard_Boolean theShared = Standard_False,
|
|
const Standard_Real theAngTol = 1.e-8);
|
|
|
|
//! Creates planar faces from given planar wires.<br>
|
|
//! The method does not check if the wires are really planar.<br>
|
|
//! The input wires may be non-manifold but should be shared.<br>
|
|
//! The wires located in the same planes and included into other wires will create
|
|
//! holes in the faces built from outer wires.<br>
|
|
//! The tolerance values of the input shapes may be modified during the operation
|
|
//! due to projection of the edges on the planes for creation of 2D curves.<br>
|
|
//! Parameters:
|
|
//! <theWires> - the given wires;<br>
|
|
//! <theFaces> - the output faces;<br>
|
|
//! <theAngTol> - the angular tolerance for distinguishing the planes in which
|
|
//! the wires are located. Default value is 1.e-8 which is used
|
|
//! for intersection of planes in IntTools_FaceFace.<br>
|
|
//! Method returns TRUE in case of success, i.e. at least one face has been built.<br>
|
|
Standard_EXPORT static Standard_Boolean WiresToFaces(const TopoDS_Shape& theWires,
|
|
TopoDS_Shape& theFaces,
|
|
const Standard_Real theAngTol = 1.e-8);
|
|
|
|
//! Finds chains of intersecting vertices
|
|
Standard_EXPORT static void IntersectVertices(const BOPCol_IndexedDataMapOfShapeReal& theVertices,
|
|
const Standard_Boolean theRunParallel,
|
|
const Standard_Real theFuzzyValue,
|
|
BOPCol_ListOfListOfShape& theChains);
|
|
|
|
};
|
|
|
|
#endif // _BOPAlgo_Tools_HeaderFile
|