|
static Handle< Poly_Triangulation > | Catenate (const Poly_ListOfTriangulation &lstTri) |
| Computes and stores the link from nodes to triangles and from triangles to neighbouring triangles. This tool is obsolete, replaced by Poly_CoherentTriangulation Algorithm to make minimal loops in a graph Join several triangulations to one new triangulation object. The new triangulation is just a mechanical sum of input triangulations, without node sharing. UV coordinates are dropped in the result.
|
|
static void | Write (const Handle< Poly_Triangulation > &T, Standard_OStream &OS, const Standard_Boolean Compact=Standard_True) |
| Writes the content of the triangulation <T> on the stream <OS>. If <Compact> is true this is a "save" format intended to be read back with the Read method. If compact is False it is a "Dump" format intended to be informative.
|
|
static void | Write (const Handle< Poly_Polygon3D > &P, Standard_OStream &OS, const Standard_Boolean Compact=Standard_True) |
| Writes the content of the 3D polygon.
|
|
static void | Write (const Handle< Poly_Polygon2D > &P, Standard_OStream &OS, const Standard_Boolean Compact=Standard_True) |
| Writes the content of the 2D polygon.
|
|
static void | Dump (const Handle< Poly_Triangulation > &T, Standard_OStream &OS) |
| Dumps the triangulation. This is a call to the previous method with Comapct set to False.
|
|
static void | Dump (const Handle< Poly_Polygon3D > &P, Standard_OStream &OS) |
| Dumps the 3D polygon. This is a call to the previous method with Comapct set to False.
|
|
static void | Dump (const Handle< Poly_Polygon2D > &P, Standard_OStream &OS) |
| Dumps the 2D polygon. This is a call to the previous method with Comapct set to False.
|
|
static Handle< Poly_Triangulation > | ReadTriangulation (Standard_IStream &IS) |
| Reads a triangulation from the stream <IS>.
|
|
static Handle< Poly_Polygon3D > | ReadPolygon3D (Standard_IStream &IS) |
| Reads a 3d polygon from the stream <IS>.
|
|
static Handle< Poly_Polygon2D > | ReadPolygon2D (Standard_IStream &IS) |
| Reads a 2D polygon from the stream <IS>.
|
|
static void | ComputeNormals (const Handle< Poly_Triangulation > &Tri) |
| Compute node normals for face triangulation as mean normal of surrounding triangles.
|
|
static Standard_Real | PointOnTriangle (const gp_XY &P1, const gp_XY &P2, const gp_XY &P3, const gp_XY &P, gp_XY &UV) |
| Computes parameters of the point P on triangle defined by points P1, P2, and P3, in 2d. The parameters U and V are defined so that P = P1 + U * (P2 - P1) + V * (P3 - P1), with U >= 0, V >= 0, U + V <= 1. If P is located outside of triangle, or triangle is degenerated, the returned parameters correspond to closest point, and returned value is square of the distance from original point to triangle (0 if point is inside).
|
|
static Standard_Boolean | Intersect (const Handle< Poly_Triangulation > &theTri, const gp_Ax1 &theAxis, const Standard_Boolean theIsClosest, Poly_Triangle &theTriangle, Standard_Real &theDistance) |
| Computes the intersection between axis and triangulation.
|
|
static Standard_Integer | IntersectTriLine (const gp_XYZ &theStart, const gp_Dir &theDir, const gp_XYZ &theV0, const gp_XYZ &theV1, const gp_XYZ &theV2, Standard_Real &theParam) |
| Computes the intersection between a triangle defined by three vertexes and a line.
|
|
template<class TypeSequencePnts > |
static Standard_Boolean | PolygonProperties (const TypeSequencePnts &theSeqPnts, Standard_Real &theArea, Standard_Real &thePerimeter) |
| Returns area and perimeter of 2D-polygon given by its vertices. theArea will be negative if the polygon is bypassed clockwise and will be positive, otherwise. thePerimeter will always be positive.
|
|
This package provides classes and services to handle :
- 3D triangular polyhedrons.
- 3D polygons.
- 2D polygon.
- Tools to dump, save and restore those objects.
Computes parameters of the point P on triangle defined by points P1, P2, and P3, in 2d. The parameters U and V are defined so that P = P1 + U * (P2 - P1) + V * (P3 - P1), with U >= 0, V >= 0, U + V <= 1. If P is located outside of triangle, or triangle is degenerated, the returned parameters correspond to closest point, and returned value is square of the distance from original point to triangle (0 if point is inside).