Navigation
API > API/Runtime > API/Runtime/Voronoi
Use a Voronoi diagram to support faster querying of Voronoi-like data from arbitrary sample points:
- Distance to closest point
- ID of closest point
- IDs of closest two points
- Distance to closest Voronoi cell boundary (not considering bounding box walls)
Note: Queries are only thread safe if each thread has its own FVoronoiComputeHelper
| Name | FVoronoiDiagramField |
| Type | class |
| Header File | /Engine/Source/Runtime/Experimental/Voronoi/Public/Voronoi/Voronoi.h |
| Include Path | #include "Voronoi/Voronoi.h" |
Syntax
class FVoronoiDiagramField
Constructors
| Name | Remarks | Include Path | Unreal Specifiers |
|---|---|---|---|
| Voronoi/Voronoi.h | |||
FVoronoiDiagramField
(
const FVoronoiDiagramField& Other |
Voronoi/Voronoi.h | ||
FVoronoiDiagramField
(
FVoronoiDiagramField&& Other |
Voronoi/Voronoi.h | ||
FVoronoiDiagramField
(
const TArray< FVector >& SitesIn, |
Voronoi/Voronoi.h |
Variables
Protected
| Name | Type | Remarks | Include Path | Unreal Specifiers |
|---|---|---|---|---|
| Diagram | FVoronoiDiagram | Voronoi/Voronoi.h | ||
| Neighbors | TArray< TArray< int32 > > | Voronoi/Voronoi.h | ||
| Sites | TArray< FVector > | Voronoi/Voronoi.h |
Functions
Public
| Name | Remarks | Include Path | Unreal Specifiers |
|---|---|---|---|
int32 ClosestID
(
const FVector& Sample, |
Voronoi/Voronoi.h | ||
TPair< int32, int32 > ClosestTwoIDs
(
const FVector& Sample, |
Voronoi/Voronoi.h | ||
double DistanceToCellWall
(
const FVector& Sample, |
Voronoi/Voronoi.h | ||
double DistanceToClosest
(
const FVector& Sample, |
Voronoi/Voronoi.h | ||
FVoronoiComputeHelper GetComputeHelper() |
Voronoi/Voronoi.h | ||
void Initialize
(
const TArray< FVector >& SitesIn, |
Voronoi/Voronoi.h |
Operators
| Name | Remarks | Include Path | Unreal Specifiers |
|---|---|---|---|
FVoronoiDiagramField & operator=
(
const FVoronoiDiagramField& Other |
Voronoi/Voronoi.h | ||
FVoronoiDiagramField & operator=
(
FVoronoiDiagramField&& Other |
Voronoi/Voronoi.h |