From e9c19883e20b383c879b05846bbac7b032bd4aad Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=A9bastien=20Loriot?= Date: Tue, 25 Jan 2011 09:02:35 +0000 Subject: [PATCH] add a comment to avoid a possible bug when using _find_leftmost_vertex_on_open_loop in another function that _is_inside_new_face. --- .../CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h | 6 ++++++ 1 file changed, 6 insertions(+) diff --git a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h index 02b09356178..9e7906a124d 100644 --- a/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h +++ b/Arrangement_on_surface_2/include/CGAL/Arrangement_2/Arrangement_on_surface_2_impl.h @@ -3451,6 +3451,12 @@ _compare_vertices_xy_impl (const DVertex * v1, const DVertex * v2, // the source vertex of the second halfedge, such that the new curve will // connect these two vertices. // +//Note that the lowest halfedge incident to the leftmost vertex (he_left_low) +//is the lowest in the open loop. In the case one needs to have the lowest incident +//halfedge in the interior of the closed loop, the first curve in compare_y_at_x_right_2 +//he_left_low->curve() must be replaced by (he_left_low!=he_before?he_left_low->curve():cv). +//Note that in both cases, the result of the (only) calling function _is_inside_new_face will be +//the same (the turn is the same). template std::pair::DVertex*,