/usr/include/CGAL/Arrangement_2.h is in libcgal-dev 4.11-2build1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 | // Copyright (c) 2006,2007,2009,2010,2011 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$
//
//
// Author(s): Ron Wein <wein@post.tau.ac.il>
// Efi Fogel <efif@post.tau.ac.il>
#ifndef CGAL_ARRANGEMENT_2_H
#define CGAL_ARRANGEMENT_2_H
#include <CGAL/license/Arrangement_on_surface_2.h>
/*! \file
* The header file for the Arrangement_2<Traits,Dcel> class.
*/
#include <CGAL/Arr_tags.h>
#include <CGAL/Arrangement_on_surface_2.h>
#include <CGAL/Arrangement_2/Arr_default_planar_topology.h>
namespace CGAL {
/*! \class Arrangement_2
* The arrangement class, representing planar subdivisions induced by
* a set of arbitrary planar curves.
* The GeomTraits parameter corresponds to a geometry-traits class that
* defines the Point_2 and X_monotone_curve_2 types and implements the
* geometric predicates and constructions for the family of curves it defines.
* The Dcel parameter should be a model of the ArrDcel concept and support
* the basic topological operations on a doubly-connected edge-list.
*/
template <class GeomTraits_,
class Dcel_ = Arr_default_dcel<GeomTraits_> >
class Arrangement_2 :
public Arrangement_on_surface_2
<GeomTraits_, typename Default_planar_topology<GeomTraits_, Dcel_>::Traits>
{
protected:
typedef Default_planar_topology<GeomTraits_, Dcel_ > Default_topology;
public:
typedef Arrangement_on_surface_2<GeomTraits_,
typename Default_topology::Traits>
Base;
typedef GeomTraits_ Geometry_traits_2;
typedef Dcel_ Dcel;
typedef Arrangement_2<Geometry_traits_2, Dcel> Self;
typedef typename Base::Point_2 Point_2;
typedef typename Base::X_monotone_curve_2 X_monotone_curve_2;
typedef typename Default_topology::Traits Topology_traits;
// Type definitions.
typedef typename Base::Vertex Vertex;
typedef typename Base::Halfedge Halfedge;
typedef typename Base::Face Face;
typedef typename Base::Size Size;
typedef typename Base::Vertex_iterator Vertex_iterator;
typedef typename Base::Vertex_const_iterator Vertex_const_iterator;
typedef typename Base::Halfedge_iterator Halfedge_iterator;
typedef typename Base::Halfedge_const_iterator Halfedge_const_iterator;
typedef typename Base::Edge_iterator Edge_iterator;
typedef typename Base::Edge_const_iterator Edge_const_iterator;
typedef typename Base::Face_iterator Face_iterator;
typedef typename Base::Face_const_iterator Face_const_iterator;
typedef typename Base::Halfedge_around_vertex_circulator
Halfedge_around_vertex_circulator;
typedef typename Base::Halfedge_around_vertex_const_circulator
Halfedge_around_vertex_const_circulator;
typedef typename Base::Ccb_halfedge_circulator Ccb_halfedge_circulator;
typedef typename Base::Ccb_halfedge_const_circulator
Ccb_halfedge_const_circulator;
typedef typename Base::Outer_ccb_iterator Outer_ccb_iterator;
typedef typename Base::Outer_ccb_const_iterator Outer_ccb_const_iterator;
typedef typename Base::Inner_ccb_iterator Inner_ccb_iterator;
typedef typename Base::Inner_ccb_const_iterator Inner_ccb_const_iterator;
typedef typename Base::Isolated_vertex_iterator Isolated_vertex_iterator;
typedef typename Base::Isolated_vertex_const_iterator
Isolated_vertex_const_iterator;
typedef typename Base::Vertex_handle Vertex_handle;
typedef typename Base::Vertex_const_handle Vertex_const_handle;
typedef typename Base::Halfedge_handle Halfedge_handle;
typedef typename Base::Halfedge_const_handle Halfedge_const_handle;
typedef typename Base::Face_handle Face_handle;
typedef typename Base::Face_const_handle Face_const_handle;
// These types are defined for backward compatibility:
typedef Geometry_traits_2 Traits_2;
typedef typename Base::Inner_ccb_iterator Hole_iterator;
typedef typename Base::Inner_ccb_const_iterator Hole_const_iterator;
private:
friend class Arr_observer<Self>;
friend class Arr_accessor<Self>;
public:
/// \name Constructors.
//@{
/*! Default constructor. */
Arrangement_2 () :
Base ()
{}
/*! Copy constructor (from a base arrangement). */
Arrangement_2 (const Base& base) :
Base (base)
{}
/*! Constructor given a traits object. */
Arrangement_2 (const Traits_2 *tr) :
Base (tr)
{}
//@}
/// \name Assignment functions.
//@{
/*! Assignment operator (from a base arrangement). */
Self& operator= (const Base& base)
{
Base::assign (base);
return (*this);
}
/*! Assign an arrangement. */
void assign (const Base& base)
{
Base::assign (base);
return;
}
//@}
///! \name Specialized access methods.
//@{
/*! Obtain the geometry-traits class. */
const Traits_2* traits () const
{
return (this->geometry_traits());
}
/*! Obtain the number of vertices at infinity. */
Size number_of_vertices_at_infinity () const
{
// The vertices at infinity are valid, but not concrete:
return (this->topology_traits()->number_of_valid_vertices() -
this->topology_traits()->number_of_concrete_vertices());
}
/*! Obtain the unbounded face (non-const version). */
Face_handle unbounded_face ()
{
// The fictitious un_face contains all other valid faces in a single
// hole inside it. We return a handle to one of its neighboring faces,
// which is necessarily unbounded.
typename Base::DFace *un_face =
const_cast<typename Base::DFace*>(this->topology_traits()->
initial_face());
if (! un_face->is_fictitious())
return (Face_handle (un_face));
typename Base::DHalfedge *p_he = *(un_face->inner_ccbs_begin());
typename Base::DHalfedge *p_opp = p_he->opposite();
typename Base::DOuter_ccb *p_oc = p_opp->outer_ccb();
return (Face_handle (p_oc->face()));
}
/*! Get the unbounded face (const version). */
Face_const_handle unbounded_face () const
{
// The fictitious un_face contains all other valid faces in a single
// hole inside it. We return a handle to one of its neighboring faces,
// which is necessarily unbounded.
const typename Base::DFace *un_face =
this->topology_traits()->initial_face();
if (! un_face->is_fictitious())
return (Face_const_handle (un_face));
const typename Base::DHalfedge *p_he = *(un_face->inner_ccbs_begin());
const typename Base::DHalfedge *p_opp = p_he->opposite();
const typename Base::DOuter_ccb *p_oc = p_opp->outer_ccb();
return (Face_const_handle (p_oc->face()));
}
//@}
protected:
/// \name Managing and notifying the arrangement observers.
//@{
typedef Arr_observer<Self> Observer;
/*!
* Register a new observer (so it starts receiving notifications).
* \param p_obs A pointer to the observer object.
*/
void _register_observer (Observer *p_obs)
{
Base::_register_observer ((typename Base::Observer*)p_obs);
return;
}
/*!
* Unregister a new observer (so it stops receiving notifications).
* \param p_obs A pointer to the observer object.
* \return Whether the observer was successfully unregistered.
*/
bool _unregister_observer (Observer *p_obs)
{
return (Base::_unregister_observer ((typename Base::Observer*)p_obs));
}
//@}
};
} //namespace CGAL
#endif
|