mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-04 18:06:22 +03:00
0d0481c787
When fuzzy option is in force prevent increasing tolerance of input shapes. Instead pass increased by fuzzy value the tolerances of sub-shapes everywhere where it is needed by intersection algorithms. The following changes in API have been made: - The methods SetFuzzyValue and FuzzyValue have been moved from the classes BOPAlgo_ArgumentAnalyzer, BOPAlgo_Builder, and BOPAlgo_PaveFiller to the base class BOPAlgo_Algo. - The public method BOPDS_DS::VerticesOnIn has been renamed to SubShapesOnIn, and the new output parameter theCommonPB has been added. - In BOPTools_AlgoTools, a new argument "theFuzzyValue" has been added in the methods ComputeVV and AreFacesSameDomain. - In IntTools_Context, a new argument "theFuzzyValue" has been added in the methods ComputeVE and ComputeVF. - The methods SetFuzzyValue and FuzzyValue have been added in the classes IntTools_EdgeEdge, IntTools_FaceFace. - In the class IntTools_EdgeFace, the methods SetTolE, SetTolF, TolE, TolF have been removed, and the methods SetFuzzyValue, FuzzyValue have been added. - The new argument "theTol" has been added in the method IntTools_WLineTool::DecompositionOfWLine. Some improvements in algorithms have been made during fighting with regressions: - Correct initialization of pave blocks for degenerated edges. - In BOPAlgo_PaveFiller::MakeBlocks(), filter out paves on intersection curve that were put on the curve accidentally due to wide range of E-F intersection vertex. - In the method IntTools_Tools::ComputeTolerance the margin added to the computed tolerance has been increased up to 0.001%. - The method BOPAlgo_PaveFiller::PutPaveOnCurve has been corrected in order to use the original vertex tolerance instead of the value increased during putting it on other curves. - The new method BOPDS_PaveBlock::RemoveExtPave has been added. - The vertex tolerance computation in BOPTools_AlgoTools::CorrectCurveOnSurface has been improved, taking into account intersection segments between p-curves (to avoid regression on "bugs modalg_6 bug22794"). - Improve IsExistingPaveBlock to make more stable catching of coincidence of common block with section curve (against regression "bugs modalg_4 bug697_2" on Linux). Test case for the bug has been added. The following test cases have been updated as improvements: boolean gdml_private ZH2 ZI7 ZJ7 boolean volumemaker C4 The test case bugs/modalg_4/pro19653 has been corrected to make it stable. See comment inside the script for details. The test case bugs/modalg_6/bug25880 has been corrected to suppress wrong bfuse commands. The test bugs/modalg_6/bug26954_3 has been corrected to compare the result with more precise reference value. The "faulty" TODO in boolean/volumemaker/A8 has been made actual for Linux as well. //Eliminate compilation error on Linux.
210 lines
6.0 KiB
C++
210 lines
6.0 KiB
C++
// Created on: 2001-02-26
|
|
// Created by: Peter KURNEV
|
|
// Copyright (c) 2001-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 _IntTools_EdgeFace_HeaderFile
|
|
#define _IntTools_EdgeFace_HeaderFile
|
|
|
|
#include <Standard.hxx>
|
|
#include <Standard_DefineAlloc.hxx>
|
|
#include <Standard_Handle.hxx>
|
|
|
|
#include <TopoDS_Edge.hxx>
|
|
#include <TopoDS_Face.hxx>
|
|
#include <Standard_Real.hxx>
|
|
#include <Standard_Integer.hxx>
|
|
#include <BRepAdaptor_Curve.hxx>
|
|
#include <BRepAdaptor_Surface.hxx>
|
|
#include <Standard_Boolean.hxx>
|
|
#include <IntTools_SequenceOfRanges.hxx>
|
|
#include <IntTools_FClass2d.hxx>
|
|
#include <IntTools_CArray1OfReal.hxx>
|
|
#include <IntTools_SequenceOfCommonPrts.hxx>
|
|
#include <IntTools_Range.hxx>
|
|
class IntTools_Context;
|
|
class TopoDS_Edge;
|
|
class TopoDS_Face;
|
|
class IntTools_Range;
|
|
class gp_Pnt;
|
|
class BRepAdaptor_Surface;
|
|
class IntTools_CArray1OfReal;
|
|
class IntTools_CommonPrt;
|
|
|
|
|
|
//! The class provides Edge/Face algorithm to determine
|
|
//! common parts between edge and face in 3-d space.
|
|
//! Common parts can be : Vertices or Edges.
|
|
class IntTools_EdgeFace
|
|
{
|
|
public:
|
|
|
|
DEFINE_STANDARD_ALLOC
|
|
|
|
|
|
|
|
//! Empty Constructor
|
|
Standard_EXPORT IntTools_EdgeFace();
|
|
|
|
|
|
//! Initializes algorithm by the edge anEdge
|
|
Standard_EXPORT void SetEdge (const TopoDS_Edge& anEdge);
|
|
|
|
|
|
//! Initializes algorithm by the face aFace
|
|
Standard_EXPORT void SetFace (const TopoDS_Face& aFace);
|
|
|
|
|
|
//! Returns edge
|
|
Standard_EXPORT const TopoDS_Edge& Edge() const;
|
|
|
|
|
|
//! Returns face
|
|
Standard_EXPORT const TopoDS_Face& Face() const;
|
|
|
|
|
|
//! Initializes algorithm by discretization value
|
|
Standard_EXPORT void SetDiscretize (const Standard_Integer aDiscret);
|
|
|
|
|
|
//! Initializes algorithm by deflection value
|
|
Standard_EXPORT void SetDeflection (const Standard_Real aDeflection);
|
|
|
|
|
|
//! Initializes algorithm by parameter tolerance
|
|
Standard_EXPORT void SetEpsilonT (const Standard_Real anEpsT);
|
|
|
|
//! Sets boundaries for edge.
|
|
//! The algorithm processes edge inside these boundaries.
|
|
Standard_EXPORT void SetRange (const IntTools_Range& aRange);
|
|
|
|
|
|
//! Sets boundaries for edge.
|
|
//! The algorithm processes edge inside these boundaries.
|
|
Standard_EXPORT void SetRange (const Standard_Real aFirst, const Standard_Real aLast);
|
|
|
|
|
|
//! Sets the intersecton context
|
|
Standard_EXPORT void SetContext (const Handle(IntTools_Context)& theContext);
|
|
|
|
|
|
//! Gets the intersecton context
|
|
Standard_EXPORT const Handle(IntTools_Context)& Context() const;
|
|
|
|
//! Sets the Fuzzy value
|
|
Standard_EXPORT void SetFuzzyValue(const Standard_Real theFuzz);
|
|
|
|
//! Returns Fuzzy value
|
|
Standard_Real FuzzyValue() const
|
|
{
|
|
return myFuzzyValue;
|
|
}
|
|
|
|
//! Launches the process
|
|
Standard_EXPORT void Perform();
|
|
|
|
|
|
//! Returns true if computation was done
|
|
//! successfully, otherwise returns false
|
|
Standard_EXPORT Standard_Boolean IsDone() const;
|
|
|
|
|
|
//! Returns code of completion
|
|
//! 0 - means successful completion
|
|
//! 1 - the process was not started
|
|
//! 2,3,4,5 - invalid source data for the algorithm
|
|
//! 6 - discretization failed
|
|
//! 7 - no projectable ranges found
|
|
//! 11 - distance computing error
|
|
Standard_EXPORT Standard_Integer ErrorStatus() const;
|
|
|
|
|
|
//! Returns results
|
|
Standard_EXPORT const IntTools_SequenceOfCommonPrts& CommonParts() const;
|
|
|
|
|
|
//! Returns boundaries for edge
|
|
Standard_EXPORT const IntTools_Range& Range() const;
|
|
|
|
//! Sets the flag myQuickCoincidenceCheck
|
|
void UseQuickCoincidenceCheck(const Standard_Boolean bFlag) {
|
|
myQuickCoincidenceCheck=bFlag;
|
|
}
|
|
|
|
//! Returns the flag myQuickCoincidenceCheck
|
|
Standard_Boolean IsCoincidenceCheckedQuickly () {
|
|
return myQuickCoincidenceCheck;
|
|
}
|
|
|
|
|
|
protected:
|
|
Standard_EXPORT static Standard_Boolean IsEqDistance (const gp_Pnt& aP, const BRepAdaptor_Surface& aS, const Standard_Real aT, Standard_Real& aD);
|
|
Standard_EXPORT void CheckData();
|
|
|
|
Standard_EXPORT void Prepare();
|
|
|
|
Standard_EXPORT Standard_Boolean IsProjectable (const Standard_Real t) const;
|
|
|
|
Standard_EXPORT void FindProjectableRoot (const Standard_Real t1, const Standard_Real t2, const Standard_Integer f1, const Standard_Integer f2, Standard_Real& tRoot);
|
|
|
|
Standard_EXPORT Standard_Real DistanceFunction (const Standard_Real t);
|
|
|
|
Standard_EXPORT Standard_Integer MakeType (IntTools_CommonPrt& aCP);
|
|
|
|
Standard_EXPORT Standard_Boolean CheckTouch (const IntTools_CommonPrt& aCP, Standard_Real& aTX);
|
|
|
|
Standard_EXPORT Standard_Boolean CheckTouchVertex (const IntTools_CommonPrt& aCP, Standard_Real& aTX);
|
|
|
|
//! Checks if the edge is in the face really.
|
|
Standard_EXPORT Standard_Boolean IsCoincident();
|
|
|
|
|
|
|
|
private:
|
|
|
|
|
|
|
|
TopoDS_Edge myEdge;
|
|
TopoDS_Face myFace;
|
|
Standard_Real myFuzzyValue;
|
|
Standard_Integer myDiscret;
|
|
Standard_Real myEpsT;
|
|
Standard_Real myDeflection;
|
|
BRepAdaptor_Curve myC;
|
|
BRepAdaptor_Surface myS;
|
|
Standard_Real myCriteria;
|
|
Standard_Boolean myIsDone;
|
|
Standard_Integer myErrorStatus;
|
|
Handle(IntTools_Context) myContext;
|
|
IntTools_SequenceOfRanges myProjectableRanges;
|
|
IntTools_FClass2d myFClass2d;
|
|
IntTools_SequenceOfCommonPrts mySeqOfCommonPrts;
|
|
IntTools_Range myRange;
|
|
|
|
//! Allows avoiding use Edge-Face intersection
|
|
//! algorithm (i.e. speeding up the Boolean algorithm)
|
|
//! if the edges are coincided really.
|
|
//! If it is not evidently set of this flag should
|
|
//! be avoided (otherwise, the performance of
|
|
//! Boolean algorithm will be slower).
|
|
Standard_Boolean myQuickCoincidenceCheck;
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
#endif // _IntTools_EdgeFace_HeaderFile
|