class for the fast marching 2-D algorithm More...
|FMM2D (const Grid &g, Vect< real_t > *phi, bool HA)|
|void||InitHeap (Heap &NarrowPt)|
|Execute Fast Marching Procedure. |
|void||Evaluate (IPoint &pt, int sign)|
|compute the distance from node to interface More...|
|void||ExtendSpeed (Vect< real_t > &F)|
|Extend the speed function to the whole grid. More...|
|Check error by comparing with the gradient norm. More...|
class for the fast marching 2-D algorithm
This class manages the 2-D Fast Marching method
Constructor & Destructor Documentation
[in] g Instance of class Grid [in] phi Vector containing the level set function at grid nodes. The values are
0on the interface (from which the distance is computed), positive on one side and negative on the other side. They must contain the signed distance on the nodes surrounding the interface but can take any value on other nodes, provided they have the right sign.
[in] HA true if the program must be executed with high accuracy, false otherwise
Member Function Documentation
|void InitHeap||(||Heap &||NarrowPt||)|
Initialize the heap
[in,out] NarrowPt Heap containing Narrow points
|void Evaluate||(||IPoint &||pt,|
compute the distance from node to interface
[in] pt node to treat [in] sign Node sign
- distance from node
Extend the speed function to the whole grid.
[in,out] F Vector containing the speed at interface nodes on input and extended speed to all grid nodes
Check error by comparing with the gradient norm.
This function returns discrete L2 and Max. errors