Skip to content
Snippets Groups Projects
Commit a68c2ecb authored by GUEZ Lionel's avatar GUEZ Lionel
Browse files

Polish

parent 066684e6
No related branches found
No related tags found
No related merge requests found
......@@ -29,7 +29,8 @@ contains
! abs(ediff1d(cont_list_proj(:n_cont)%ssh)) is in descending
! order. (See notes for a proof.) On return, n_cont == 1 means we
! have only found one good contour at innermost_level_2 and it has
! sufficient area.
! sufficient area. On return, n_cont == 0 .eqv. out_cont ==
! null_polyline().
! Method: dichotomy on level of ssh.
......
......@@ -100,6 +100,7 @@ contains
! Done with outermost contour, now let us take care of the
! max-speed contour.
if (out_cont%closed) then
! assert n_cont >= 1
! {begin} Restrict the field to the outermost contour:
llc = floor((corner_whole - corner) / step &
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment