/usr/include/CGAL/Generalized_map_operations.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 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 | // Copyright (c) 2016 CNRS and LIRIS' Establishments (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 Lesser 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) : Guillaume Damiand <guillaume.damiand@liris.cnrs.fr>
//
#ifndef CGAL_GENERALIZED_MAP_OPERATIONS_H
#define CGAL_GENERALIZED_MAP_OPERATIONS_H 1
#include <CGAL/GMap_dart_const_iterators.h>
#include <CGAL/internal/Combinatorial_map_group_functors.h>
#include <deque>
namespace CGAL
{
/** @file Generalized_map_operations.h
* Some operations to modify a generalized map.
*/
/** Test if an i-cell can be removed.
* An i-cell can be removed if i==GMap::dimension or i==GMap::dimension-1,
* or if there are at most two (i+1)-cell incident to it.
* @param adart a dart of the i-cell.
* @return true iff the i-cell can be removed.
*/
template <class GMap, unsigned int i, unsigned int nmi=GMap::dimension-i>
struct Is_removable_functor_gmap
{
static bool run(const GMap& amap, typename GMap::Dart_const_handle adart)
{
// TODO? Optimisation for dim-2, and to not test all the darts of the cell?
bool res = true;
for ( CGAL::GMap_dart_const_iterator_of_cell<GMap,i> it(amap, adart);
res && it.cont(); ++it )
{
if (amap.template alpha<i+2,i+1>(it)!=amap.template alpha<i+1,i+2>(it))
res = false;
}
return res;
}
};
// Specialization for i=GMap::dimension
template <class GMap, unsigned int i>
struct Is_removable_functor_gmap<GMap, i, 0>
{
static bool run(const GMap&, typename GMap::Dart_const_handle)
{ return true; }
};
// Specialization for i=GMap::dimension-1
template <class GMap, unsigned int i>
struct Is_removable_functor_gmap<GMap, i, 1>
{
static bool run(const GMap&, typename GMap::Dart_const_handle)
{ return true; }
};
/** Remove an i-cell, 0<=i<dimension, and merge eventually both incident
* (i+1)-cells.
* @param amap the used generalized map.
* @param adart a dart of the i-cell to remove.
* @return the number of deleted darts.
*/
template<class GMap, unsigned int i, unsigned int nmi>
struct Remove_cell_functor_gmap
{
static size_t run(GMap& amap, typename GMap::Dart_handle adart,
bool update_attributes)
{
CGAL_static_assertion ( i<GMap::dimension );
CGAL_assertion( (amap.template is_removable<i>(adart)) );
size_t res = 0;
typename GMap::Dart_handle d1, d2;
typename GMap::Dart_handle dg1=amap.null_handle, dg2=amap.null_handle;
typename GMap::size_type mark = amap.get_new_mark();
typename GMap::size_type mark_modified_darts = amap.get_new_mark();
std::deque<typename GMap::Dart_handle> to_erase;
// First we store and mark all the darts of the i-cell to remove.
for ( CGAL::GMap_dart_iterator_basic_of_cell<GMap,i> it(amap,adart,mark);
it.cont(); ++it )
{
to_erase.push_back(it);
if ( !amap.template is_free<i+1>(it) && dg1==amap.null_handle )
{ dg1=it; dg2=amap.template alpha<i+1>(it); }
amap.mark(it, mark);
++res;
}
if (amap.are_attributes_automatically_managed())
{
// We group the two (i+1)-cells incident if they exist.
if ( dg1!=amap.null_handle )
CGAL::internal::GMap_group_attribute_functor_run<GMap, i+1>::
run(amap, dg1, dg2);
}
// During the operation, we store in modified_darts the darts modified
// to test after the loop the non void attributes that are split.
std::deque<typename GMap::Dart_handle> modified_darts;
// For each dart of the i-cell, we modify i-links of neighbors.
typename std::deque<typename GMap::Dart_handle>::iterator it =
to_erase.begin();
for ( ; it!=to_erase.end(); ++it )
{
d1=amap.template alpha<i>(*it);
if ( !amap.is_marked(d1, mark) )
{
d2=amap.template alpha<i+1,i>(*it);
while ( amap.is_marked(d2, mark) )
{
d2=amap.template alpha<i+1,i>(d2);
}
if ( !amap.is_marked(d1, mark_modified_darts) )
{
CGAL_assertion( !amap.is_marked(d2, mark_modified_darts) );
amap.template basic_link_alpha<i>(d1, d2);
amap.mark(d1, mark_modified_darts);
modified_darts.push_back(d1);
// TODO push only one out of two dart ?
if ( d2!=d1 )
{
modified_darts.push_back(d2);
amap.mark(d2, mark_modified_darts);
}
}
}
}
if (amap.are_attributes_automatically_managed() && update_attributes)
{
// We test the split of all the incident cells for all the non
// void attributes.
GMap::Helper::template Foreach_enabled_attributes_except
<CGAL::internal::GMap_test_split_attribute_functor<GMap,i>, i>::
run(amap, modified_darts, mark_modified_darts);
}
// We remove all the darts of the i-cell.
for ( it=to_erase.begin(); it!=to_erase.end(); ++it )
{ amap.erase_dart(*it); }
CGAL_assertion( amap.is_whole_map_unmarked(mark) );
amap.free_mark(mark);
// If no attribute is enabled (or if only i-attributes are enabled),
// the darts are not unmark by Foreach_enabled_attributes_except.
// Thus we unmark them now.
if ( !amap.is_whole_map_unmarked(mark_modified_darts) )
{
for ( it=modified_darts.begin();
it!=modified_darts.end(); ++it )
amap.unmark(*it, mark_modified_darts);
}
CGAL_assertion ( amap.is_whole_map_unmarked(mark_modified_darts) );
amap.free_mark(mark_modified_darts);
#ifdef CGAL_GMAP_TEST_VALID_REMOVALS
CGAL_assertion( amap.is_valid() );
#endif
return res;
}
};
/** Remove a d-cell, in a d-map (special case).
* @param amap the used generalized map.
* @param adart a dart of the volume to remove.
* @return the number of deleted darts.
*/
template<class GMap,unsigned int i>
struct Remove_cell_functor_gmap<GMap,i,0>
{
static size_t run(GMap& amap, typename GMap::Dart_handle adart,
bool update_attributes)
{
typename GMap::size_type mark = amap.get_new_mark();
std::deque<typename GMap::Dart_handle> to_erase;
size_t res = 0;
std::deque<typename GMap::Dart_handle> modified_darts;
// We mark all the darts of the d-cell.
for ( CGAL::GMap_dart_iterator_basic_of_cell<GMap,GMap::dimension>
it(amap,adart,mark); it.cont(); ++it )
{
to_erase.push_back(it);
amap.mark(it,mark);
++res;
}
// We unlink all the darts of the volume for alpha-d.
typename std::deque<typename GMap::Dart_handle>::iterator
it = to_erase.begin();
for ( it = to_erase.begin(); it != to_erase.end(); ++it )
{
if ( !amap.template is_free<GMap::dimension>(*it) &&
!amap.is_marked(amap.template alpha<GMap::dimension>(*it), mark) )
{
if (amap.are_attributes_automatically_managed())
{
modified_darts.push_back(amap.template alpha<GMap::dimension>(*it));
}
amap.template unlink_alpha<GMap::dimension>(*it);
}
}
if (amap.are_attributes_automatically_managed() && update_attributes)
{
// We test the split of all the incident cells for all the non
// void attributes.
GMap::Helper::template Foreach_enabled_attributes_except
<CGAL::internal::GMap_test_split_attribute_functor<GMap,i>,
GMap::dimension>::run(amap, modified_darts);
}
// We remove all the darts of the d-cell.
for ( it = to_erase.begin(); it != to_erase.end(); ++it )
{ amap.erase_dart(*it); }
CGAL_assertion( amap.is_whole_map_unmarked(mark) );
amap.free_mark(mark);
#ifdef CGAL_GMAP_TEST_VALID_REMOVALS
CGAL_assertion( amap.is_valid() );
#endif
return res;
}
};
/** Test if an i-cell can be contracted.
* An i-cell can be contracted if i==1
* or if there are at most two (i-1)-cell incident to it.
* @param adart a dart of the i-cell.
* @return true iff the i-cell can be contracted.
*/
template <class GMap, unsigned int i>
struct Is_contractible_functor_gmap
{
static bool run(const GMap& amap, typename GMap::Dart_const_handle adart)
{
// TODO ? Optimisation possible to not test all the darts of the cell ?
bool res = true;
for ( CGAL::GMap_dart_const_iterator_of_cell<GMap,i> it(amap, adart);
res && it.cont(); ++it )
{
if (amap.template alpha<i-2,i-1>(it)!=amap.template alpha<i-1,i-2>(it))
res = false;
}
return res;
}
};
// Specialization for i=0
template <class GMap>
struct Is_contractible_functor_gmap<GMap, 0>
{
static bool run(const GMap&, typename GMap::Dart_const_handle)
{ return false; }
};
// Specialization for i=1
template <class GMap>
struct Is_contractible_functor_gmap<GMap, 1>
{
static bool run(const GMap&, typename GMap::Dart_const_handle)
{ return true; }
};
/** Contract an i-cell, 1<=i<=dimension, and merge eventually both incident
* (i-1)-cells.
* @param amap the used generalized map.
* @param adart a dart of the i-cell to contract.
* @return the number of deleted darts.
*/
template<class GMap, unsigned int i>
struct Contract_cell_functor_gmap
{
static size_t run(GMap& amap, typename GMap::Dart_handle adart,
bool update_attributes)
{
CGAL_static_assertion ( 1<=i && i<=GMap::dimension );
CGAL_assertion( (amap.template is_contractible<i>(adart)) );
size_t res = 0;
typename GMap::Dart_handle d1, d2;
typename GMap::Dart_handle dg1=amap.null_handle, dg2=amap.null_handle;
typename GMap::size_type mark = amap.get_new_mark();
typename GMap::size_type mark_modified_darts = amap.get_new_mark();
// First we store and mark all the darts of the i-cell to contract.
std::deque<typename GMap::Dart_handle> to_erase;
for ( CGAL::GMap_dart_iterator_basic_of_cell<GMap,i> it(amap,adart,mark);
it.cont(); ++it )
{
to_erase.push_back(it);
if ( !amap.template is_free<i-1>(it) && dg1==amap.null_handle )
{ dg1=it; dg2=amap.template alpha<i-1>(it); }
amap.mark(it, mark);
++res;
}
if ( amap.are_attributes_automatically_managed() )
{
// We group the two (i-1)-cells incident if they exist.
if ( dg1!=amap.null_handle )
CGAL::internal::GMap_group_attribute_functor_run<GMap,i-1>::
run(amap, dg1, dg2);
}
// During the operation, we store in modified_darts the darts modified
// to test after the loop the non void attributes that are split.
std::deque<typename GMap::Dart_handle> modified_darts;
// For each dart of the i-cell, we modify i-links of neighbors.
typename std::deque<typename GMap::Dart_handle>::iterator it =
to_erase.begin();
for ( ; it!=to_erase.end(); ++it )
{
d1 = amap.template alpha<i>(*it);
if ( !amap.is_marked(d1, mark) )
{
d2 = amap.template alpha<i-1,i>(*it);
while ( amap.is_marked(d2, mark) )
{ d2 = amap.template alpha<i-1,i>(d2); }
if ( !amap.is_marked(d1, mark_modified_darts) )
{
CGAL_assertion( !amap.is_marked(d2, mark_modified_darts) );
amap.template basic_link_alpha<i>(d1, d2);
amap.mark(d1, mark_modified_darts);
modified_darts.push_back(d1);
// TODO push only one out of two dart ?
if ( d1!=d2 )
{
amap.mark(d2, mark_modified_darts);
modified_darts.push_back(d2);
}
}
}
}
if ( amap.are_attributes_automatically_managed() && update_attributes )
{
// We test the split of all the incident cells for all the non
// void attributes.
GMap::Helper::template Foreach_enabled_attributes_except
<CGAL::internal::GMap_test_split_attribute_functor<GMap,i>, i>::
run(amap, modified_darts, mark_modified_darts);
}
// We remove all the darts of the i-cell.
for ( it=to_erase.begin(); it!=to_erase.end(); ++it )
{ amap.erase_dart(*it); }
CGAL_assertion( amap.is_whole_map_unmarked(mark) );
amap.free_mark(mark);
// If no attribute is enabled (or if only i-attributes are enabled),
// the darts are not unmark by Foreach_enabled_attributes_except.
// Thus we unmark them now.
if ( !amap.is_whole_map_unmarked(mark_modified_darts) )
{
for ( it=modified_darts.begin(); it!=modified_darts.end(); ++it )
amap.unmark(*it, mark_modified_darts);
}
CGAL_assertion ( amap.is_whole_map_unmarked(mark_modified_darts) );
amap.free_mark(mark_modified_darts);
#ifdef CGAL_GMAP_TEST_VALID_CONTRACTIONS
CGAL_assertion( amap.is_valid() );
#endif
return res;
}
};
} // namespace CGAL
#endif // CGAL_GENERALIZED_MAP_OPERATIONS_H //
// EOF //
|