public

Inheritance Graph

graph BT
	GreedyCluster
	GreedyCluster --> AbstractSurfelSampler
	click GreedyCluster "classMinSG_1_1BlueSurfels_1_1GreedyCluster"
	click AbstractSurfelSampler "classMinSG_1_1BlueSurfels_1_1AbstractSurfelSampler"

Description

Computes an exact greedy permutation of the input samples.

Inspired by: Sariel Har-Peled and Manor Mendel Fast Construction of Nets in Low-Dimensional Metrics and Their Applications SIAM Journal on Computing (2006).https://doi.org/10.1137/s0097539704446281

Public Functions

   
   
Rendering::Mesh * sampleSurfels( Rendering::Mesh * sourceMesh)
   
void setMinRadius(float r)
   
float getMinRadius() const
   
std::map< uint32_t, float > getSampleTimes() const

Documentation

function
MinSG::BlueSurfels::GreedyCluster::sampleSurfels

public virtual
     
     
Rendering::Mesh * sampleSurfels( Rendering::Mesh * sourceMesh )

Defined in MinSG/Ext/BlueSurfels/Samplers/GreedyCluster.h:33

function
MinSG::BlueSurfels::GreedyCluster::setMinRadius

public inline
     
     
void setMinRadius( float r )

Defined in MinSG/Ext/BlueSurfels/Samplers/GreedyCluster.h:35

function
MinSG::BlueSurfels::GreedyCluster::getMinRadius

public const inline
   
   
float getMinRadius( ) const

Defined in MinSG/Ext/BlueSurfels/Samplers/GreedyCluster.h:36

function
MinSG::BlueSurfels::GreedyCluster::getSampleTimes

public const inline
   
   
std::map< uint32_t, float > getSampleTimes( ) const

Defined in MinSG/Ext/BlueSurfels/Samplers/GreedyCluster.h:38