mirror of https://github.com/CGAL/cgal
125 lines
3.9 KiB
C
125 lines
3.9 KiB
C
// Copyright (c) 1999 Max-Planck-Institute Saarbruecken (Germany).
|
|
// All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org); you may redistribute it under
|
|
// the terms of the Q Public License version 1.0.
|
|
// See the file LICENSE.QPL distributed with CGAL.
|
|
//
|
|
// 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$
|
|
//
|
|
//
|
|
// Author(s) : Stefan Schirra
|
|
|
|
|
|
#ifndef CGAL_CH_JARVIS_C
|
|
#define CGAL_CH_JARVIS_C
|
|
|
|
#ifndef CGAL_CH_JARVIS_H
|
|
#include <CGAL/ch_jarvis.h>
|
|
#endif // CGAL_CH_JARVIS_H
|
|
|
|
#ifndef CGAL_CH_NO_POSTCONDITIONS
|
|
#include <CGAL/convexity_check_2.h>
|
|
#endif // CGAL_CH_NO_POSTCONDITIONS
|
|
|
|
#include <CGAL/ch_assertions.h>
|
|
#include <CGAL/ch_selected_extreme_points_2.h>
|
|
#include <CGAL/functional.h>
|
|
#include <CGAL/ch_selected_extreme_points_2.h>
|
|
#include <algorithm>
|
|
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
template <class ForwardIterator, class OutputIterator,
|
|
class Point, class Traits>
|
|
OutputIterator
|
|
ch_jarvis_march(ForwardIterator first, ForwardIterator last,
|
|
const Point& start_p,
|
|
const Point& stop_p,
|
|
OutputIterator result,
|
|
const Traits& ch_traits)
|
|
{
|
|
if (first == last) return result;
|
|
typedef typename Traits::Less_rotate_ccw_2 Less_rotate_ccw;
|
|
typedef typename Traits::Point_2 Point_2;
|
|
typedef typename Traits::Equal_2 Equal_2;
|
|
|
|
Equal_2 equal_points = ch_traits.equal_2_object();
|
|
|
|
#if defined(CGAL_CH_NO_POSTCONDITIONS) || defined(CGAL_NO_POSTCONDITIONS) \
|
|
|| defined(NDEBUG)
|
|
OutputIterator res(result);
|
|
#else
|
|
Tee_for_output_iterator<OutputIterator,Point_2> res(result);
|
|
#endif // no postconditions ...
|
|
CGAL_ch_assertion_code( \
|
|
int count_points = 0; )
|
|
CGAL_ch_assertion_code( \
|
|
for (ForwardIterator fit = first; fit!= last; ++fit) ++count_points; )
|
|
Less_rotate_ccw
|
|
rotation_predicate = ch_traits.less_rotate_ccw_2_object( );
|
|
*res = start_p; ++res;
|
|
CGAL_ch_assertion_code( \
|
|
int constructed_points = 1; )
|
|
CGAL_ch_exactness_assertion_code( \
|
|
Point previous_point = start_p; )
|
|
|
|
ForwardIterator it = std::min_element( first, last,
|
|
bind_1(rotation_predicate, start_p) );
|
|
while (! equal_points(*it, stop_p) )
|
|
{
|
|
CGAL_ch_exactness_assertion( \
|
|
*it != previous_point );
|
|
CGAL_ch_exactness_assertion_code( \
|
|
previous_point = *it; )
|
|
|
|
*res = *it; ++res;
|
|
CGAL_ch_assertion_code( \
|
|
++constructed_points;)
|
|
CGAL_ch_assertion( \
|
|
constructed_points <= count_points + 1 );
|
|
|
|
it = std::min_element( first, last,
|
|
bind_1(rotation_predicate, *it) );
|
|
}
|
|
CGAL_ch_postcondition( \
|
|
is_ccw_strongly_convex_2( res.output_so_far_begin(), \
|
|
res.output_so_far_end(), \
|
|
ch_traits));
|
|
CGAL_ch_expensive_postcondition( \
|
|
ch_brute_force_check_2(
|
|
first, last, \
|
|
res.output_so_far_begin(), res.output_so_far_end(), \
|
|
ch_traits));
|
|
#if defined(CGAL_CH_NO_POSTCONDITIONS) || defined(CGAL_NO_POSTCONDITIONS) \
|
|
|| defined(NDEBUG)
|
|
return res;
|
|
#else
|
|
return res.to_output_iterator();
|
|
#endif // no postconditions ...
|
|
}
|
|
|
|
template <class ForwardIterator, class OutputIterator, class Traits>
|
|
OutputIterator
|
|
ch_jarvis(ForwardIterator first, ForwardIterator last,
|
|
OutputIterator result,
|
|
const Traits& ch_traits)
|
|
{
|
|
if (first == last) return result;
|
|
ForwardIterator start;
|
|
ch_w_point(first, last, start, ch_traits);
|
|
return ch_jarvis_march( first, last, *start, *start, result, ch_traits);
|
|
}
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#endif // CGAL_CH_JARVIS_C
|
|
|