mirror of https://github.com/CGAL/cgal
269 lines
7.5 KiB
C++
269 lines
7.5 KiB
C++
// Copyright (c) 2009 INRIA Sophia-Antipolis (France).
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org).
|
|
//
|
|
// $URL$
|
|
// $Id$
|
|
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
|
|
//
|
|
//
|
|
// Author(s) : Stéphane Tayeb
|
|
//
|
|
//******************************************************************************
|
|
// File Description :
|
|
// Mesh_facet_criteria_3 class.
|
|
//******************************************************************************
|
|
|
|
#ifndef CGAL_MESH_FACET_CRITERIA_3_H
|
|
#define CGAL_MESH_FACET_CRITERIA_3_H
|
|
|
|
#include <CGAL/license/Mesh_3.h>
|
|
|
|
|
|
#include <CGAL/Mesh_3/mesh_standard_facet_criteria.h>
|
|
#include <CGAL/Mesh_facet_topology.h>
|
|
#include <CGAL/Mesh_3/Is_mesh_domain_field_3.h>
|
|
|
|
#include <optional>
|
|
|
|
namespace CGAL {
|
|
|
|
/*!
|
|
\ingroup PkgMesh3MeshClasses
|
|
|
|
The class `Mesh_facet_criteria_3` is a model of `MeshFacetCriteria_3`.
|
|
It provides a uniform bound for the shape criterion,
|
|
a uniform or variable sizing field
|
|
for the size criterion and/or
|
|
a uniform or variable distance field
|
|
for the approximation error criterion.
|
|
|
|
\tparam Tr must be identical to the nested type
|
|
`Triangulation` of the instance used as model of
|
|
`MeshComplex_3InTriangulation_3`.
|
|
|
|
\cgalModels{MeshFacetCriteria_3}
|
|
|
|
\sa `MeshCriteria_3`
|
|
\sa `MeshFacetCriteria_3`
|
|
\sa `MeshDomainField_3`
|
|
\sa `CGAL::Mesh_facet_topology`
|
|
\sa `CGAL::Mesh_criteria_3<Tr>`
|
|
\sa `CGAL::make_mesh_3()`
|
|
|
|
*/
|
|
template<typename Tr
|
|
#ifndef DOXYGEN_RUNNING
|
|
,typename Visitor_ = Mesh_3::Facet_criterion_visitor_with_radius_lower_bound<Tr>
|
|
#endif
|
|
>
|
|
class Mesh_facet_criteria_3
|
|
{
|
|
public:
|
|
|
|
/// \name Types
|
|
/// @{
|
|
|
|
/*!
|
|
Numerical type
|
|
*/
|
|
typedef typename Tr::Geom_traits::FT FT;
|
|
|
|
/// @}
|
|
|
|
typedef Visitor_ Visitor;
|
|
typedef typename Visitor::Facet_quality Facet_quality;
|
|
typedef typename Visitor::Is_facet_bad Is_facet_bad;
|
|
|
|
typedef Mesh_3::Abstract_criterion<Tr,Visitor> Abstract_criterion;
|
|
private:
|
|
typedef Mesh_3::Criteria<Tr,Visitor> Criteria;
|
|
|
|
typedef typename Tr::Facet Facet;
|
|
|
|
|
|
typedef Mesh_facet_criteria_3<Tr> Self;
|
|
|
|
public:
|
|
typedef CGAL::Tag_true Has_manifold_criterion;
|
|
|
|
/// \name Creation
|
|
/// @{
|
|
|
|
#ifdef DOXYGEN_RUNNING
|
|
/*!
|
|
returns an object to serve as criteria for facets.
|
|
|
|
\param angle_bound is the lower bound for the angles in degrees of the
|
|
surface mesh facets.
|
|
\param radius_bound is a uniform upper bound
|
|
for the radius of the surface Delaunay balls.
|
|
\param distance_bound is an upper bound for the center-center distances
|
|
of the surface mesh facets.
|
|
\param topology is the set of topological constraints
|
|
which have to be verified by each surface facet. See
|
|
section \ref Mesh_3DelaunayRefinement for further details.
|
|
\param min_radius_bound is a uniform lower bound for the radius of
|
|
the surface Delaunay balls. Only facets with a radius larger than that
|
|
bound will be refined.
|
|
|
|
@note If one parameter is set to 0, then its corresponding
|
|
criterion is ignored.
|
|
*/
|
|
Mesh_facet_criteria_3(const FT& angle_bound,
|
|
const FT& radius_bound,
|
|
const FT& distance_bound,
|
|
const Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
|
|
const FT& min_radius_bound = 0.);
|
|
|
|
#endif
|
|
|
|
|
|
/*!
|
|
Returns an object to serve as criteria for facets. The types `SizingField` and
|
|
`DistanceField` must
|
|
be models of the concept `MeshDomainField_3`. The behavior and semantic of the arguments are the same
|
|
as above, except that the radius and distance bound parameters are
|
|
functionals instead of constants.
|
|
*/
|
|
template < typename SizingField, typename DistanceField >
|
|
Mesh_facet_criteria_3(const FT& angle_bound,
|
|
const SizingField & radius_bound,
|
|
const DistanceField& distance_bound,
|
|
const Mesh_facet_topology topology = FACET_VERTICES_ON_SURFACE,
|
|
const FT& min_radius_bound = 0.)
|
|
: squared_min_radius_bound_(std::nullopt)
|
|
{
|
|
if (FT(0) != min_radius_bound)
|
|
{
|
|
init_min_radius(min_radius_bound);
|
|
squared_min_radius_bound_ = CGAL::square(min_radius_bound);
|
|
}
|
|
|
|
if ( FT(0) != angle_bound )
|
|
init_aspect(angle_bound);
|
|
|
|
init_radius(radius_bound,
|
|
Mesh_3::Is_mesh_domain_field_3<Tr, SizingField>());
|
|
|
|
init_distance(distance_bound,
|
|
Mesh_3::Is_mesh_domain_field_3<Tr, DistanceField>());
|
|
|
|
init_topo(topology);
|
|
}
|
|
|
|
/// @}
|
|
|
|
|
|
// Destructor
|
|
~Mesh_facet_criteria_3() { }
|
|
|
|
/**
|
|
* @brief returns whether the facet `facet` is bad or not.
|
|
*
|
|
* @param tr the triangulation within which `facet` lives
|
|
* @param facet the facet
|
|
*/
|
|
Is_facet_bad operator()(const Tr& tr, const Facet& facet) const
|
|
{
|
|
return criteria_(tr, facet);
|
|
}
|
|
|
|
void add(Abstract_criterion* criterion)
|
|
{
|
|
criteria_.add(criterion);
|
|
}
|
|
|
|
Mesh_facet_topology topology() const {
|
|
return topology_;
|
|
}
|
|
|
|
/**
|
|
* @returns the squared value of minimal radius bound if it was set,
|
|
* and `std::nullopt` otherwise
|
|
*/
|
|
std::optional<FT> squared_min_radius_bound() const {
|
|
if(squared_min_radius_bound_)
|
|
return *squared_min_radius_bound_;
|
|
else
|
|
return std::nullopt;
|
|
}
|
|
|
|
private:
|
|
void init_aspect(const FT& angle_bound)
|
|
{
|
|
typedef Mesh_3::Aspect_ratio_criterion<Tr,Visitor> Aspect_criterion;
|
|
criteria_.add(new Aspect_criterion(angle_bound));
|
|
}
|
|
|
|
void init_radius(const FT& radius_bound, Tag_false)
|
|
{
|
|
if(FT(0) == radius_bound) return;
|
|
typedef Mesh_3::Uniform_size_criterion<Tr,Visitor> Uniform_size_criterion;
|
|
criteria_.add(new Uniform_size_criterion(radius_bound));
|
|
}
|
|
|
|
template <typename Sizing_field>
|
|
void init_radius(const Sizing_field& radius_bound, Tag_true)
|
|
{
|
|
typedef Mesh_3::Variable_size_criterion<Tr,Visitor,Sizing_field> Variable_size_criterion;
|
|
criteria_.add(new Variable_size_criterion(radius_bound));
|
|
}
|
|
|
|
void init_min_radius(const FT& min_radius_bound)
|
|
{
|
|
typedef Mesh_3::Uniform_size_criterion<Tr, Visitor> Uniform_size_criterion;
|
|
criteria_.add(new Uniform_size_criterion(min_radius_bound, true/*lower bound*/));
|
|
}
|
|
|
|
void init_distance(const FT& distance_bound, Tag_false)
|
|
{
|
|
if(FT(0) == distance_bound) return;
|
|
typedef Mesh_3::Uniform_curvature_size_criterion<Tr,Visitor> Criterion;
|
|
criteria_.add(new Criterion(distance_bound));
|
|
}
|
|
|
|
template <typename Sizing_field>
|
|
void init_distance(const Sizing_field& distance_bound, Tag_true)
|
|
{
|
|
typedef Mesh_3::Variable_curvature_size_criterion<Tr,
|
|
Visitor,
|
|
Sizing_field> Criterion;
|
|
criteria_.add(new Criterion(distance_bound));
|
|
}
|
|
|
|
void init_topo(const Mesh_facet_topology topology)
|
|
{
|
|
topology_ = topology;
|
|
switch ( topology % MANIFOLD )
|
|
{
|
|
case FACET_VERTICES_ON_SURFACE:
|
|
{
|
|
typedef Mesh_3::Facet_on_surface_criterion<Tr,Visitor> On_surface_criterion;
|
|
criteria_.add(new On_surface_criterion());
|
|
break;
|
|
}
|
|
|
|
case FACET_VERTICES_ON_SAME_SURFACE_PATCH:
|
|
case FACET_VERTICES_ON_SAME_SURFACE_PATCH_WITH_ADJACENCY_CHECK:
|
|
// @TODO: Implement adjacency check !
|
|
{
|
|
typedef Mesh_3::Facet_on_same_surface_criterion<Tr,Visitor> Same_surface_criterion;
|
|
criteria_.add(new Same_surface_criterion());
|
|
break;
|
|
}
|
|
}
|
|
}
|
|
|
|
private:
|
|
Criteria criteria_;
|
|
Mesh_facet_topology topology_;
|
|
std::optional<FT> squared_min_radius_bound_;
|
|
}; // end class Mesh_facet_criteria_3
|
|
|
|
} // end namespace CGAL
|
|
|
|
|
|
#endif // CGAL_MESH_FACET_CRITERIA_3_H
|