cgal/sdgap
Sandeep Kumar Dey fc592fe79a 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;
)
2015-06-30 10:30:56 +02:00
..
demo generate non intersecting segments 2015-06-30 10:30:55 +02:00
examples/Segment_Delaunay_graph_Linf_2 program that prints SDG L2 details 2015-06-30 10:30:54 +02:00
include/CGAL Vertex_conflict pps case 2015-06-30 10:30:56 +02:00