mirror of https://github.com/CGAL/cgal
c07ae4ba42
The oriented_side predicate is used with a face corresponding to
the interior of a segment that is split by a vertex contained in
the segment. For an infinite such face the code has to become more
general in order to accomodate the Linf case. For example, in L2
the number of such infinite faces is 0, 2, or 4, whereas in Linf,
it can be any even non-negative integer.
Moreover, the existing code for infinite faces is L2 specific and
ignores the interior of the segment for its decision. In Linf the
interior of the segment is important. For this reason, there is a
new case of the predicate that is general enough to also
accomodate Linf:
// computes the oriented side of the Voronoi vertex of s1, s2, inf
// wrt the line that passes through the point p and its direction
// is the direction of the supporting line of s, rotated by 90
// degrees counterclockwise.
Oriented_side operator()(const Site_2& s1, const Site_2& s2,
const Site_2& s, const Site_2& p) const
The Oriented_side_C2 class is also adapted for L2 to use the new
form of the predicate, which internally calls the old form.
|
||
|---|---|---|
| .. | ||
| Segment_Delaunay_graph_2 | ||
| Edge_hash_function.h | ||
| Filtered_construction.h | ||
| Segment_Delaunay_graph_2.h | ||
| Segment_Delaunay_graph_face_base_2.h | ||
| Segment_Delaunay_graph_filtered_traits_2.h | ||
| Segment_Delaunay_graph_hierarchy_2.h | ||
| Segment_Delaunay_graph_hierarchy_vertex_base_2.h | ||
| Segment_Delaunay_graph_simple_site_2.h | ||
| Segment_Delaunay_graph_simple_storage_site_2.h | ||
| Segment_Delaunay_graph_site_2.h | ||
| Segment_Delaunay_graph_storage_site_2.h | ||
| Segment_Delaunay_graph_storage_site_with_info_2.h | ||
| Segment_Delaunay_graph_storage_traits_2.h | ||
| Segment_Delaunay_graph_storage_traits_with_info_2.h | ||
| Segment_Delaunay_graph_traits_2.h | ||
| Segment_Delaunay_graph_vertex_base_2.h | ||