Public Member Functions | |
None | __init__ (self, Mesh mesh, VertId target, VertId start) |
None | __init__ (self, Mesh mesh, MeshTriPoint target, MeshTriPoint start) |
None | __init__ (self, EdgePathsAStarBuilder arg0) |
![]() | |
bool | addOrgRingSteps (self, EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert rv) |
bool | addStart (self, VertId startVert, float startMetric) |
bool | done (self) |
float | doneDistance (self) |
std_vector_Id_EdgeTag | getPathBack (self, VertId backpathStart) |
VertPathInfo | getVertInfo (self, VertId v) |
EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert | growOneEdge (self) |
EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert | reachNext (self) |
phmap_flat_hash_map_Id_VertTag_VertPathInfo | vertPathInfoMap (self) |
Static Protected Member Functions | |
_pybind11_conduit_v1_ (*args, **kwargs) | |
Generated from: MR::EdgePathsAStarBuilder the class is responsible for finding shortest edge paths on a mesh in Euclidean metric using A* heuristics
Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.
None mrmeshpy.EdgePathsAStarBuilder.__init__ | ( | self, | |
Mesh | mesh, | ||
MeshTriPoint | target, | ||
MeshTriPoint | start ) |
Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.
None mrmeshpy.EdgePathsAStarBuilder.__init__ | ( | self, | |
EdgePathsAStarBuilder | arg0 ) |
Implicit copy constructor.
Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.
|
staticprotected |
Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.