278 lines
7.2 KiB
C++
278 lines
7.2 KiB
C++
// Copyright (c) 2006-2007 INRIA Sophia-Antipolis (France).
|
|
// Copyright (c) 2008 GeometryFactory, Sophia Antipolis (France)
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org).
|
|
//
|
|
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Mesh_3/include/CGAL/Mesh_cell_base_3.h $
|
|
// $Id: Mesh_cell_base_3.h 4dda7b6 2020-05-27T15:53:05+02:00 Sébastien Loriot
|
|
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
|
|
//
|
|
//
|
|
// Author(s) : Laurent Rineau, Stephane Tayeb
|
|
|
|
|
|
#ifndef CGAL_MESH_CELL_BASE_3_H
|
|
#define CGAL_MESH_CELL_BASE_3_H
|
|
|
|
#include <CGAL/license/Triangulation_3.h>
|
|
|
|
|
|
// #define CGAL_DEPRECATED_HEADER "<CGAL/Mesh_cell_base_3.h>"
|
|
// #define CGAL_REPLACEMENT_HEADER "<CGAL/Compact_mesh_cell_base_3.h>"
|
|
// #include <CGAL/internal/deprecation_warning.h>
|
|
|
|
#include <CGAL/Mesh_3/config.h>
|
|
|
|
#include <CGAL/Regular_triangulation_cell_base_3.h>
|
|
#include <CGAL/Regular_triangulation_cell_base_with_weighted_circumcenter_3.h>
|
|
#include <CGAL/Mesh_3/Mesh_surface_cell_base_3.h>
|
|
#include <CGAL/Mesh_3/io_signature.h>
|
|
#include <CGAL/tags.h>
|
|
|
|
#include <boost/type_traits/is_convertible.hpp>
|
|
|
|
#ifdef CGAL_LINKED_WITH_TBB
|
|
# include <atomic>
|
|
#endif
|
|
|
|
namespace CGAL {
|
|
|
|
// Sequential
|
|
template <typename Concurrency_tag>
|
|
class Mesh_cell_base_3_base
|
|
{
|
|
public:
|
|
#if defined(CGAL_MESH_3_USE_LAZY_SORTED_REFINEMENT_QUEUE) \
|
|
|| defined(CGAL_MESH_3_USE_LAZY_UNSORTED_REFINEMENT_QUEUE)
|
|
|
|
// Erase counter (cf. Compact_container)
|
|
unsigned int erase_counter() const
|
|
{
|
|
return this->m_erase_counter;
|
|
}
|
|
void set_erase_counter(unsigned int c)
|
|
{
|
|
this->m_erase_counter = c;
|
|
}
|
|
void increment_erase_counter()
|
|
{
|
|
++this->m_erase_counter;
|
|
}
|
|
|
|
private:
|
|
typedef unsigned int Erase_counter_type;
|
|
Erase_counter_type m_erase_counter;
|
|
#endif
|
|
};
|
|
|
|
#ifdef CGAL_LINKED_WITH_TBB
|
|
// Specialized version (parallel)
|
|
template <>
|
|
class Mesh_cell_base_3_base<Parallel_tag>
|
|
{
|
|
public:
|
|
// Erase counter (cf. Compact_container)
|
|
unsigned int erase_counter() const
|
|
{
|
|
return this->m_erase_counter;
|
|
}
|
|
void set_erase_counter(unsigned int c)
|
|
{
|
|
this->m_erase_counter = c;
|
|
}
|
|
void increment_erase_counter()
|
|
{
|
|
++this->m_erase_counter;
|
|
}
|
|
|
|
protected:
|
|
typedef std::atomic<unsigned int> Erase_counter_type;
|
|
Erase_counter_type m_erase_counter;
|
|
};
|
|
#endif // CGAL_LINKED_WITH_TBB
|
|
|
|
// Class Mesh_cell_base_3
|
|
// Cell base class used in 3D meshing process.
|
|
// Adds information to Cb about the cell of the input complex containing it
|
|
template< class GT,
|
|
class MD,
|
|
class Cb= CGAL::Regular_triangulation_cell_base_with_weighted_circumcenter_3<
|
|
GT, CGAL::Regular_triangulation_cell_base_3<GT> > >
|
|
class Mesh_cell_base_3
|
|
: public Mesh_3::Mesh_surface_cell_base_3<GT, MD, Cb>,
|
|
public Mesh_cell_base_3_base<
|
|
typename Mesh_3::Mesh_surface_cell_base_3<GT, MD, Cb>::Tds::Concurrency_tag>
|
|
{
|
|
typedef typename GT::FT FT;
|
|
|
|
public:
|
|
// Base
|
|
typedef Mesh_3::Mesh_surface_cell_base_3<GT, MD, Cb> Base;
|
|
// Index Type
|
|
typedef typename MD::Subdomain_index Subdomain_index;
|
|
typedef typename MD::Surface_patch_index Surface_patch_index;
|
|
|
|
// Backward compatibility
|
|
#ifndef CGAL_MESH_3_NO_DEPRECATED_SURFACE_INDEX
|
|
typedef Surface_patch_index Surface_index;
|
|
#endif // CGAL_MESH_3_NO_DEPRECATED_SURFACE_INDEX
|
|
|
|
// Triangulation
|
|
typedef typename Base::Tds Tds;
|
|
typedef typename Tds::Vertex_handle Vertex_handle;
|
|
typedef typename Tds::Cell_handle Cell_handle;
|
|
|
|
// To get correct cell type in TDS
|
|
template < class TDS3 >
|
|
struct Rebind_TDS
|
|
{
|
|
typedef typename Cb::template Rebind_TDS<TDS3>::Other Cb3;
|
|
typedef Mesh_cell_base_3 <GT, MD, Cb3> Other;
|
|
};
|
|
|
|
// Constructors
|
|
Mesh_cell_base_3()
|
|
: Base()
|
|
, subdomain_index_()
|
|
, sliver_value_(FT(0.))
|
|
, sliver_cache_validity_(false)
|
|
#ifdef CGAL_INTRUSIVE_LIST
|
|
, next_intrusive_()
|
|
, previous_intrusive_()
|
|
#endif
|
|
{}
|
|
|
|
Mesh_cell_base_3 (Vertex_handle v0,
|
|
Vertex_handle v1,
|
|
Vertex_handle v2,
|
|
Vertex_handle v3)
|
|
: Base (v0, v1, v2, v3)
|
|
, subdomain_index_()
|
|
, sliver_value_(FT(0.))
|
|
, sliver_cache_validity_(false)
|
|
#ifdef CGAL_INTRUSIVE_LIST
|
|
, next_intrusive_()
|
|
, previous_intrusive_()
|
|
#endif
|
|
{}
|
|
|
|
Mesh_cell_base_3 (Vertex_handle v0,
|
|
Vertex_handle v1,
|
|
Vertex_handle v2,
|
|
Vertex_handle v3,
|
|
Cell_handle n0,
|
|
Cell_handle n1,
|
|
Cell_handle n2,
|
|
Cell_handle n3)
|
|
: Base (v0, v1, v2, v3, n0, n1, n2, n3)
|
|
, subdomain_index_()
|
|
, sliver_value_(FT(0.))
|
|
, sliver_cache_validity_(false)
|
|
#ifdef CGAL_INTRUSIVE_LIST
|
|
, next_intrusive_()
|
|
, previous_intrusive_()
|
|
#endif
|
|
{}
|
|
|
|
// Default copy constructor and assignment operator are ok
|
|
|
|
// Returns the index of the cell of the input complex that contains the cell
|
|
Subdomain_index subdomain_index() const { return subdomain_index_; }
|
|
|
|
// Sets the index of the cell of the input complex that contains the cell
|
|
void set_subdomain_index(const Subdomain_index& index)
|
|
{ subdomain_index_ = index; }
|
|
|
|
void set_sliver_value(const FT& value)
|
|
{
|
|
sliver_cache_validity_ = true;
|
|
sliver_value_ = value;
|
|
}
|
|
const FT& sliver_value() const { return sliver_value_; }
|
|
bool is_cache_valid() const { return sliver_cache_validity_; }
|
|
void reset_cache_validity() const { sliver_cache_validity_ = false; }
|
|
|
|
static
|
|
std::string io_signature()
|
|
{
|
|
return
|
|
Get_io_signature<Subdomain_index>()() + "+"
|
|
+ Get_io_signature<Base>()();
|
|
}
|
|
|
|
#ifdef CGAL_INTRUSIVE_LIST
|
|
public:
|
|
Cell_handle next_intrusive() const { return next_intrusive_; }
|
|
void set_next_intrusive(Cell_handle c)
|
|
{
|
|
next_intrusive_ = c;
|
|
}
|
|
|
|
Cell_handle previous_intrusive() const { return previous_intrusive_; }
|
|
void set_previous_intrusive(Cell_handle c)
|
|
{
|
|
previous_intrusive_ = c;
|
|
}
|
|
#endif // CGAL_INTRUSIVE_LIST
|
|
|
|
/// For the determinism of Compact_container iterators
|
|
///@{
|
|
typedef Tag_true Has_timestamp;
|
|
|
|
std::size_t time_stamp() const {
|
|
return time_stamp_;
|
|
}
|
|
void set_time_stamp(const std::size_t& ts) {
|
|
time_stamp_ = ts;
|
|
}
|
|
///@}
|
|
|
|
private:
|
|
// The index of the cell of the input complex that contains me
|
|
Subdomain_index subdomain_index_;
|
|
|
|
FT sliver_value_;
|
|
mutable bool sliver_cache_validity_;
|
|
|
|
#ifdef CGAL_INTRUSIVE_LIST
|
|
Cell_handle next_intrusive_, previous_intrusive_;
|
|
#endif
|
|
std::size_t time_stamp_;
|
|
|
|
}; // end class Mesh_cell_base_3
|
|
|
|
template < class GT, class MT, class Cb >
|
|
std::istream&
|
|
operator>>(std::istream &is,
|
|
Mesh_cell_base_3<GT, MT, Cb> &c)
|
|
{
|
|
typename Mesh_cell_base_3<GT, MT, Cb>::Subdomain_index index;
|
|
if(is_ascii(is))
|
|
is >> index;
|
|
else
|
|
read(is, index);
|
|
typedef typename Mesh_cell_base_3<GT, MT, Cb>::Base Cell_base;
|
|
is >> static_cast<Cell_base&>(c);
|
|
if(is) c.set_subdomain_index(index);
|
|
return is;
|
|
}
|
|
|
|
template < class GT, class MT, class Cb >
|
|
std::ostream&
|
|
operator<<(std::ostream &os,
|
|
const Mesh_cell_base_3<GT, MT, Cb> &c)
|
|
{
|
|
if(is_ascii(os))
|
|
os << c.subdomain_index();
|
|
else
|
|
write(os, c.subdomain_index());
|
|
typedef typename Mesh_cell_base_3<GT, MT, Cb>::Base Cell_base;
|
|
return os << static_cast<const Cell_base&>(c);
|
|
}
|
|
|
|
} // end namespace CGAL
|
|
|
|
|
|
#endif // CGAL_MESH_CELL_BASE_3_H
|