1. Epic GamesDeveloper
  3. Curve

Curve

API > API/Runtime > API/Runtime/GeometryCore

Classes

  Type Name Description
Public class FDynamicGraph    
Public class FDynamicGraph2    
Public class FDynamicGraph3    
Public class FDynamicGraphN Implementation of DGraph that has no dimensionality, ie no data stored for vertices besides indices.  
Public struct TPlanarComplex    

Typedefs

Name Description
FDynamicGraph2d  
FDynamicGraph3d  
FGeneralPolygon2d  
FGeneralPolygon2f  
FPlanarComplexd  
FPlanarComplexf  

Functions

  Type Name Description
Public function Static RealType

UE::Geometry::CurveUtil::ArcLength ( const TArrayView< const VectorType >& Vertices,
bool bLoop
)

  
Public function Static void

UE::Geometry::CurveUtil::ClipConvexToBounds ( TArray< VectorType >& Vertices,
VectorType Min,
VectorType Max
)

 Use the Sutherland–Hodgman algorithm to clip the vertices to the given bounds Note if the path/polygon is concave, this may leave overlapping edges at the boundary.
Public function Static bool

UE::Geometry::CurveUtil::ClipConvexToPlane ( TArray< VectorType >& Vertices,
const TPlane< RealType >& Plane,
TArray< VectorType >& OutClipped,
bool bKeepPositiveSide
)

 Use the Sutherland–Hodgman algorithm to clip the vertices to the given plane Note if the path/polygon is concave, this may leave overlapping edges at the boundary.
Public function bool

UE::Geometry::CurveUtil::Contains2 ( const TArrayView< const VectorType >& Vertices,
const VectorType& QueryPoint
)

  
Public function int

UE::Geometry::CurveUtil::FindNearestIndex ( const TArrayView< const VectorType >& Vertices,
const VectorType& V
)

  
Public function VectorType

UE::Geometry::CurveUtil::GetNormal_FaceAvg2 ( const TArrayView< const VectorType >& Vertices,
int VertexIndex
)

 Construct a normal at a vertex of the Polygon by averaging the adjacent face normals.
Public function void

UE::Geometry::CurveUtil::GetPrevNext ( const TArrayView< const VectorType >& Vertices,
int32 Idx,
VectorType& OutPrev,
VectorType& OutNext
)

 Curve utility functions Get (by reference) the vertices surrounding the given vertex index If bLoop is false and the Prev or Next vertex would be out of bounds, the vertex at Idx is used instead.
Public function void

UE::Geometry::CurveUtil::GetVectorsToPrevNext ( const TArrayView< const VectorType >& Vertices,
int32 VertexIndex,
VectorType& OutToPrev,
VectorType& OutToNext,
bool bNormalize,
bool bLoop
)

 Get (by reference) vectors pointing toward the given vertex index, from its surrounding vertices If bLoop is false and the Prev or Next vertex would be out of bounds, a zero vector is used instead
Public function void

UE::Geometry::CurveUtil::GetVectorsToPrevNext ( const TArrayView< const VectorType >& Vertices,
int32 VertexIndex,
VectorType& OutToPrev,
VectorType& OutToNext,
bool bNormalize
)

 Get (by reference) vectors pointing toward the given vertex index, from its surrounding vertices If bLoop is false and the Prev or Next vertex would be out of bounds, a zero vector is used instead
Public function void

UE::Geometry::CurveUtil::InPlaceSmooth ( TArrayView< VectorType > Vertices,
int StartIdx,
int EndIdx,
double Alpha,
int NumIterations,
bool bClosed
)

 Smooth vertices in-place (will not produce a symmetric result, but does not require extra buffer)
Public function bool

UE::Geometry::CurveUtil::IsConvex2 ( const TArrayView< const VectorType > Vertices,
RealType Tolerance,
bool bDegenerateIsConvex
)

 Tests closed, 2D curve for convexity, with an optional tolerance allowing for approximately-collinear points Note that tolerance is per vertex angle, so a very-finely-sampled smooth concavity could be reported as convex
Public function void

UE::Geometry::CurveUtil::IterativeSmooth ( TArrayView< VectorType > Vertices,
int StartIdx,
int EndIdx,
double Alpha,
int NumIterations,
bool bClosed
)

 Smooth set of vertices using extra buffer
Public function bool

UE::Geometry::CurveUtil::ProjectPointInsideConvexPolygon ( const TArrayView< const TVector2< RealType > > Vertices,
TVector2< RealType >& ProjPt,
bool bReverseOrientation
)

 Project point inside a convex polygon with known orientation
Public function RealType

UE::Geometry::CurveUtil::SignedArea2 ( const TArrayView< const VectorType >& Vertices
)

 Compute the signed area of a closed curve, assuming vertices in the XY plane
Public function VectorType

UE::Geometry::CurveUtil::Tangent ( const TArrayView< const VectorType >& Vertices,
int32 Idx
)

  
Public function VectorType

UE::Geometry::CurveUtil::Tangent ( const TArrayView< const VectorType >& Vertices,
int32 Idx,
bool bLoop
)

  
Public function RealType

UE::Geometry::CurveUtil::WindingIntegral2 ( const TArrayView< const VectorType >& Vertices,
const VectorType& QueryPoint
)

 Compute the winding of a point relative to a closed curve, assuming vertices in the XY plane

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page