cgal/sdgap/include/CGAL
Sandeep Kumar Dey 8df7354020 vertex conf and finite edge conf modified
In Vertex conf pqt case
we can have infinite vertex even if p is not endpoint of q
and so previous assertion is removed, and the case is included
when p is not end point of q, and we check for the conflict
due to insertion of t
In Finite edge conf for p,q,t,sgn functor
we removed the assertion of p is endpoint of q,
and included the case when p is not end point of q
and check for the conflict with t
This solves the test case h2.cin
2015-06-30 10:30:49 +02:00
..
Qt
Segment_Delaunay_graph_Linf_2 vertex conf and finite edge conf modified 2015-06-30 10:30:49 +02:00
Cartesian_converter_Linf.h
Orientation_Linf_2.h
Polychain_2.h trailing whitespace removal in polychain code 2015-06-30 10:30:48 +02:00
Segment_Delaunay_graph_Linf_2.h draw components of polyline in draw_dual_edge 2015-06-30 10:30:48 +02:00
Segment_Delaunay_graph_Linf_adaptation_policies_2.h
Segment_Delaunay_graph_Linf_adaptation_traits_2.h
Segment_Delaunay_graph_Linf_face_base_2.h
Segment_Delaunay_graph_Linf_filtered_traits_2.h
Segment_Delaunay_graph_Linf_hierarchy_2.h
Segment_Delaunay_graph_Linf_hierarchy_vertex_base_2.h
Segment_Delaunay_graph_Linf_simple_site_2.h
Segment_Delaunay_graph_Linf_simple_storage_site_2.h
Segment_Delaunay_graph_Linf_site_2.h
Segment_Delaunay_graph_Linf_storage_site_2.h
Segment_Delaunay_graph_Linf_storage_site_with_info_2.h
Segment_Delaunay_graph_Linf_storage_traits_2.h
Segment_Delaunay_graph_Linf_storage_traits_with_info_2.h
Segment_Delaunay_graph_Linf_traits_2.h
Segment_Delaunay_graph_Linf_vertex_base_2.h
Side_of_bounded_square_2.h
Side_of_oriented_square_2.h