|
MeshLib C# Docs
|
|
MeshLib C# Docs
|
the class is responsible for finding smallest metric edge paths on a mesh Generated from class MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>. This is the non-const half of the class.
More...
Inheritance diagram for MR.EdgePathsBuilderT_MRTrivialMetricToPenalty:Public Member Functions | |
| unsafe | EdgePathsBuilderT_MRTrivialMetricToPenalty (MR._ByValue_EdgePathsBuilderT_MRTrivialMetricToPenalty _other) |
Generated from constructor MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::EdgePathsBuilderT. | |
| unsafe | EdgePathsBuilderT_MRTrivialMetricToPenalty (MR.Const_MeshTopology topology, MR.Std.Const_Function_FloatFuncFromMREdgeId metric) |
Generated from constructor MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::EdgePathsBuilderT. | |
| unsafe | EdgePathsBuilderT_MRTrivialMetricToPenalty (MR.Const_MeshTopology topology) |
Generated from constructor MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::EdgePathsBuilderT. | |
| unsafe void | reset (MR.Std.Const_Function_FloatFuncFromMREdgeId metric) |
clears everything without freeing memory, and sets new metric Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::reset. | |
| unsafe bool | addStart (MR.VertId startVert, float startMetric) |
compares proposed metric with best value known for startVert; if proposed metric is smaller then adds it in the queue and returns true Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::addStart. | |
| unsafe MR.EdgePathsBuilderT_MRTrivialMetricToPenalty.ReachedVert | reachNext () |
include one more vertex in the final forest, returning vertex-info for the newly reached vertex; returns invalid VertId in v-field if no more vertices left Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::reachNext. | |
| unsafe bool | addOrgRingSteps (MR.EdgePathsBuilderT_MRTrivialMetricToPenalty.Const_ReachedVert rv) |
adds steps for all origin ring edges of the reached vertex; returns true if at least one step was added Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::addOrgRingSteps. | |
| unsafe MR.EdgePathsBuilderT_MRTrivialMetricToPenalty.ReachedVert | growOneEdge () |
the same as reachNext() + addOrgRingSteps() Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::growOneEdge. | |
| Public Member Functions inherited from MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty | |
| virtual void | Dispose () |
| unsafe | Const_EdgePathsBuilderT_MRTrivialMetricToPenalty (MR._ByValue_EdgePathsBuilderT_MRTrivialMetricToPenalty _other) |
Generated from constructor MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::EdgePathsBuilderT. | |
| unsafe | Const_EdgePathsBuilderT_MRTrivialMetricToPenalty (MR.Const_MeshTopology topology, MR.Std.Const_Function_FloatFuncFromMREdgeId metric) |
Generated from constructor MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::EdgePathsBuilderT. | |
| unsafe | Const_EdgePathsBuilderT_MRTrivialMetricToPenalty (MR.Const_MeshTopology topology) |
Generated from constructor MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::EdgePathsBuilderT. | |
| unsafe bool | done () |
returns true if further edge forest growth is impossible Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::done. | |
| unsafe float | doneDistance () |
returns path length till the next candidate vertex or maximum float value if all vertices have been reached Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::doneDistance. | |
| unsafe MR.Phmap.Const_FlatHashMap_MRVertId_MRVertPathInfo | vertPathInfoMap () |
gives read access to the map from vertex to path to it Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::vertPathInfoMap. | |
| unsafe MR.? Const_VertPathInfo | getVertInfo (MR.VertId v) |
returns one element from the map (or nullptr if the element is missing) Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::getVertInfo. | |
| unsafe MR.Std.Vector_MREdgeId | getPathBack (MR.VertId backpathStart) |
returns the path in the forest from given vertex to one of start vertices Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::getPathBack. | |
| unsafe MR.VertId | trackPathBack (MR.VertId v, MR.Std.Vector_MREdgeId? res=null) |
tracks back path in the forest from the given vertex to one of start vertices, which is returned; optionally appends tracked path (res) Generated from method MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>::trackPathBack. | |
Additional Inherited Members | |
| Protected Member Functions inherited from MR.Const_EdgePathsBuilderT_MRTrivialMetricToPenalty | |
| virtual unsafe void | Dispose (bool disposing) |
| Protected Attributes inherited from MR.Misc.Object< Const_EdgePathsBuilderT_MRTrivialMetricToPenalty > | |
| bool | _IsOwningVal |
| Properties inherited from MR.Misc.Object< Const_EdgePathsBuilderT_MRTrivialMetricToPenalty > | |
| virtual bool | _IsOwning [get] |
| Returns true if this is an owning instance, and when disposed, will destroy the underlying C++ instance. If false, we assume that the underlying C++ instance will live long enough. | |
the class is responsible for finding smallest metric edge paths on a mesh Generated from class MR.EdgePathsBuilderT<MR.TrivialMetricToPenalty>. This is the non-const half of the class.
1.11.0 