Data with caches for optimizing fan triangulation. More...

#include <MRPointCloudTriangulationHelpers.h>

Public Attributes
std::vector< VertId >	neighbors

std::vector< std::pair< double, int > >	cacheAngleOrder
	temporary reusable storage to avoid allocations for each point

VertId	border

FewSmallest< PointsProjectionResult >	nearesetPoints
	the storage to collect n-nearest neighbours, here to avoid allocations for each point

std::priority_queue< FanOptimizerQueueElement >	queue
	the queue to optimize local triangulation, here to avoid allocations for each point

Detailed Description

Data with caches for optimizing fan triangulation.

Member Data Documentation

◆ border

VertId MR::TriangulationHelpers::TriangulatedFanData::border

first border edge (invalid if the center point is not on the boundary) triangle associated with this point is absent

◆ cacheAngleOrder

std::vector<std::pair<double, int> > MR::TriangulationHelpers::TriangulatedFanData::cacheAngleOrder

temporary reusable storage to avoid allocations for each point

◆ nearesetPoints

FewSmallest<PointsProjectionResult> MR::TriangulationHelpers::TriangulatedFanData::nearesetPoints

the storage to collect n-nearest neighbours, here to avoid allocations for each point

◆ neighbors

std::vector<VertId> MR::TriangulationHelpers::TriangulatedFanData::neighbors

clockwise points around center point in (optimized) triangle fan, each pair of points (as well as back()-front() pair) together with the center form a fan triangle

◆ queue

std::priority_queue<FanOptimizerQueueElement> MR::TriangulationHelpers::TriangulatedFanData::queue

the queue to optimize local triangulation, here to avoid allocations for each point

The documentation for this struct was generated from the following file:

MRPointCloudTriangulationHelpers.h