BWAPI
Public Types | Public Member Functions
Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel > Class Template Reference

#include <Arr_polyhedral_sgm.h>

Inheritance diagram for Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >:
Inheritance graph
[legend]
Collaboration diagram for Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >:
Collaboration graph
[legend]

List of all members.

Public Types

typedef Geometry_traits_2::Point_3 Point_3
typedef Geometry_traits_2::Vector_3 Vector_3
typedef T_Dcel< Geometry_traits_2Dcel
typedef
Arr_spherical_gaussian_map_3
< Geometry_traits_2, T_Dcel > 
Base
typedef
Arr_polyhedral_sgm_overlay
< Self
Arr_polyhedral_sgm_overlay

Public Member Functions

 Arr_polyhedral_sgm ()
 Arr_polyhedral_sgm (const Self &sgm)
void assign (const Self &sgm)
virtual ~Arr_polyhedral_sgm ()
void clear ()
template<class Arr_polyhedral_sgm >
void minkowski_sum (const Arr_polyhedral_sgm &sgm1, const Arr_polyhedral_sgm &sgm2)
template<class Arr_polyhedral_sgm , typename OverlayTraits >
void minkowski_sum (const Arr_polyhedral_sgm &sgm1, const Arr_polyhedral_sgm &sgm2, OverlayTraits &overlay_traits)
unsigned int number_of_vertices () const
unsigned int number_of_edges () const
unsigned int number_of_facets () const
void print_stat ()

template<class Geometry_traits_2, template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
class Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >


Member Typedef Documentation

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
typedef Arr_polyhedral_sgm_overlay<Self> Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::Arr_polyhedral_sgm_overlay
template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
typedef Arr_spherical_gaussian_map_3<Geometry_traits_2, T_Dcel> Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::Base
template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
typedef T_Dcel<Geometry_traits_2> Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::Dcel
template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
typedef Geometry_traits_2::Point_3 Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::Point_3
template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
typedef Geometry_traits_2::Vector_3 Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::Vector_3

Constructor & Destructor Documentation

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::Arr_polyhedral_sgm ( ) [inline]

Parameter-less Constructor

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::Arr_polyhedral_sgm ( const Self sgm) [inline]

Copy Constructor

Here is the call graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
virtual Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::~Arr_polyhedral_sgm ( ) [inline, virtual]

Destructor

Here is the call graph for this function:


Member Function Documentation

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
void Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::assign ( const Self sgm) [inline]

Assign a spherical Gaussian map to this

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
void Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::clear ( ) [inline, virtual]

Clear the internal representation and auxiliary data structures

Reimplemented from Arrangement_on_surface_2< Geometry_traits_2, Arr_spherical_topology_traits_2< Geometry_traits_2, T_Dcel< Geometry_traits_2 > > >.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
template<class Arr_polyhedral_sgm >
void Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::minkowski_sum ( const Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel > &  sgm1,
const Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel > &  sgm2 
) [inline]

Compute the minkowski sum of a range of objects of type Arr_polyhedral_sgm

Compute the minkowski sum of a range of objects of type Arr_polyhedral_sgm

Compute the Minkowski sum of 2 objects of type Arr_polyhedral_sgm

Parameters:
sgm1the first Arr_polyhedral_sgm object
sgm2the second Arr_polyhedral_sgm object

Here is the call graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
template<class Arr_polyhedral_sgm , typename OverlayTraits >
void Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::minkowski_sum ( const Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel > &  sgm1,
const Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel > &  sgm2,
OverlayTraits &  overlay_traits 
) [inline]

Compute the Minkowski sum of 2 objects of type Arr_polyhedral_sgm

Parameters:
sgm1the first Arr_polyhedral_sgm object
sgm2the second Arr_polyhedral_sgm object

Here is the call graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
unsigned int Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::number_of_edges ( ) const [inline]

Obtain the number of (primal) edges

Returns:
the number of (primal) edges. Edges that connect vertices of degree 2 are not counted, as they have been introduced only to make non-x-monotone curves x-monotone.

Reimplemented from Arrangement_on_surface_2< Geometry_traits_2, Arr_spherical_topology_traits_2< Geometry_traits_2, T_Dcel< Geometry_traits_2 > > >.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
unsigned int Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::number_of_facets ( ) const [inline]

Obtain the number of (primal) facets

Returns:
the number of (primal) facets. Vertices of degree 2 are not counted, as they have been introduced only to make non-x-monotone curves x-monotone.

Here is the call graph for this function:

Here is the caller graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
unsigned int Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::number_of_vertices ( ) const [inline]

Obtain the number of (primal) vertices

Reimplemented from Arrangement_on_surface_2< Geometry_traits_2, Arr_spherical_topology_traits_2< Geometry_traits_2, T_Dcel< Geometry_traits_2 > > >.

Here is the caller graph for this function:

template<class Geometry_traits_2 , template< class T > class T_Dcel = Arr_polyhedral_sgm_arr_dcel>
void Arr_polyhedral_sgm< Geometry_traits_2, T_Dcel >::print_stat ( ) [inline]

Print statistics

Reimplemented from Arr_spherical_gaussian_map_3< Geometry_traits_2, T_Dcel >.

Here is the call graph for this function:


The documentation for this class was generated from the following file:
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Defines