fact: Definition display_break_points (e : edge) (bps : seq Q) := List.concat ( List.map (fun e => (display_edge 300 400 70 (Bedge (Bpt (p_x (right_pt e) - 0.5) (p_y (right_pt e))) (Bpt (p_x (right_pt e) + 0.5) (p_y (right_pt e)))) :: display_edge 300 400 70 (Bedge (Bpt (p_x (right_pt e)) (p_y (right_pt e) - 0.5)) (Bpt (p_x (right_pt e)) (p_y (right_pt e) + 0.5))) :: nil)) (make_broken_edges e bps)).
imports: Arith QArith List smooth_trajectories Reals