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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
// Copyright (c) 2005 Tel-Aviv University (Israel).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you may redistribute it under
// the terms of the Q Public License version 1.0.
// See the file LICENSE.QPL distributed with CGAL.
//
// 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: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/CGAL-3.6-branch/Boolean_set_operations_2/include/CGAL/General_polygon_set_2.h $
// $Id: General_polygon_set_2.h 53311 2009-12-07 10:26:37Z efif $ $Date: 2009-12-07 11:26:37 +0100 (Mon, 07 Dec 2009) $
//
//
// Author(s) : Baruch Zukerman <baruchzu@post.tau.ac.il>
// Efi Fogel <efif@post.tau.ac.il>
#ifndef CGAL_GENERAL_POLYGON_SET_2_H
#define CGAL_GENERAL_POLYGON_SET_2_H
#include <CGAL/basic.h>
#include <CGAL/Boolean_set_operations_2/Gps_default_dcel.h>
#include <CGAL/General_polygon_set_on_surface_2.h>
#include <CGAL/Arrangement_2/Arr_default_planar_topology.h>
#include <CGAL/Arrangement_2.h>
CGAL_BEGIN_NAMESPACE
// General_polygon_set_2
template <class Traits_, class Dcel_ = Gps_default_dcel<Traits_> >
class General_polygon_set_2 : public General_polygon_set_on_surface_2
<Traits_, typename Default_planar_topology<Traits_, Dcel_ >::Traits>
{
protected:
typedef General_polygon_set_2< Traits_, Dcel_ > Self;
public:
typedef Traits_ Traits_2;
typedef Dcel_ Dcel;
typedef General_polygon_set_on_surface_2 <Traits_2,
typename Default_planar_topology<Traits_2, Dcel >::Traits>
Base;
typedef CGAL::Arrangement_2<Traits_2, Dcel> Arrangement_2;
typedef typename Base::Polygon_2 Polygon_2;
typedef typename Base::Polygon_with_holes_2 Polygon_with_holes_2;
// default costructor
General_polygon_set_2() : Base()
{}
// constructor with traits object
General_polygon_set_2(Traits_2& tr) : Base(tr)
{}
explicit General_polygon_set_2(const Polygon_2& pgn) :
Base(pgn)
{ }
explicit General_polygon_set_2(const Polygon_with_holes_2& pgn_with_holes):
Base(pgn_with_holes)
{ }
// For some reason the below functions (the ones that we call "using" for)
// are hidden by the function in this class and are not found in the parent's
// class (General_polygon_set_on_surface_2) when they are called on an
// object of type General_polygon_set_2.
// Check in the Vandervoorde / Stroustrup books what is the exact reason.
// (There may be a better and more correct solution.)
using Base::intersection;
using Base::join;
using Base::symmetric_difference;
inline void intersection(const Self& ps1, const Self& ps2)
{
Base::intersection(static_cast<const Base&>(ps1),
static_cast<const Base&>(ps2));
}
inline void join(const Self& ps1, const Self& ps2)
{
Base::join(static_cast<const Base&>(ps1),
static_cast<const Base&>(ps2));
}
inline void symmetric_difference(const Self& ps1, const Self& ps2)
{
Base::symmetric_difference(static_cast<const Base&>(ps1),
static_cast<const Base&>(ps2));
}
//@{
/*! Obtain a const reference to the underlying arrangement
* \return the underlying arrangement.
*/
const Arrangement_2& arrangement() const
{
return *(static_cast<const Arrangement_2*>(this->m_arr));
}
/*! Obtain a reference to the underlying arrangement
* \return the underlying arrangement.
*/
Arrangement_2& arrangement()
{
return *(static_cast<Arrangement_2*>(this->m_arr));
}
//@}
};
CGAL_END_NAMESPACE
#endif
|
