mirror of https://github.com/CGAL/cgal
141 lines
4.6 KiB
C++
141 lines
4.6 KiB
C++
// ============================================================================
|
|
//
|
|
// Copyright (c) 1997-2001 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/Polygon_offset_builder_2.h
|
|
// package : Straight_skeleton_2 (1.1.0)
|
|
//
|
|
// author(s) : Fernando Cacciola
|
|
// maintainer : Fernando Cacciola <fernando_cacciola@hotmail>
|
|
// coordinator : Fernando Cacciola <fernando_cacciola@hotmail>
|
|
//
|
|
// ============================================================================
|
|
|
|
#ifndef CGAL_POLYGON_OFFSET_BUILDER_2_H
|
|
#define CGAL_POLYGON_OFFSET_BUILDER_2_H 1
|
|
|
|
#include <vector>
|
|
#include <algorithm>
|
|
|
|
#include <boost/shared_ptr.hpp>
|
|
|
|
#include <CGAL/Polygon_offset_builder_traits_2.h>
|
|
|
|
CGAL_BEGIN_NAMESPACE
|
|
|
|
template<class Sls_, class Traits_, class Container_>
|
|
class Polygon_offset_builder_2
|
|
{
|
|
public :
|
|
|
|
typedef Sls_ Sls ;
|
|
typedef Traits_ Traits ;
|
|
typedef Container_ Container ;
|
|
|
|
typedef typename Traits::FT FT ;
|
|
|
|
typedef typename Traits::Point_2 Point_2 ;
|
|
|
|
typedef boost::shared_ptr<Container> ContainerPtr ;
|
|
|
|
Polygon_offset_builder_2( Sls const& aSls, Traits const& aTraits = Traits() ) ;
|
|
|
|
template<class OutputIterator>
|
|
OutputIterator construct_offset_polygons( FT aTime, OutputIterator aOut ) ;
|
|
|
|
private:
|
|
|
|
typedef typename Sls::Halfedge_const_handle Halfedge_const_handle ;
|
|
|
|
typedef std::vector<Halfedge_const_handle> Halfedge_vector ;
|
|
|
|
typedef CGAL_SLS_i::Vertex <FT> iVertex ;
|
|
typedef CGAL_SLS_i::Edge <FT> iEdge ;
|
|
typedef CGAL_SLS_i::Triedge<FT> iTriedge ;
|
|
|
|
bool handled_assigned( Halfedge_const_handle aH ) const
|
|
{
|
|
const Halfedge_const_handle cNull ;
|
|
return aH != cNull ;
|
|
}
|
|
|
|
Halfedge_const_handle LocateHook( FT aTime, Halfedge_const_handle aBisector, bool aAbove ) ;
|
|
|
|
template<class OutputIterator>
|
|
OutputIterator TraceOffsetPolygon( FT aTime, Halfedge_const_handle aHook, OutputIterator aOut ) ;
|
|
|
|
Halfedge_const_handle LocateSeed( FT aTime ) ;
|
|
|
|
bool IsVisited( Halfedge_const_handle aBisector ) { return mVisitedBisectors[aBisector->id()] != 0 ; }
|
|
|
|
void Visit( Halfedge_const_handle aBisector ) { mVisitedBisectors[aBisector->id()] = 1 ; }
|
|
|
|
static inline iEdge CreateEdge ( Halfedge_const_handle aH )
|
|
{
|
|
Point_2 s = aH->opposite()->vertex()->point() ;
|
|
Point_2 t = aH->vertex()->point() ;
|
|
return iEdge( iVertex(s.x(),s.y()), iVertex(t.x(),t.y()) );
|
|
}
|
|
|
|
static inline iTriedge CreateTriedge ( Halfedge_const_handle aE0
|
|
, Halfedge_const_handle aE1
|
|
, Halfedge_const_handle aE2
|
|
)
|
|
{
|
|
return iTriedge(CreateEdge(aE0),CreateEdge(aE1),CreateEdge(aE2));
|
|
}
|
|
|
|
Comparison_result Compare_offset_against_event_time( FT aT, Halfedge_const_handle aBisector, Halfedge_const_handle aNextBisector ) const
|
|
{
|
|
CGAL_assertion(aBisector->is_bisector());
|
|
CGAL_assertion(handle_assigned(aBisector->opposite()));
|
|
CGAL_assertion(aBisector->opposite()->is_bisector());
|
|
CGAL_assertion(aNextBisector->is_bisector());
|
|
CGAL_assertion(handle_assigned(aNextBisector->opposite()));
|
|
CGAL_assertion(aNextBisector->opposite()->is_bisector());
|
|
|
|
Halfedge_const_handle lBorderA = aBisector->defining_contour_edge();
|
|
Halfedge_const_handle lBorderB = aBisector->opposite()->defining_contour_edge();
|
|
Halfedge_const_handle lBorderC = aNextBisector->opposite()->defining_contour_edge();
|
|
|
|
return Compare_offset_against_event_time_2<Traits>(mTraits)()(aT,CreateTriedge(lBorderA,lBorderB,lBorderC));
|
|
}
|
|
|
|
Point_2 Construct_offset_point( FT aT, Halfedge_const_handle aBisector ) const
|
|
{
|
|
CGAL_assertion(aBisector->is_bisector());
|
|
CGAL_assertion(handle_assigned(aBisector->opposite()));
|
|
CGAL_assertion(aBisector->opposite()->is_bisector());
|
|
|
|
Halfedge_const_handle lBorderA = aBisector->defining_contour_edge();
|
|
Halfedge_const_handle lBorderB = aBisector->opposite()->defining_contour_edge();
|
|
|
|
return Construct_offset_point_2<Traits>(mTraits)()(aT,CreateEdge(lBorderA),CreateEdge(lBorderB));
|
|
}
|
|
|
|
void ResetVisitedBisectorsMap();
|
|
|
|
Traits const& mTraits ;
|
|
std::vector<int> mVisitedBisectors;
|
|
Halfedge_vector mBorders ;
|
|
};
|
|
|
|
CGAL_END_NAMESPACE
|
|
|
|
#ifdef CGAL_CFG_NO_AUTOMATIC_TEMPLATE_INCLUSION
|
|
# include <CGAL/Polygon_offset_builder_2.C>
|
|
#endif
|
|
|
|
#endif // CGAL_POLYGON_OFFSET_BUILDER_2_H //
|
|
// EOF //
|
|
|