mirror of
https://git.dev.opencascade.org/repos/occt.git
synced 2025-04-26 10:19:45 +03:00
ecc4f1489d
Existing method of Cylinder-Cylinder intersection computing is based on finding the analytic line (as a function of one argument) and converting one into the walking-line with set of equidistant (along the line parameter) points. The main advantage of applied method is using adaptively computed step. Necessary step is computed into every point of the obtained walking-line. At that we receive final walking-line directly (without preliminary analytic line) and we determine moments more precisely, when it should be split (see IntPatch_ImpImpIntersection_4.gxx). The main disadvantages is bad working this method for non-trimmed cylinders (with infinite bounds), because step value is depend on the boundaries values. More over, new method always returns walking-line, while intersection result can be an analytic curve (lines, circle, ellipse). That is NO good. Therefore, analytic curve is computed by existing method. In conclusion, in spite of covering almost all more often meeting cases, new method has limited application. Then we should use the existing old method. Additionally, method MinMax() is added (see Standard_Real.hxx file). It uses into new algorithm. Some test cases is changed according to their new behavior. Test case for issue CR24915 is added. Into GeometryTest_APICommands.cxx only tabulations were chaged. "Extending" of isolines (see Geom2dHatch_Hatcher.cxx). Small correction of test case for issue CR24915.
183 lines
4.4 KiB
Plaintext
183 lines
4.4 KiB
Plaintext
-- Created on: 1992-05-07
|
|
-- Created by: Jacques GOUSSARD
|
|
-- Copyright (c) 1992-1999 Matra Datavision
|
|
-- 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.
|
|
|
|
class ImpImpIntersection from IntPatch
|
|
|
|
---Purpose: Implementation of the intersection between two
|
|
-- quadric patches : Plane, Cone, Cylinder or Sphere.
|
|
|
|
|
|
uses HSurface from Adaptor3d,
|
|
TopolTool from Adaptor3d,
|
|
Point from IntPatch,
|
|
SequenceOfPoint from IntPatch,
|
|
TheSOnBounds from IntPatch,
|
|
SequenceOfLine from IntPatch,
|
|
Line from IntPatch
|
|
|
|
|
|
raises NotDone from StdFail,
|
|
OutOfRange from Standard,
|
|
DomainError from Standard,
|
|
ConstructionError from Standard
|
|
|
|
is
|
|
|
|
|
|
Create
|
|
|
|
returns ImpImpIntersection from IntPatch;
|
|
|
|
|
|
Create (S1: HSurface from Adaptor3d; D1: TopolTool from Adaptor3d;
|
|
S2: HSurface from Adaptor3d; D2: TopolTool from Adaptor3d;
|
|
TolArc,TolTang: Real from Standard)
|
|
|
|
returns ImpImpIntersection from IntPatch
|
|
|
|
raises ConstructionError from Standard;
|
|
|
|
|
|
Perform (me: in out;
|
|
S1: HSurface from Adaptor3d; D1: TopolTool from Adaptor3d;
|
|
S2: HSurface from Adaptor3d; D2: TopolTool from Adaptor3d;
|
|
TolArc,TolTang: Real from Standard;
|
|
isTheTrimmed: Boolean from Standard = Standard_False)
|
|
|
|
raises ConstructionError from Standard
|
|
|
|
is static;
|
|
|
|
|
|
IsDone(me)
|
|
|
|
---Purpose: Returns True if the calculus was succesfull.
|
|
|
|
returns Boolean from Standard
|
|
---C++: inline
|
|
|
|
is static;
|
|
|
|
|
|
IsEmpty(me)
|
|
|
|
---Purpose: Returns true if the is no intersection.
|
|
|
|
returns Boolean from Standard
|
|
---C++: inline
|
|
|
|
raises NotDone from StdFail
|
|
|
|
is static;
|
|
|
|
|
|
TangentFaces(me)
|
|
|
|
---Purpose: Returns True if the two patches are considered as
|
|
-- entierly tangent, i-e every restriction arc of one
|
|
-- patch is inside the geometric base of the otehr patch.
|
|
|
|
returns Boolean from Standard
|
|
---C++: inline
|
|
|
|
raises NotDone from StdFail
|
|
|
|
is static;
|
|
|
|
|
|
OppositeFaces(me)
|
|
|
|
---Purpose: Returns True when the TangentFaces returns True and the
|
|
-- normal vectors evaluated at a point on the first and the
|
|
-- second surface are opposite.
|
|
-- The exception DomainError is raised if TangentFaces
|
|
-- returns False.
|
|
|
|
returns Boolean from Standard
|
|
---C++: inline
|
|
|
|
raises NotDone from StdFail,
|
|
DomainError from Standard
|
|
|
|
is static;
|
|
|
|
|
|
NbPnts(me)
|
|
|
|
---Purpose: Returns the number of "single" points.
|
|
|
|
returns Integer from Standard
|
|
---C++: inline
|
|
|
|
raises NotDone from StdFail
|
|
|
|
is static;
|
|
|
|
|
|
Point(me; Index: Integer from Standard)
|
|
|
|
---Purpose: Returns the point of range Index.
|
|
-- An exception is raised if Index<=0 or Index>NbPnt.
|
|
|
|
returns Point from IntPatch
|
|
---C++: return const&
|
|
---C++: inline
|
|
|
|
raises NotDone from StdFail,
|
|
OutOfRange from Standard
|
|
|
|
is static;
|
|
|
|
|
|
NbLines(me)
|
|
|
|
---Purpose: Returns the number of intersection lines.
|
|
|
|
returns Integer from Standard
|
|
---C++: inline
|
|
|
|
raises NotDone from StdFail
|
|
|
|
is static;
|
|
|
|
|
|
Line(me; Index: Integer from Standard)
|
|
|
|
---Purpose: Returns the line of range Index.
|
|
-- An exception is raised if Index<=0 or Index>NbLine.
|
|
|
|
returns Line from IntPatch
|
|
---C++: inline
|
|
---C++: return const&
|
|
|
|
raises NotDone from StdFail,
|
|
OutOfRange from Standard
|
|
|
|
is static;
|
|
|
|
|
|
fields
|
|
|
|
done : Boolean from Standard;
|
|
empt : Boolean from Standard;
|
|
tgte : Boolean from Standard;
|
|
oppo : Boolean from Standard;
|
|
spnt : SequenceOfPoint from IntPatch;
|
|
slin : SequenceOfLine from IntPatch;
|
|
solrst : TheSOnBounds from IntPatch;
|
|
|
|
end ImpImpIntersection;
|