124 lines
3.8 KiB
C++
Executable File
124 lines
3.8 KiB
C++
Executable File
// Copyright (c) 2005 Tel-Aviv University (Israel).
|
|
// 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) : 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/license/Boolean_set_operations_2.h>
|
|
|
|
#include <CGAL/disable_warnings.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>
|
|
|
|
namespace CGAL {
|
|
|
|
// 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(const 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));
|
|
}
|
|
|
|
//@}
|
|
};
|
|
|
|
} //namespace CGAL
|
|
|
|
#include <CGAL/enable_warnings.h>
|
|
|
|
#endif
|