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

float	doneDistance () const

const VertPathInfoMap &	vertPathInfoMap () const

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

bool	addStart (VertId startVert, float startMetric)

ReachedVert	reachNext ()

bool	addOrgRingSteps (const ReachedVert &rv)

ReachedVert	growOneEdge ()

const VertPathInfo *	getVertInfo (VertId v) const

EdgePath	getPathBack (VertId backpathStart) const

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: