Intersection between 3 planes. The algorithm searches
for an intersection point. If two of the planes are
parallel or identical, IsEmpty returns TRUE.
#include <IntAna_Int3Pln.hxx>
Constructor & Destructor Documentation
| IntAna_Int3Pln::IntAna_Int3Pln |
( |
| ) |
|
| IntAna_Int3Pln::IntAna_Int3Pln |
( |
const gp_Pln & |
P1, |
|
|
const gp_Pln & |
P2, |
|
|
const gp_Pln & |
P3 |
|
) |
| |
Member Function Documentation
| void IntAna_Int3Pln::operator delete |
( |
void * |
anAddress | ) |
[inline] |
| void* IntAna_Int3Pln::operator new |
( |
size_t |
size | ) |
[inline] |
| void* IntAna_Int3Pln::operator new |
( |
size_t |
, |
|
|
void * |
anAddress |
|
) |
| [inline] |
| const gp_Pnt& IntAna_Int3Pln::Value |
( |
| ) |
const |
The documentation for this class was generated from the following file: