130 lines
3.5 KiB
C++
Executable File
130 lines
3.5 KiB
C++
Executable File
// Copyright (c) 2004-2009 INRIA Sophia-Antipolis (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
|
|
// 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) : Laurent RINEAU, Stephane Tayeb
|
|
|
|
|
|
#ifndef CGAL_MESH_CELL_CRITERIA_3_H
|
|
#define CGAL_MESH_CELL_CRITERIA_3_H
|
|
|
|
#include <CGAL/license/Mesh_3.h>
|
|
|
|
|
|
#include <CGAL/Mesh_3/mesh_standard_cell_criteria.h>
|
|
|
|
namespace CGAL {
|
|
|
|
template <typename Tr,
|
|
typename Visitor_ = Mesh_3::Cell_criteria_visitor_with_features<Tr> >
|
|
class Mesh_cell_criteria_3
|
|
{
|
|
public:
|
|
typedef Visitor_ Visitor;
|
|
typedef typename Visitor::Cell_quality Cell_quality;
|
|
typedef typename Visitor::Is_cell_bad Is_cell_bad;
|
|
|
|
typedef Mesh_3::Abstract_criterion<Tr,Visitor> Abstract_criterion;
|
|
private:
|
|
typedef Mesh_3::Criteria<Tr,Visitor> Criteria;
|
|
|
|
typedef typename Tr::Cell_handle Cell_handle;
|
|
typedef typename Tr::Geom_traits::FT FT;
|
|
|
|
typedef Mesh_cell_criteria_3<Tr> Self;
|
|
|
|
public:
|
|
|
|
/**
|
|
* @brief Constructor
|
|
* @param radius_edge_bound the radius-edge bound
|
|
* @param radius_bound the radius bound (tet sizing)
|
|
*/
|
|
Mesh_cell_criteria_3(const FT& radius_edge_bound,
|
|
const FT& radius_bound)
|
|
{
|
|
if ( FT(0) != radius_bound )
|
|
init_radius(radius_bound);
|
|
|
|
if ( FT(0) != radius_edge_bound )
|
|
init_radius_edge(radius_edge_bound);
|
|
}
|
|
|
|
// Nb: SFINAE (dummy) to avoid wrong matches with built-in numerical types
|
|
// as int.
|
|
template <typename Sizing_field>
|
|
Mesh_cell_criteria_3(const FT& radius_edge_bound,
|
|
const Sizing_field& radius_bound,
|
|
typename Sizing_field::FT /*dummy*/ = 0)
|
|
{
|
|
init_radius(radius_bound);
|
|
|
|
if ( FT(0) != radius_edge_bound )
|
|
init_radius_edge(radius_edge_bound);
|
|
}
|
|
|
|
/// Destructor
|
|
~Mesh_cell_criteria_3() { }
|
|
|
|
/**
|
|
* @brief returns whether the cell \c cell is bad or not.
|
|
* @param tr the triangulation within which \c cell lives
|
|
* @param cell the cell
|
|
*/
|
|
Is_cell_bad operator()(const Tr& tr, const Cell_handle& cell) const
|
|
{
|
|
return criteria_(tr, cell);
|
|
}
|
|
|
|
void add(Abstract_criterion* criterion)
|
|
{
|
|
criteria_.add(criterion);
|
|
}
|
|
|
|
private:
|
|
void init_radius_edge(const FT& radius_edge_bound)
|
|
{
|
|
typedef Mesh_3::Cell_radius_edge_criterion<Tr,Visitor> Radius_edge_criterion;
|
|
criteria_.add(new Radius_edge_criterion(radius_edge_bound));
|
|
}
|
|
|
|
void init_radius(const FT& radius_bound)
|
|
{
|
|
typedef Mesh_3::Cell_uniform_size_criterion<Tr,Visitor> Radius_criterion;
|
|
criteria_.add(new Radius_criterion(radius_bound));
|
|
}
|
|
|
|
template < typename Sizing_field>
|
|
void init_radius(const Sizing_field& radius_bound)
|
|
{
|
|
typedef Mesh_3::Cell_variable_size_criterion<Tr,Visitor,Sizing_field>
|
|
Radius_criterion;
|
|
|
|
criteria_.add(new Radius_criterion(radius_bound));
|
|
}
|
|
|
|
private:
|
|
Criteria criteria_;
|
|
|
|
}; // end class Mesh_cell_criteria_3
|
|
|
|
} // end namespace CGAL
|
|
|
|
|
|
#endif // CGAL_MESH_CELL_CRITERIA_3_H
|