mirror of https://github.com/CGAL/cgal
119 lines
4.1 KiB
C++
119 lines
4.1 KiB
C++
// ============================================================================
|
|
//
|
|
// Copyright (c) 2000 The CGAL Consortium
|
|
//
|
|
// This software and related documentation is part of an INTERNAL release
|
|
// of the Computational Geometry Algorithms Library (CGAL). It is not
|
|
// intended for general use.
|
|
//
|
|
// ----------------------------------------------------------------------------
|
|
//
|
|
// release : $CGAL_Revision $
|
|
// release_date : $CGAL_Date $
|
|
//
|
|
// file : include/CGAL/partition_2.h
|
|
// package : $CGAL_Package: Partition_2 $
|
|
// maintainer : Susan Hert <hert@mpi-sb.mpg.de>
|
|
// chapter : Planar Polygon Partitioning
|
|
//
|
|
// revision : $Revision$
|
|
// revision_date : $Date$
|
|
//
|
|
// author(s) : Susan Hert <hert@mpi-sb.mpg.de>
|
|
//
|
|
// coordinator : MPI (Susan Hert <hert@mpi-sb.mpg.de>)
|
|
//
|
|
// implementation: Polygon partitioning functions
|
|
// ============================================================================
|
|
|
|
#ifndef CGAL_PARTITION_H
|
|
#define CGAL_PARTITION_H
|
|
|
|
#include <CGAL/partition_greene_approx_convex_2.h>
|
|
#include <CGAL/partition_optimal_convex_2.h>
|
|
#include <CGAL/partition_approx_convex_2.h>
|
|
#include <CGAL/partition_y_monotone_2.h>
|
|
|
|
|
|
namespace CGAL {
|
|
|
|
template <class InputIterator, class OutputIterator, class Traits>
|
|
inline
|
|
OutputIterator greene_approx_convex_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result,
|
|
const Traits& traits)
|
|
{
|
|
return partition_greene_approx_convex_2(first, beyond, result, traits);
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator>
|
|
inline
|
|
OutputIterator greene_approx_convex_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result)
|
|
{
|
|
return partition_greene_approx_convex_2(first, beyond, result);
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator, class Traits>
|
|
inline
|
|
OutputIterator optimal_convex_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result,
|
|
const Traits& traits)
|
|
{
|
|
return partition_optimal_convex_2(first, beyond, result, traits);
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator>
|
|
inline
|
|
OutputIterator optimal_convex_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result)
|
|
{
|
|
return partition_optimal_convex_2(first, beyond, result);
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator, class Traits>
|
|
inline
|
|
OutputIterator approx_convex_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result,
|
|
const Traits& traits)
|
|
{
|
|
return partition_approx_convex_2(first, beyond, result, traits);
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator>
|
|
inline
|
|
OutputIterator approx_convex_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result)
|
|
{
|
|
return partition_approx_convex_2(first, beyond, result);
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator, class Traits>
|
|
inline
|
|
OutputIterator y_monotone_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result,
|
|
const Traits& traits)
|
|
{
|
|
return partition_y_monotone_2(first, beyond, result, traits);
|
|
}
|
|
|
|
template <class InputIterator, class OutputIterator>
|
|
inline
|
|
OutputIterator y_monotone_partition_2(InputIterator first,
|
|
InputIterator beyond,
|
|
OutputIterator result)
|
|
{
|
|
return partition_y_monotone_2(first, beyond, result);
|
|
}
|
|
|
|
}
|
|
|
|
#endif // CGAL_PARTITION_H
|