Back to home page

EIC code displayed by LXR

 
 

    


File indexing completed on 2025-01-18 10:03:50

0001 // Created on: 1992-02-18
0002 // Created by: Christophe MARION
0003 // Copyright (c) 1992-1999 Matra Datavision
0004 // Copyright (c) 1999-2014 OPEN CASCADE SAS
0005 //
0006 // This file is part of Open CASCADE Technology software library.
0007 //
0008 // This library is free software; you can redistribute it and/or modify it under
0009 // the terms of the GNU Lesser General Public License version 2.1 as published
0010 // by the Free Software Foundation, with special exception defined in the file
0011 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
0012 // distribution for complete text of the license and disclaimer of any warranty.
0013 //
0014 // Alternatively, this file may be used under the terms of Open CASCADE
0015 // commercial license or contractual agreement.
0016 
0017 #ifndef _HLRAlgo_HeaderFile
0018 #define _HLRAlgo_HeaderFile
0019 
0020 #include <HLRAlgo_WiresBlock.hxx>
0021 
0022 //! In order to have the precision required in
0023 //! industrial design, drawings need to offer the
0024 //! possibility of removing lines, which are hidden
0025 //! in a given projection. To do this, the Hidden
0026 //! Line Removal component provides two
0027 //! algorithms: HLRBRep_Algo and HLRBRep_PolyAlgo.
0028 //! These algorithms remove or indicate lines
0029 //! hidden by surfaces. For a given projection, they
0030 //! calculate a set of lines characteristic of the
0031 //! object being represented. They are also used
0032 //! in conjunction with extraction utilities, which
0033 //! reconstruct a new, simplified shape from a
0034 //! selection of calculation results. This new shape
0035 //! is made up of edges, which represent the lines
0036 //! of the visualized shape in a plane. This plane is the projection plane.
0037 //! HLRBRep_Algo takes into account the shape
0038 //! itself. HLRBRep_PolyAlgo works with a
0039 //! polyhedral simplification of the shape. When
0040 //! you use HLRBRep_Algo, you obtain an exact
0041 //! result, whereas, when you use
0042 //! HLRBRep_PolyAlgo, you reduce computation
0043 //! time but obtain polygonal segments.
0044 class HLRAlgo 
0045 {
0046 public:
0047 
0048   DEFINE_STANDARD_ALLOC
0049 
0050   //! Iterator  on the  visible or  hidden  parts of  an
0051   //! EdgeStatus.
0052   Standard_EXPORT static void UpdateMinMax (const Standard_Real x, const Standard_Real y, const Standard_Real z, Standard_Real Min[16], Standard_Real Max[16]);
0053   
0054   Standard_EXPORT static void EnlargeMinMax (const Standard_Real tol, Standard_Real Min[16], Standard_Real Max[16]);
0055   
0056   Standard_EXPORT static void InitMinMax (const Standard_Real Big, Standard_Real Min[16], Standard_Real Max[16]);
0057   
0058   Standard_EXPORT static void EncodeMinMax (HLRAlgo_EdgesBlock::MinMaxIndices& Min, HLRAlgo_EdgesBlock::MinMaxIndices& Max, HLRAlgo_EdgesBlock::MinMaxIndices& MinMax);
0059   
0060   Standard_EXPORT static Standard_Real SizeBox (HLRAlgo_EdgesBlock::MinMaxIndices& Min, HLRAlgo_EdgesBlock::MinMaxIndices& Max);
0061   
0062   Standard_EXPORT static void DecodeMinMax (const HLRAlgo_EdgesBlock::MinMaxIndices& MinMax, HLRAlgo_EdgesBlock::MinMaxIndices& Min, HLRAlgo_EdgesBlock::MinMaxIndices& Max);
0063   
0064   static void CopyMinMax (HLRAlgo_EdgesBlock::MinMaxIndices& IMin, HLRAlgo_EdgesBlock::MinMaxIndices& IMax, HLRAlgo_EdgesBlock::MinMaxIndices& OMin, HLRAlgo_EdgesBlock::MinMaxIndices& OMax)
0065   {
0066     OMin = IMin;
0067     OMax = IMax;
0068   }
0069   
0070   Standard_EXPORT static void AddMinMax (HLRAlgo_EdgesBlock::MinMaxIndices& IMin, HLRAlgo_EdgesBlock::MinMaxIndices& IMax, HLRAlgo_EdgesBlock::MinMaxIndices& OMin, HLRAlgo_EdgesBlock::MinMaxIndices& OMax);
0071 
0072 };
0073 
0074 #endif // _HLRAlgo_HeaderFile