mrmeshpy.EdgePathsAStarBuilder Class Reference

Inheritance diagram for mrmeshpy.EdgePathsAStarBuilder:

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)
Public Member Functions inherited from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty
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 Public Member Functions
None	__init__ (*args, **kwargs)

Detailed Description

Generated from:  MR::EdgePathsAStarBuilder

the class is responsible for finding shortest edge paths on a mesh in Euclidean metric
using A* heuristics

Constructor & Destructor Documentation

__init__() [1/4]

None mrmeshpy.EdgePathsAStarBuilder.__init__ ( * args, ** kwargs )

static

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.

__init__() [2/4]

None mrmeshpy.EdgePathsAStarBuilder.__init__	(		self,
		Mesh	mesh,
		VertId	target,
		VertId	start )

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.

__init__() [3/4]

None mrmeshpy.EdgePathsAStarBuilder.__init__	(		self,
		Mesh	mesh,
		MeshTriPoint	target,
		MeshTriPoint	start )

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.

__init__() [4/4]

None mrmeshpy.EdgePathsAStarBuilder.__init__	(		self,
		EdgePathsAStarBuilder	arg0 )

Implicit copy constructor.

Reimplemented from mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.

---

The documentation for this class was generated from the following file:

• mrmeshpy.pyi