cgal/sdgap/include/CGAL/Segment_Delaunay_graph_Linf_2
Sandeep Kumar Dey 7e59eca349 inf-edge-conf q,s,r,t
For t = segment, it is not always false
When q is end point of both r and t,
and s is end point of t, we should return
true.
2015-06-30 10:30:53 +02:00
..
Are_parallel_C2.h
Are_same_points_C2.h
Are_same_segments_C2.h
Arrangement_enum.h
Arrangement_type_C2.h
Arrangement_type_non_intersecting_C2.h
Basic_predicates_C2.h
Bisector_Linf.h
Bisector_Linf_Old.h
Cartesian_converter.h
Compare_x_2.h
Compare_y_2.h
Construct_storage_site_2.h
Construct_storage_site_with_info_2.h
Constructions_C2.h construction and inf-edge-conf 2015-06-30 10:30:52 +02:00
Constructions_C2_Old.h
Filtered_traits_base_2.h
Filtered_traits_concept_check_tags.h
Finite_edge_interior_conflict_C2.h removed assertion in fec 2015-06-30 10:30:52 +02:00
Infinite_edge_interior_conflict_C2.h inf-edge-conf q,s,r,t 2015-06-30 10:30:53 +02:00
Is_degenerate_edge_C2.h
Is_horizontal_2.h
Is_minus45_2.h
Is_plus45_2.h
Is_slope_negative_2.h
Is_slope_positive_2.h
Is_vertical_2.h
Kernel_wrapper_2.h
Orientation_C2.h
Orientation_L2_C2.h
Orientation_Linf_C2.h
Oriented_side_C2.h
Oriented_side_of_bisector_C2.h compare_distances_sp from q 2015-06-30 10:30:49 +02:00
Predicates_C2.h
Segment_Delaunay_graph_Linf_2_impl.h support for verbose printing of SDG 2015-06-30 10:30:52 +02:00
Segment_Delaunay_graph_Linf_hierarchy_2_impl.h
Sqrt_extension_1.h
Sqrt_extension_2.h
Traits_base_2.h
Traits_wrapper_2.h
Triangulation_face_base_with_edges_2.h
Vertex_conflict_C2.h vertex conflict pqt 2015-06-30 10:30:53 +02:00
Voronoi_vertex_C2.h
Voronoi_vertex_ring_C2.h
Voronoi_vertex_sqrt_field_C2.h
Voronoi_vertex_sqrt_field_new_C2.h compute PPS vertex 2015-06-30 10:30:50 +02:00
basic.h
edge_list.h
in_place_edge_list.h