1. Epic GamesDeveloper
  3. Spatial

Spatial

API > API/Runtime > API/Runtime/GeometryCore

Classes

  Type Name Description
Public struct FBRIOPoints Generate a "Biased Randomized Insertion Order" (BRIO) ordering for a point set by randomly bucketing the points, then applying Z-Order-Curve sorting (above) to each bucket This gives an ordering with point locality but enough randomization to typically avoid worst case behavior if using the ordering for Delaunay meshing  
Public class FDynamicFlagArray Utility class that allows for get/set of a flag for each integer ID, where the flag set automatically grows to contain whatever integer ID is passed  
Public class FGeometrySet3 FGeometrySet3 stores a set of 3D Points and Polyline curves, and supports spatial queries against these sets.  
Public struct FHitIntersectionResult    
Public struct FIntersectionsQueryResult    
Public struct FOccupancyGrid3 Sample mesh occupancy in a voxel grid by using the mesh's winding number, on voxel corners, to determine whether the voxel is fully contained within the interior of the mesh, touches the mesh's boundary, or is fully contained on the exterior of the mesh.  
Public struct FPointIntersection Intersection query result types for triangle mesh intersections  
Public class FPointSetHashtable FPointSetHashTable builds a spatial data structure that supports efficient range queries on a point set (in FPointSetAdapterd form).  
Public struct FPolygonIntersection    
Public struct FPriorityOrderPoints Generate a "priority ordering" for a point set  
Public struct FSegmentIntersection    
Public class FSegmentTree3 FSegmentTree3 is a spatial data structure for a set of 3D line segments.  
Public class FSparseDynamicOctree3 FSparseDynamicOctree3 sorts objects with axis-aligned bounding boxes into a dynamic sparse octree of axis-aligned uniform grid cells.  
Public class FSparseDynamicPointOctree3 FSparseDynamicPointOctree3 sorts Points with axis-aligned bounding boxes into a dynamic sparse octree of axis-aligned uniform grid cells.  
Public struct FSparseOctreeCell FSparseOctreeCell is a Node in a SparseDynamicOctree3.  
Public struct FSparsePointOctreeCell FSparsePointOctreeCell is a Node in a SparseDynamicOctree3.  
Public struct FZOrderCurvePoints Generate a "z-order curve" ordering for a point set by distributing the points to a quad- or octree and then reading the points indices back in tree traversal order This is useful for giving the points spatial locality so points that are close together in the ordering tend to be close together spatially, also  
Public class IIntersectionTarget IIntersectionTarget is an object that can be intersected with a ray  
Public class IMeshSpatial IMeshSpatial is an extension of ISpatial specifically for meshes  
Public class IOrientedProjectionTarget IOrientedProjectionTarget is a projection target that can return a normal in addition to the projected point  
Public class IProjectionTarget IProjectionTarget is an object that supports projecting a 3D point onto it  
Public class ISpatial ISpatial is a base interface for spatial queries  
Public class TBasicBlockedDenseGrid3 TBasicBlockedDenseGrid3 represents a 3D blocked uniform grid.  
Public class TBlockData3 Block Data Buffer, holds linear array of typed data.  
Public struct TBlockData3Layout Consistent translation between a linear array of size BlockSize to a 3d layout.  
Public class TBlockedDenseGrid3 TBlockedDenseGrid adds thread-safe access functions to the 3D blocked uniform grid, TBasicBlockedDenseGrid3.  
Public class TBlockedGrid3 TBlockedGrid3 represents a 3D uniform grid.  
Public class TBlockedGrid3Layout Spatial decomposition of a region of 3d ijk space into 3d cubes of size BlockSize (per side).  
Public class TDenseGrid2 2D dense grid of scalar values.  
Public class TDenseGrid3 3D dense grid of floating-point scalar values.  
Public class TMeshAABBTree3    
Public class TMeshSpatialSort Sorts a list meshes into a list of "Nests" where each Nest has an outer shell mesh and a list of contained-inside meshes  
Public class TMeshWindingNumberGrid Sample mesh winding number (MWN) on a discrete grid.  
Public class TPointHashGrid2 Hash Grid for values associated with 2D points.  
Public class TPointHashGrid3 Hash Grid for values associated with 3D points.  
Public class TSampledScalarField2 TSampledScalarField2 implements a generic 2D grid of values that can be interpolated in various ways.  
Public class TSparseGrid3 Dynamic sparse 3D grid.  

Typedefs

Name Description
FBlockedDenseGrid3d  
FBlockedDenseGrid3f  
FBlockedDenseGrid3i  
FBlockedGrid3b Note the bool grid uses a bitfield specialization
FBlockedGrid3d  
FBlockedGrid3f Note on the block size: 8 seems to be the sweet spot with vastly better performance in SDF generation perhaps because a float block can fit in the L1 cache with room to spare.
FBlockedGrid3i  
FDenseGrid2d  
FDenseGrid2f  
FDenseGrid2i  
FDenseGrid3d  
FDenseGrid3f  
FDenseGrid3i  
FMatrix3d  
FSampledScalarField2d  
FSampledScalarField2f  
FTriangle3d  
TPointHashGrid2d  
TPointHashGrid2f  
TPointHashGrid3d  
TPointHashGrid3f  

Functions

  Type Name Description
Public function void

FastTriWinding::ComputeCoeffs ( const TriangleMeshType& Mesh,
const TSet< int >& TriangleSet,
const FMeshTriInfoCache& TriCache,
FVector3d& P,
double& R,
FVector3d& Order1,
FMatrix3d& Order2,
int NumTasks
)

 Precompute constant coefficients of triangle winding number approximation (evaluated in parallel for large sets of triangles) P: 'Center' of expansion for Triangles (area-weighted centroid avg) R: max distance from P to Triangles Order1: first-order vector coeff Order2: second-order matrix coeff TriCache: precomputed triangle centroid/normal/area
Public function void

FastTriWinding::ComputeCoeffsSerial ( const TriangleMeshType& Mesh,
const IterableTriangleIndices& Triangles,
const FMeshTriInfoCache& TriCache,
FVector3d& P,
double& R,
FVector3d& Order1,
FMatrix3d& Order2
)

 Precompute constant coefficients of triangle winding number approximation (serial implementation) P: 'Center' of expansion for Triangles (area-weighted centroid avg) R: max distance from P to Triangles Order1: first-order vector coeff Order2: second-order matrix coeff TriCache: precomputed triangle centroid/normal/area
Public function double

FastTriWinding::EvaluateOrder1Approx ( const FVector3d& Center,
const FVector3d& Order1Coeff,
const FVector3d& Q
)

 Evaluate first-order FWN approximation at point Q, relative to Center c
Public function double

FastTriWinding::EvaluateOrder2Approx ( const FVector3d& Center,
const FVector3d& Order1Coeff,
const FMatrix3d& Order2Coeff,
const FVector3d& Q
)

 Evaluate second-order FWN approximation at point Q, relative to Center c
Public function double

FastTriWinding::Order1Approx ( const FTriangle3d& T,
const FVector3d& P,
const FVector3d& XN,
double XA,
const FVector3d& Q
)

 Triangle-winding-number first-order approximation.
Public function double

FastTriWinding::Order2Approx ( const FTriangle3d& T,
const FVector3d& P,
const FVector3d& XN,
double XA,
const FVector3d& Q
)

 Triangle-winding-number second-order approximation T is triangle, P is 'Center' of cluster of dipoles, Q is evaluation point (This is really just for testing)
Public function void  
Public function void  
Public function void

UE::Geometry::DenseGrid::AtomicIncDec ( FDenseGrid2i& Grid,
int32 i,
int32 j,
bool bDecrement
)

  
Public function void

UE::Geometry::DenseGrid::AtomicIncDec ( FDenseGrid3i& Grid,
int i,
int j,
int k,
bool bDecrement
)

  
Public function void  
Public function void  

Ask questions and help your peers Developer Forums

Write your own tutorials or read those from others Learning Library

On this page