Global Check of Candidate Points

Algorithm

Pseudocode

If the search is over points created with the Centroid method:

Loop over each candidate point ( P_cand ):

Loop over nodes of containing element for P_cand ( N_cand ):

Loop over surrounding elements of N_cand ( E_n-cand ):

If P_cand is a sufficient distance from the candidate point contained in E_n-cand, it can be accepted.

Else, it cannot be accepted.

Else If the search is over points created with the Advancing Front method:

Loop over each candidate point ( P_cand ):

Loop over the candidate points of containing element for P_cand ( P_{other_cand} ):

If P_cand is a sufficient distance from the P_{other_cand}, it can be accepted.

Else P_cand it cannot be accepted.

Loop over nodes of containing element for P_cand ( N_cand ):

Loop over surrounding elements of N_cand ( E_n-cand ):

If P_cand is a sufficient distance from the candidate points contained in E_n-cand, it can be accepted.

Else P_cand it cannot be accepted.