Inheritance diagram for MR::EdgePathsAStarBuilder:

Public Member Functions
	EdgePathsAStarBuilder (const Mesh &mesh, VertId target, VertId start)

	EdgePathsAStarBuilder (const Mesh &mesh, const MeshTriPoint &target, const MeshTriPoint &start)

Public Member Functions inherited from MR::EdgePathsBuilderT< MetricToAStarPenalty >
bool	done () const
	returns true if further edge forest growth is impossible

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

const VertPathInfoMap &	vertPathInfoMap () const
	gives read access to the map from vertex to path to it

	EdgePathsBuilderT (const MeshTopology &topology, const EdgeMetric &metric)

bool	addStart (VertId startVert, float startMetric)

ReachedVert	reachNext ()

bool	addOrgRingSteps (const ReachedVert &rv)

ReachedVert	growOneEdge ()
	the same as reachNext() + addOrgRingSteps()

const VertPathInfo *	getVertInfo (VertId v) const
	returns one element from the map (or nullptr if the element is missing)

EdgePath	getPathBack (VertId backpathStart) const
	returns the path in the forest from given vertex to one of start vertices

Additional Inherited Members
Protected Attributes inherited from MR::EdgePathsBuilderT< MetricToAStarPenalty >
MR_NO_UNIQUE_ADDRESS MetricToAStarPenalty	metricToPenalty_

Detailed Description

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

Constructor & Destructor Documentation

MR::EdgePathsAStarBuilder::EdgePathsAStarBuilder	(	const Mesh &	mesh,
		VertId	target,
		VertId	start )

inline

MR::EdgePathsAStarBuilder::EdgePathsAStarBuilder	(	const Mesh &	mesh,
		const MeshTriPoint &	target,
		const MeshTriPoint &	start )

inline

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