|
Medusa
1.1
Coordinate Free Mehless Method implementation
|
|
Go to the documentation of this file.
11 nodes_ = nodes;
return *
this;
27 assert_msg(0.0 <= in && in < 2.0,
"Weird projection threshold, it is equal to %.6f, "
28 "but expected in range [0, 1].", in);
Range< int > nodes_
List of nodes to process.
Root namespace for the whole library.
ProjectionType projection_type
On boundary projection method.
BasicRelax & initialHeat(double in)
Sets initial heat.
BasicRelax & boundaryProjectionThreshold(double in)
Sets threshold for adding nodes on boundary, i.e. if node and are distances to closest boundary nod...
BasicRelax & finalHeat(double in)
Sets final heat.
BasicRelax & rebuildTreeAfter(int iterations)
Sets rebuild tree frequency.
#define assert_msg(cond,...)
Assert with better error reporting.
BasicRelax & potentialOrder(int order)
Sets order of repulsing potential.
BasicRelax & onlyNodes(Range< int > nodes)
Move only given nodes.
double boundary_projection_threshold
Threshold for projecting nodes on boundary.
ProjectionType
Indicating type of projection used when a relax node goes out of the domain.
int num_neighbours
Number of nodes to consider when calculating the potential.
BasicRelax & iterations(int iterations)
Sets number of iterations.
double final_heat
Heat at the end of the relax, usually around 0.
double initial_heat
Initial heat, usually between 0 and 5.
int num_iterations
Number of iterations performed.
BasicRelax & projectionType(ProjectionType in)
Determines how to handle nodes that escape during relaxation.
int rebuild_tree_after
How often engine rebuild search tree, 1 is perfect but slow.
int potential_order
Order of repulsing potential.
BasicRelax & numNeighbours(int neighbours)
Sets num neighbours.
Redistributes nodes towards more uniform distribution by minimizing potential between nodes.