118 lines
2.9 KiB
C++
118 lines
2.9 KiB
C++
// Copyright (c) 2003-2006 INRIA 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_2/include/CGAL/Delaunay_mesh_criteria_2.h $
|
|
// $Id: Delaunay_mesh_criteria_2.h 0779373 2020-03-26T13:31:46+01:00 Sébastien Loriot
|
|
// SPDX-License-Identifier: GPL-3.0-or-later OR LicenseRef-Commercial
|
|
//
|
|
//
|
|
// Author(s) : Laurent RINEAU
|
|
|
|
#ifndef CGAL_DELAUNAY_MESH_CRITERIA_2_H
|
|
#define CGAL_DELAUNAY_MESH_CRITERIA_2_H
|
|
|
|
#include <CGAL/license/Mesh_2.h>
|
|
|
|
#include <CGAL/disable_warnings.h>
|
|
|
|
#include <CGAL/Mesh_2/Face_badness.h>
|
|
#include <CGAL/number_utils.h>
|
|
|
|
namespace CGAL {
|
|
|
|
template <class Tr>
|
|
class Delaunay_mesh_criteria_2
|
|
{
|
|
double B;
|
|
|
|
protected:
|
|
typedef typename Tr::Geom_traits Geom_traits;
|
|
Geom_traits traits;
|
|
|
|
public:
|
|
typedef typename Tr::Face_handle Face_handle;
|
|
|
|
Delaunay_mesh_criteria_2(const double bound = 0.125,
|
|
const Geom_traits& traits = Geom_traits())
|
|
: B(bound), traits(traits) {}
|
|
|
|
typedef double Quality;
|
|
|
|
inline
|
|
double bound() const { return B; }
|
|
|
|
inline
|
|
void set_bound(const double bound) { B = bound; }
|
|
|
|
class Is_bad
|
|
{
|
|
protected:
|
|
const double B;
|
|
const Geom_traits& traits;
|
|
public:
|
|
typedef typename Tr::Point Point_2;
|
|
|
|
Is_bad(const double bound, const Geom_traits& traits)
|
|
: B(bound), traits(traits) {}
|
|
|
|
Mesh_2::Face_badness operator()(const Quality q) const
|
|
{
|
|
if( q < B )
|
|
return Mesh_2::BAD;
|
|
else
|
|
return Mesh_2::NOT_BAD;
|
|
}
|
|
|
|
Mesh_2::Face_badness operator()(const Face_handle& fh,
|
|
Quality& q) const
|
|
{
|
|
// return the *squared* sinus of the smallest angle of the triangle
|
|
|
|
typedef typename Tr::Geom_traits Geom_traits;
|
|
typedef typename Geom_traits::Compute_area_2 Compute_area_2;
|
|
typedef typename Geom_traits::Compute_squared_distance_2
|
|
Compute_squared_distance_2;
|
|
|
|
Compute_area_2 area_2 =
|
|
traits.compute_area_2_object();
|
|
Compute_squared_distance_2 squared_distance =
|
|
traits.compute_squared_distance_2_object();
|
|
|
|
const Point_2& pa = fh->vertex(0)->point();
|
|
const Point_2& pb = fh->vertex(1)->point();
|
|
const Point_2& pc = fh->vertex(2)->point();
|
|
|
|
double area = 2*CGAL::to_double(area_2(pa, pb, pc));
|
|
area=area*area; // area = 4 * area^2(triangle)
|
|
|
|
double a = CGAL::to_double(squared_distance(pb, pc));
|
|
double b = CGAL::to_double(squared_distance(pc, pa));
|
|
double c = CGAL::to_double(squared_distance(pa, pb));
|
|
|
|
if(a<b)
|
|
if(a<c)
|
|
q = area/(b*c);
|
|
else
|
|
q = area/(a*b);
|
|
else
|
|
if(b<c)
|
|
q = area/(a*c);
|
|
else
|
|
q = area/(a*b);
|
|
|
|
return operator()(q);
|
|
}
|
|
};
|
|
|
|
Is_bad is_bad_object() const
|
|
{ return Is_bad(B, traits); }
|
|
};
|
|
|
|
} // end namespace CGAL
|
|
|
|
#include <CGAL/enable_warnings.h>
|
|
|
|
#endif
|