dust3d/thirdparty/cgal/CGAL-5.1/include/CGAL/partition_2.h

105 lines
3.6 KiB
C
Raw Normal View History

// Copyright (c) 2000 Max-Planck-Institute Saarbruecken (Germany).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org).
//
2020-10-13 12:44:25 +00:00
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Partition_2/include/CGAL/partition_2.h $
// $Id: partition_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) : Susan Hert <hert@mpi-sb.mpg.de>
#ifndef CGAL_PARTITION_H
#define CGAL_PARTITION_H
#include <CGAL/license/Partition_2.h>
#include <CGAL/Partition_2/partition_greene_approx_convex_2.h>
#include <CGAL/Partition_2/partition_optimal_convex_2.h>
#include <CGAL/Partition_2/partition_approx_convex_2.h>
#include <CGAL/Partition_2/partition_y_monotone_2.h>
namespace CGAL {
template <class InputIterator, class OutputIterator, class Traits>
inline
2020-10-13 12:44:25 +00:00
OutputIterator greene_approx_convex_partition_2(InputIterator first,
InputIterator beyond,
2020-10-13 12:44:25 +00:00
OutputIterator result,
const Traits& traits)
{
return partition_greene_approx_convex_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
2020-10-13 12:44:25 +00:00
OutputIterator greene_approx_convex_partition_2(InputIterator first,
InputIterator beyond,
2020-10-13 12:44:25 +00:00
OutputIterator result)
{
return partition_greene_approx_convex_2(first, beyond, result);
}
template <class InputIterator, class OutputIterator, class Traits>
inline
2020-10-13 12:44:25 +00:00
OutputIterator optimal_convex_partition_2(InputIterator first,
InputIterator beyond,
2020-10-13 12:44:25 +00:00
OutputIterator result,
const Traits& traits)
{
return partition_optimal_convex_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
2020-10-13 12:44:25 +00:00
OutputIterator optimal_convex_partition_2(InputIterator first,
InputIterator beyond,
2020-10-13 12:44:25 +00:00
OutputIterator result)
{
return partition_optimal_convex_2(first, beyond, result);
}
template <class InputIterator, class OutputIterator, class Traits>
inline
2020-10-13 12:44:25 +00:00
OutputIterator approx_convex_partition_2(InputIterator first,
InputIterator beyond,
2020-10-13 12:44:25 +00:00
OutputIterator result,
const Traits& traits)
{
return partition_approx_convex_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
2020-10-13 12:44:25 +00:00
OutputIterator approx_convex_partition_2(InputIterator first,
InputIterator beyond,
2020-10-13 12:44:25 +00:00
OutputIterator result)
{
return partition_approx_convex_2(first, beyond, result);
}
template <class InputIterator, class OutputIterator, class Traits>
inline
2020-10-13 12:44:25 +00:00
OutputIterator y_monotone_partition_2(InputIterator first,
InputIterator beyond,
2020-10-13 12:44:25 +00:00
OutputIterator result,
const Traits& traits)
{
return partition_y_monotone_2(first, beyond, result, traits);
}
template <class InputIterator, class OutputIterator>
inline
2020-10-13 12:44:25 +00:00
OutputIterator y_monotone_partition_2(InputIterator first,
InputIterator beyond,
OutputIterator result)
{
return partition_y_monotone_2(first, beyond, result);
}
}
#endif // CGAL_PARTITION_H