the class is responsible for finding smallest metric edge paths on a mesh More...
#include <MREdgePathsBuilder.h>
Classes | |
struct | ReachedVert |
Public Member Functions | |
bool | done () const |
float | doneDistance () const |
const VertPathInfoMap & | vertPathInfoMap () const |
Protected Attributes | |
MetricToPenalty | metricToPenalty_ |
EdgePathsBuilderT (const MeshTopology &topology, const EdgeMetric &metric) | |
bool | addStart (VertId startVert, float startMetric) |
ReachedVert | reachNext () |
bool | addOrgRingSteps (const ReachedVert &rv) |
ReachedVert | growOneEdge () |
const VertPathInfo * | getVertInfo (VertId v) const |
EdgePath | getPathBack (VertId backpathStart) const |
the class is responsible for finding smallest metric edge paths on a mesh
MR::EdgePathsBuilderT< MetricToPenalty >::EdgePathsBuilderT | ( | const MeshTopology & | topology, |
const EdgeMetric & | metric ) |
bool MR::EdgePathsBuilderT< MetricToPenalty >::addOrgRingSteps | ( | const ReachedVert & | rv | ) |
bool MR::EdgePathsBuilderT< MetricToPenalty >::addStart | ( | VertId | startVert, |
float | startMetric ) |
|
inline |
|
inline |
EdgePath MR::EdgePathsBuilderT< MetricToPenalty >::getPathBack | ( | VertId | backpathStart | ) | const |
const VertPathInfo * MR::EdgePathsBuilderT< MetricToPenalty >::getVertInfo | ( | VertId | v | ) | const |
auto MR::EdgePathsBuilderT< MetricToPenalty >::growOneEdge | ( | ) |
auto MR::EdgePathsBuilderT< MetricToPenalty >::reachNext | ( | ) |
|
inline |
|
protected |