songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

Add comments

This commit is contained in:
Laurent Rineau 2022-05-25 14:29:08 +02:00
parent d93e683588
commit 9ab9cdf898
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Triangulation_2/include/CGAL/Constrained_triangulation_2.h
View File

@ -1099,7 +1099,7 @@ intersect(Face_handle f, int i,
auto intersection_not_in_the_two_triangle = [&]() { auto intersection_not_in_the_two_triangle = [&]() {
if(orientation(pc,pd,pi) == RIGHT_TURN) { if(orientation(pc,pd,pi) == RIGHT_TURN) {
// check if `pi` is in the trangle (pc, pd, p0) // check if `pi` is in the triangle (pc, pd, p0)
const Point& p0 = f->vertex(i)->point(); const Point& p0 = f->vertex(i)->point();
if(orientation(p0, pc, pi) == LEFT_TURN || orientation(pd, p0, pi) == LEFT_TURN) { if(orientation(p0, pc, pi) == LEFT_TURN || orientation(pd, p0, pi) == LEFT_TURN) {
return true; return true;
@ -1107,7 +1107,7 @@ intersect(Face_handle f, int i,
} else { } else {
// orientation(pd, pc, pi) != LEFT_TURN // orientation(pd, pc, pi) != LEFT_TURN
const auto edge = mirror_edge({f, i}); const auto edge = mirror_edge({f, i});
// check if `pi` is in the trangle (pd, pc, p1) // check if `pi` is in the triangle (pd, pc, p1)
const Point& p1 = edge.first->vertex(edge.second)->point(); const Point& p1 = edge.first->vertex(edge.second)->point();
if(orientation(pc, p1, pi) == LEFT_TURN || orientation(p1, pd, pi) == LEFT_TURN) { if(orientation(pc, p1, pi) == LEFT_TURN || orientation(p1, pd, pi) == LEFT_TURN) {
return true; return true;