mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-07 18:30:55 +03:00
58e14d59e7
Various improvements in point-solid classifier: 1) Refactoring. 2) BndBoxTree is extracted into separate class. 3) UB-tree calculation is cashed to improve point-solid classification speed. 4) Ray / curve intersection improved by trimmed parameters and correct order. 5) Fixes in logic. 6) Calculation caching at the classifier level. 3D-claasifier now takes into the account the vertex/edges tolerances. If the given point lays inside the tolerance area of vertex or edge of the solid it's classified as TopAbs_ON. The behavior of IntCurvesFace_Intersector::Perform was changed. Now it may use optional null-tolerance to classify 2d-point relatively to the given face. UBTreeFiller is used to speedup intersection process between edges/vertices and the point. The test case 'boolean gdml_private ZH2' extensively uses the SolidClassifier. After this fix it returns the correct classification statuses, which leads to incorrect result shape (reported by checkshape). Yet the result shape without this fix also seems to be incorrect (one of the isolines goes out of boundary of the face). Thats why it's marked with 'TODO'. Corrections in test cases. Test case is added.
139 lines
4.3 KiB
C++
139 lines
4.3 KiB
C++
// Copyright (c) 1994-1999 Matra Datavision
|
|
// Copyright (c) 1999-2016 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.
|
|
|
|
#include <BRepClass3d_BndBoxTree.hxx>
|
|
|
|
#include <TopoDS.hxx>
|
|
#include <BRep_Tool.hxx>
|
|
#include <BRepAdaptor_Curve.hxx>
|
|
#include <Extrema_ExtPC.hxx>
|
|
#include <Extrema_ExtCC.hxx>
|
|
|
|
|
|
//=======================================================================
|
|
//function : Accept
|
|
//purpose :
|
|
//=======================================================================
|
|
Standard_Boolean BRepClass3d_BndBoxTreeSelectorPoint::Accept (const Standard_Integer& theObj)
|
|
{
|
|
// Box-point collision.
|
|
if (theObj > myMapOfShape.Extent())
|
|
return Standard_False;
|
|
const TopoDS_Shape& shp = myMapOfShape(theObj);
|
|
TopAbs_ShapeEnum sht = shp.ShapeType();
|
|
if (sht == TopAbs_EDGE)
|
|
{
|
|
const TopoDS_Edge& E = TopoDS::Edge(shp);
|
|
Standard_Real EdgeTSq = BRep_Tool::Tolerance(E);
|
|
EdgeTSq *= EdgeTSq;
|
|
Standard_Real f, l;
|
|
BRepAdaptor_Curve C(E);
|
|
BRep_Tool::Range(E,f,l);
|
|
|
|
// Edge-Point interference.
|
|
Extrema_ExtPC ExtPC(myP, C, f, l );
|
|
if (ExtPC.IsDone() && ExtPC.NbExt() > 0)
|
|
{
|
|
for (Standard_Integer i = 1; i <= ExtPC.NbExt(); i++)
|
|
if (ExtPC.SquareDistance(i) < EdgeTSq)
|
|
{
|
|
myStop = 1; //exit from selector
|
|
return Standard_True;
|
|
}
|
|
}
|
|
}
|
|
else if (sht == TopAbs_VERTEX)
|
|
{
|
|
const TopoDS_Vertex &V = TopoDS::Vertex(shp);
|
|
gp_Pnt VPnt = BRep_Tool::Pnt(V);
|
|
Standard_Real VertTSq = BRep_Tool::Tolerance(V);
|
|
VertTSq *= VertTSq;
|
|
// Vertex-Point interference.
|
|
if (VPnt.SquareDistance(myP) < VertTSq)
|
|
{
|
|
myStop = 1;
|
|
return Standard_True;
|
|
}
|
|
}
|
|
return Standard_False;
|
|
}
|
|
|
|
//=======================================================================
|
|
//function : Accept
|
|
//purpose :
|
|
//=======================================================================
|
|
Standard_Boolean BRepClass3d_BndBoxTreeSelectorLine::Accept (const Standard_Integer& theObj)
|
|
{
|
|
//box-line collision
|
|
if (theObj > myMapOfShape.Extent())
|
|
return Standard_False;
|
|
const TopoDS_Shape& shp = myMapOfShape(theObj);
|
|
TopAbs_ShapeEnum sht = shp.ShapeType();
|
|
if (sht == TopAbs_EDGE)
|
|
{
|
|
const TopoDS_Edge& E = TopoDS::Edge(shp);
|
|
Standard_Real EdgeTSq = BRep_Tool::Tolerance(E);
|
|
EdgeTSq *= EdgeTSq;
|
|
Standard_Real f, l;
|
|
BRepAdaptor_Curve C(E);
|
|
BRep_Tool::Range(E,f,l);
|
|
|
|
// Edge-Line interference.
|
|
Extrema_ExtCC ExtCC(C, myLC, f, l, myLC.FirstParameter(), myLC.LastParameter());
|
|
if (ExtCC.IsDone() && ExtCC.NbExt() > 0)
|
|
{
|
|
Standard_Boolean IsInside = Standard_False;
|
|
for (Standard_Integer i = 1; i <= ExtCC.NbExt(); i++)
|
|
{
|
|
if (ExtCC.SquareDistance(i) < EdgeTSq)
|
|
{
|
|
Extrema_POnCurv P1, P2;
|
|
ExtCC.Points(i,P1, P2);
|
|
|
|
EdgeParam EP;
|
|
EP.myE = E;
|
|
EP.myParam = P1.Parameter(); // Original curve is the first parameter.
|
|
EP.myLParam = P2.Parameter(); // Linear curve is the second parameter.
|
|
|
|
myEP.Append(EP);
|
|
IsInside = Standard_True;
|
|
}
|
|
}
|
|
if (IsInside)
|
|
return Standard_True;
|
|
}
|
|
}
|
|
else if (sht == TopAbs_VERTEX)
|
|
{
|
|
const TopoDS_Vertex &V = TopoDS::Vertex(shp);
|
|
Standard_Real VertTSq = BRep_Tool::Tolerance(V);
|
|
VertTSq *= VertTSq;
|
|
// Vertex-Line interference.
|
|
Extrema_ExtPElC ExtPL(BRep_Tool::Pnt(V), myL, Precision::Confusion(), -Precision::Infinite(), Precision::Infinite());
|
|
if (ExtPL.IsDone() && ExtPL.NbExt() > 0)
|
|
if (ExtPL.SquareDistance(1) < VertTSq)
|
|
{
|
|
Extrema_POnCurv PP;
|
|
Standard_Real paramL;
|
|
PP = ExtPL.Point(1);
|
|
paramL = PP.Parameter();
|
|
VertParam VP;
|
|
VP.myV = V;
|
|
VP.myLParam = paramL;
|
|
myVP.Append(VP);
|
|
return Standard_True;
|
|
}
|
|
}
|
|
return Standard_False;
|
|
} |