mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty Class Reference

Inheritance diagram for mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty:

Classes
class	ReachedVert

Public Member Functions
None	__init__ (self, MeshTopology topology, func_float_from_Id_EdgeTag metric)
None	__init__ (self, EdgePathsBuilderT_MetricToAStarPenalty 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)

Detailed Description

Generated from:  MR::EdgePathsBuilderT<MR::MetricToAStarPenalty>

the class is responsible for finding smallest metric edge paths on a mesh

Constructor & Destructor Documentation

__init__() [1/2]

None mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.__init__	(		self,
		MeshTopology	topology,
		func_float_from_Id_EdgeTag	metric )

Reimplemented in mrmeshpy.EdgePathsAStarBuilder, mrmeshpy.EdgePathsAStarBuilder, and mrmeshpy.EdgePathsAStarBuilder.

__init__() [2/2]

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

Implicit copy constructor.

Reimplemented in mrmeshpy.EdgePathsAStarBuilder, mrmeshpy.EdgePathsAStarBuilder, and mrmeshpy.EdgePathsAStarBuilder.

Member Function Documentation

_pybind11_conduit_v1_()

mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty._pybind11_conduit_v1_ ( * args, ** kwargs )

staticprotected

Reimplemented in mrmeshpy.EdgePathsAStarBuilder.

addOrgRingSteps()

bool mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.addOrgRingSteps	(		self,
		EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert	rv )

adds steps for all origin ring edges of the reached vertex;
returns true if at least one step was added

addStart()

bool mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.addStart	(		self,
		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

done()

bool mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.done

(

self

)

returns true if further edge forest growth is impossible

doneDistance()

float mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.doneDistance

(

self

)

returns path length till the next candidate vertex or maximum float value if all vertices have been reached

getPathBack()

std_vector_Id_EdgeTag mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.getPathBack	(		self,
		VertId	backpathStart )

returns the path in the forest from given vertex to one of start vertices

getVertInfo()

VertPathInfo mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.getVertInfo	(		self,
		VertId	v )

returns one element from the map (or nullptr if the element is missing)

growOneEdge()

EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.growOneEdge

(

self

)

the same as reachNext() + addOrgRingSteps()

reachNext()

EdgePathsBuilderT_MetricToAStarPenalty.ReachedVert mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.reachNext

(

self

)

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

vertPathInfoMap()

phmap_flat_hash_map_Id_VertTag_VertPathInfo mrmeshpy.EdgePathsBuilderT_MetricToAStarPenalty.vertPathInfoMap

(

self

)

gives read access to the map from vertex to path to it

---

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

• mrmeshpy.pyi