1 // Created on: 2015-03-16
2 // Created by: Varvara POSKONINA
3 // Copyright (c) 2005-2014 OPEN CASCADE SAS
5 // This file is part of Open CASCADE Technology software library.
7 // This library is free software; you can redistribute it and/or modify it under
8 // the terms of the GNU Lesser General Public License version 2.1 as published
9 // by the Free Software Foundation, with special exception defined in the file
10 // OCCT_LGPL_EXCEPTION.txt. Consult the file LICENSE_LGPL_21.txt included in OCCT
11 // distribution for complete text of the license and disclaimer of any warranty.
13 // Alternatively, this file may be used under the terms of Open CASCADE
14 // commercial license or contractual agreement.
16 #ifndef _SelectMgr_Frustum_HeaderFile
17 #define _SelectMgr_Frustum_HeaderFile
19 #include <SelectMgr_BaseFrustum.hxx>
21 //! This is an internal class containing representation of rectangular selecting frustum, created in case
22 //! of point and box selection, and algorithms for overlap detection between selecting
23 //! frustum and sensitive entities. The principle of frustum calculation:
24 //! - for point selection: on a near view frustum plane rectangular neighborhood of
25 //! user-picked point is created according to the pixel tolerance
26 //! given and then this rectangle is projected onto far view frustum
27 //! plane. This rectangles define the parallel bases of selecting frustum;
28 //! - for box selection: box points are projected onto near and far view frustum planes.
29 //! These 2 projected rectangles define parallel bases of selecting frustum.
30 //! Overlap detection tests are implemented according to the terms of separating axis
33 //! - for triangular frustum: V0_Near, V1_Near, V2_Near,
34 //! V0_Far, V1_Far, V2_Far;
35 //! - for rectangular frustum: LeftTopNear, LeftTopFar,
36 //! LeftBottomNear,LeftBottomFar,
37 //! RightTopNear, RightTopFar,
38 //! RightBottomNear, RightBottomFar.
39 //! Plane order in array:
40 //! - for triangular frustum: V0V1, V1V2, V0V2, Near, Far;
41 //! - for rectangular frustum: Top, Bottom, Left, Right, Near, Far.
42 //! Uncollinear edge directions order:
43 //! - for rectangular frustum: Horizontal, Vertical,
44 //! LeftLower, RightLower,
45 //! LeftUpper, RightUpper;
46 //! - for triangular frustum: V0_Near - V0_Far, V1_Near - V1_Far, V2_Near - V2_Far,
47 //! V1_Near - V0_Near, V2_Near - V1_Near, V2_Near - V0_Near.
49 class SelectMgr_Frustum : public SelectMgr_BaseFrustum
53 SelectMgr_Frustum() : SelectMgr_BaseFrustum()
55 memset (myMaxOrthoVertsProjections, 0, sizeof (myMaxOrthoVertsProjections));
56 memset (myMinOrthoVertsProjections, 0, sizeof (myMinOrthoVertsProjections));
57 memset (myMaxVertsProjections, 0, sizeof (myMaxVertsProjections));
58 memset (myMinVertsProjections, 0, sizeof (myMinVertsProjections));
61 //! Dumps the content of me into the stream
62 Standard_EXPORT virtual void DumpJson (Standard_OStream& theOStream, Standard_Integer theDepth = -1) const Standard_OVERRIDE;
66 // SAT Tests for different objects
68 //! Returns true if selecting volume is overlapped by axis-aligned bounding box
69 //! with minimum corner at point theMinPt and maximum at point theMaxPt
70 Standard_Boolean hasOverlap (const SelectMgr_Vec3& theBoxMin,
71 const SelectMgr_Vec3& theBoxMax,
72 Standard_Boolean* theInside = NULL) const;
74 //! SAT intersection test between defined volume and given point
75 Standard_Boolean hasOverlap (const gp_Pnt& thePnt) const;
77 //! SAT intersection test between defined volume and given segment
78 Standard_Boolean hasOverlap (const gp_Pnt& thePnt1,
79 const gp_Pnt& thePnt2) const;
81 //! SAT intersection test between frustum given and planar convex polygon represented as ordered point set
82 Standard_Boolean hasOverlap (const TColgp_Array1OfPnt& theArrayOfPnts,
83 gp_Vec& theNormal) const;
85 //! SAT intersection test between defined volume and given triangle
86 Standard_Boolean hasOverlap (const gp_Pnt& thePnt1,
87 const gp_Pnt& thePnt2,
88 const gp_Pnt& thePnt3,
89 gp_Vec& theNormal) const;
93 //! Checks if AABB and frustum are separated along the given axis
94 Standard_Boolean isSeparated (const SelectMgr_Vec3& theBoxMin,
95 const SelectMgr_Vec3& theBoxMax,
96 const gp_XYZ& theDirect,
97 Standard_Boolean* theInside) const;
99 //! Checks if triangle and frustum are separated along the given axis
100 Standard_Boolean isSeparated (const gp_Pnt& thePnt1,
101 const gp_Pnt& thePnt2,
102 const gp_Pnt& thePnt3,
103 const gp_XYZ& theAxis) const;
107 gp_Vec myPlanes[N + 2]; //!< Plane equations
108 gp_Pnt myVertices[N * 2]; //!< Vertices coordinates
110 Standard_Real myMaxVertsProjections[N + 2]; //!< Cached projections of vertices onto frustum plane directions
111 Standard_Real myMinVertsProjections[N + 2]; //!< Cached projections of vertices onto frustum plane directions
112 Standard_Real myMaxOrthoVertsProjections[3]; //!< Cached projections of vertices onto directions of ortho unit vectors
113 Standard_Real myMinOrthoVertsProjections[3]; //!< Cached projections of vertices onto directions of ortho unit vectors
115 gp_Vec myEdgeDirs[6]; //!< Cached edge directions
118 #include <SelectMgr_Frustum.lxx>
120 #endif // _SelectMgr_Frustum_HeaderFile