245 lines
9.1 KiB
C++
245 lines
9.1 KiB
C++
// Copyright (c) 2006 Fernando Luis Cacciola Carballal. All rights reserved.
|
|
//
|
|
// This file is part of CGAL (www.cgal.org).
|
|
//
|
|
|
|
// $URL: https://github.com/CGAL/cgal/blob/v5.1/Straight_skeleton_2/include/CGAL/create_straight_skeleton_2.h $
|
|
// $Id: create_straight_skeleton_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) : Fernando Cacciola <fernando_cacciola@ciudad.com.ar>
|
|
//
|
|
#ifndef CGAL_CREATE_STRAIGHT_SKELETON_2_H
|
|
#define CGAL_CREATE_STRAIGHT_SKELETON_2_H
|
|
|
|
#include <CGAL/license/Straight_skeleton_2.h>
|
|
|
|
#include <CGAL/disable_warnings.h>
|
|
|
|
#include <CGAL/Straight_skeleton_builder_2.h>
|
|
#include <CGAL/compute_outer_frame_margin.h>
|
|
#include <CGAL/Polygon_2.h>
|
|
|
|
namespace CGAL {
|
|
|
|
namespace CGAL_SS_i
|
|
{
|
|
|
|
template<class Poly>
|
|
inline typename Poly::const_iterator vertices_begin ( Poly const& aPoly ) { return aPoly.begin() ; }
|
|
|
|
template<class Poly>
|
|
inline typename Poly::const_iterator vertices_end ( Poly const& aPoly ) { return aPoly.end() ; }
|
|
|
|
|
|
template<class K, class C>
|
|
inline typename Polygon_2<K,C>::Vertex_const_iterator vertices_begin ( Polygon_2<K,C> const& aPoly )
|
|
{ return aPoly.vertices_begin() ; }
|
|
|
|
template<class K, class C>
|
|
inline typename Polygon_2<K,C>::Vertex_const_iterator vertices_end( Polygon_2<K,C> const& aPoly )
|
|
{ return aPoly.vertices_end() ; }
|
|
|
|
template<class Poly>
|
|
inline typename Poly::const_iterator vertices_begin ( boost::shared_ptr<Poly> const& aPoly ) { return aPoly->begin() ; }
|
|
|
|
template<class Poly>
|
|
inline typename Poly::const_iterator vertices_end ( boost::shared_ptr<Poly> const& aPoly ) { return aPoly->end() ; }
|
|
|
|
}
|
|
|
|
template<class PointIterator, class HoleIterator, class K>
|
|
boost::shared_ptr< Straight_skeleton_2<K> >
|
|
create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
|
|
, PointIterator aOuterContour_VerticesEnd
|
|
, HoleIterator aHolesBegin
|
|
, HoleIterator aHolesEnd
|
|
, K const&
|
|
)
|
|
{
|
|
typedef Straight_skeleton_2<K> Ss ;
|
|
|
|
typedef Straight_skeleton_builder_traits_2<K> SsBuilderTraits;
|
|
|
|
typedef Straight_skeleton_builder_2<SsBuilderTraits,Ss> SsBuilder;
|
|
|
|
typedef typename std::iterator_traits<PointIterator>::value_type InputPoint ;
|
|
typedef typename Kernel_traits<InputPoint>::Kernel InputKernel ;
|
|
|
|
Cartesian_converter<InputKernel, K> Point_converter ;
|
|
|
|
SsBuilder ssb ;
|
|
|
|
ssb.enter_contour( aOuterContour_VerticesBegin, aOuterContour_VerticesEnd, Point_converter ) ;
|
|
|
|
for ( HoleIterator hi = aHolesBegin ; hi != aHolesEnd ; ++ hi )
|
|
ssb.enter_contour( CGAL_SS_i::vertices_begin(*hi), CGAL_SS_i::vertices_end(*hi), Point_converter ) ;
|
|
|
|
return ssb.construct_skeleton();
|
|
}
|
|
|
|
template<class PointIterator, class HoleIterator>
|
|
boost::shared_ptr< Straight_skeleton_2< Exact_predicates_inexact_constructions_kernel > >
|
|
inline
|
|
create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
|
|
, PointIterator aOuterContour_VerticesEnd
|
|
, HoleIterator aHolesBegin
|
|
, HoleIterator aHolesEnd
|
|
)
|
|
{
|
|
return create_interior_straight_skeleton_2(aOuterContour_VerticesBegin
|
|
,aOuterContour_VerticesEnd
|
|
,aHolesBegin
|
|
,aHolesEnd
|
|
,Exact_predicates_inexact_constructions_kernel()
|
|
);
|
|
}
|
|
|
|
template<class PointIterator, class K>
|
|
boost::shared_ptr< Straight_skeleton_2<K> >
|
|
inline
|
|
create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
|
|
, PointIterator aOuterContour_VerticesEnd
|
|
, K const& k
|
|
)
|
|
{
|
|
std::vector< Polygon_2<K> > no_holes ;
|
|
return create_interior_straight_skeleton_2(aOuterContour_VerticesBegin
|
|
,aOuterContour_VerticesEnd
|
|
,no_holes.begin()
|
|
,no_holes.end()
|
|
,k
|
|
);
|
|
}
|
|
|
|
template<class PointIterator>
|
|
boost::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
|
|
inline
|
|
create_interior_straight_skeleton_2 ( PointIterator aOuterContour_VerticesBegin
|
|
, PointIterator aOuterContour_VerticesEnd
|
|
)
|
|
{
|
|
return create_interior_straight_skeleton_2(aOuterContour_VerticesBegin
|
|
,aOuterContour_VerticesEnd
|
|
,Exact_predicates_inexact_constructions_kernel()
|
|
);
|
|
}
|
|
|
|
template<class Polygon, class K>
|
|
boost::shared_ptr< Straight_skeleton_2<K> >
|
|
inline
|
|
create_interior_straight_skeleton_2 ( Polygon const& aOutContour, K const& k )
|
|
{
|
|
CGAL_precondition(aOutContour.is_simple() || !"The input polygon is not simple.");
|
|
return create_interior_straight_skeleton_2(CGAL_SS_i::vertices_begin(aOutContour)
|
|
,CGAL_SS_i::vertices_end(aOutContour)
|
|
,k
|
|
);
|
|
}
|
|
|
|
template<class Polygon>
|
|
boost::shared_ptr< Straight_skeleton_2< Exact_predicates_inexact_constructions_kernel > >
|
|
inline
|
|
create_interior_straight_skeleton_2 ( Polygon const& aOutContour )
|
|
{
|
|
return create_interior_straight_skeleton_2(aOutContour, Exact_predicates_inexact_constructions_kernel() );
|
|
}
|
|
|
|
template<class FT, class PointIterator, class K>
|
|
boost::shared_ptr< Straight_skeleton_2<K> >
|
|
create_exterior_straight_skeleton_2 ( FT const& aMaxOffset
|
|
, PointIterator aVerticesBegin
|
|
, PointIterator aVerticesEnd
|
|
, K const& k
|
|
)
|
|
{
|
|
typedef typename std::iterator_traits<PointIterator>::value_type Point_2 ;
|
|
|
|
typedef Straight_skeleton_2<K> Ss ;
|
|
typedef boost::shared_ptr<Ss> SsPtr ;
|
|
|
|
SsPtr rSkeleton ;
|
|
|
|
boost::optional<FT> margin = compute_outer_frame_margin( aVerticesBegin
|
|
, aVerticesEnd
|
|
, aMaxOffset
|
|
);
|
|
|
|
if ( margin )
|
|
{
|
|
|
|
Bbox_2 bbox = bbox_2(aVerticesBegin, aVerticesEnd);
|
|
|
|
FT fxmin = bbox.xmin() - *margin ;
|
|
FT fxmax = bbox.xmax() + *margin ;
|
|
FT fymin = bbox.ymin() - *margin ;
|
|
FT fymax = bbox.ymax() + *margin ;
|
|
|
|
Point_2 frame[4] ;
|
|
|
|
frame[0] = Point_2(fxmin,fymin) ;
|
|
frame[1] = Point_2(fxmax,fymin) ;
|
|
frame[2] = Point_2(fxmax,fymax) ;
|
|
frame[3] = Point_2(fxmin,fymax) ;
|
|
|
|
typedef std::vector<Point_2> Hole ;
|
|
|
|
Hole lPoly(aVerticesBegin, aVerticesEnd);
|
|
std::reverse(lPoly.begin(), lPoly.end());
|
|
|
|
std::vector<Hole> holes ;
|
|
holes.push_back(lPoly) ;
|
|
|
|
rSkeleton = create_interior_straight_skeleton_2(frame, frame+4, holes.begin(), holes.end(), k ) ;
|
|
}
|
|
|
|
return rSkeleton ;
|
|
}
|
|
|
|
template<class FT, class PointIterator>
|
|
boost::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
|
|
inline
|
|
create_exterior_straight_skeleton_2 ( FT const& aMaxOffset
|
|
, PointIterator aVerticesBegin
|
|
, PointIterator aVerticesEnd
|
|
)
|
|
{
|
|
return create_exterior_straight_skeleton_2(aMaxOffset
|
|
,aVerticesBegin
|
|
,aVerticesEnd
|
|
,Exact_predicates_inexact_constructions_kernel()
|
|
);
|
|
}
|
|
|
|
|
|
template<class FT, class Polygon, class K>
|
|
boost::shared_ptr< Straight_skeleton_2<K> >
|
|
inline
|
|
create_exterior_straight_skeleton_2 ( FT const& aMaxOffset, Polygon const& aPoly, K const& k )
|
|
{
|
|
CGAL_precondition(aPoly.is_simple() || !"The input polygon is not simple.");
|
|
return create_exterior_straight_skeleton_2(aMaxOffset
|
|
,CGAL_SS_i::vertices_begin(aPoly)
|
|
,CGAL_SS_i::vertices_end (aPoly)
|
|
,k
|
|
);
|
|
}
|
|
|
|
template<class FT, class Polygon>
|
|
boost::shared_ptr< Straight_skeleton_2<Exact_predicates_inexact_constructions_kernel> >
|
|
inline
|
|
create_exterior_straight_skeleton_2 ( FT const& aMaxOffset, Polygon const& aPoly )
|
|
{
|
|
return create_exterior_straight_skeleton_2(aMaxOffset
|
|
,aPoly
|
|
,Exact_predicates_inexact_constructions_kernel()
|
|
);
|
|
}
|
|
|
|
} // end namespace CGAL
|
|
|
|
#include <CGAL/enable_warnings.h>
|
|
|
|
#endif // CGAL_STRAIGHT_SKELETON_BUILDER_2_H //
|
|
// EOF //
|