1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
|
// Copyright (c) 2003,2004,2005,2006 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
// You can redistribute it and/or modify it under the terms of the GNU
// General Public License as published by the Free Software Foundation,
// either version 3 of the License, or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL$
// $Id$
// SPDX-License-Identifier: GPL-3.0+
//
//
// Author(s) : Menelaos Karavelas <mkaravel@iacm.forth.gr>
#ifndef CGAL_SEGMENT_DELAUNAY_GRAPH_2_IS_DEGENERATE_EDGE_C2_H
#define CGAL_SEGMENT_DELAUNAY_GRAPH_2_IS_DEGENERATE_EDGE_C2_H
#include <CGAL/license/Segment_Delaunay_graph_2.h>
#include <CGAL/Segment_Delaunay_graph_2/Are_same_points_C2.h>
#include <CGAL/Segment_Delaunay_graph_2/Voronoi_vertex_C2.h>
namespace CGAL {
namespace SegmentDelaunayGraph_2 {
//-----------------------------------------------------------------------------
template<class K, class Method_tag>
class Is_degenerate_edge_C2
{
public:
typedef typename K::Site_2 Site_2;
typedef typename K::Boolean Boolean;
private:
typedef Voronoi_vertex_C2<K,Method_tag> Voronoi_vertex_2;
typedef Are_same_points_C2<K> Are_same_points_2;
bool is_endpoint(const Site_2& p, const Site_2& s) const
{
CGAL_precondition( p.is_point() && s.is_segment() );
Are_same_points_2 same_points;
return
same_points(p, s.source_site()) || same_points(p, s.target_site());
}
public:
typedef Boolean result_type;
typedef Site_2 argument_type;
Boolean operator()(const Site_2& p, const Site_2& q,
const Site_2& r, const Site_2& s) const
{
Voronoi_vertex_2 vpqr(p, q, r);
if ( vpqr.incircle_no_easy(s) == POSITIVE ) { return false; }
Voronoi_vertex_2 vqps(q, p, s);
if ( vqps.incircle_no_easy(r) == POSITIVE ) { return false; }
return true;
}
};
//-----------------------------------------------------------------------------
} //namespace SegmentDelaunayGraph_2
} //namespace CGAL
#endif // CGAL_SEGMENT_DELAUNAY_GRAPH_2_IS_DEGENERATE_EDGE_C2_H
|
