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

Vertex_conflict pps case 

Vetex_conflict(pqt) pps case
p is enpt of t or q is endpt ot t
is reverted back.
(
return (o == RIGHT_TURN) ? NEGATIVE : POSITIVE;
)
This commit is contained in:
Sandeep Kumar Dey 2013-01-25 21:18:49 +01:00 committed by Panagiotis Cheilaris
parent 05998fd5f4
commit fc592fe79a
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
sdgap/include/CGAL/Segment_Delaunay_graph_Linf_2/Vertex_conflict_C2.h
View File

@ -437,14 +437,14 @@ private:
CGAL_SDG_DEBUG(std::cout << "debug incircle_pps p is endp of t: "
<< "p = " << p << ", q = " << q << ", t = " << t
<< " o = " << o << std::endl; );
return (o == RIGHT_TURN) ? POSITIVE : NEGATIVE;
return (o == RIGHT_TURN) ? NEGATIVE : POSITIVE;
} else if ( is_q_on_t ) {
Point_2 pt = is_q_tsrc ? t.target() : t.source();
Orientation o = CGAL::orientation(p.point(), q.point(), pt);
CGAL_SDG_DEBUG(std::cout << "debug incircle_pps q is endp of t: "
<< "p = " << p << ", q = " << q << ", t = " << t
<< " o = " << o << std::endl; );
return (o == RIGHT_TURN) ? POSITIVE : NEGATIVE;
return (o == RIGHT_TURN) ? NEGATIVE : POSITIVE;
} else {
// maybe here I should immediately return POSITIVE;
// since we insert endpoints of segments first, p and q cannot