Arr_compute_zone_visitor< Arrangement_, OutputIterator_ > Class Template Reference

#include <Arr_compute_zone_visitor.h>

List of all members.

Public Types
typedef OutputIterator_	OutputIterator
typedef Arrangement_	Arrangement_2
typedef Arrangement_2::Vertex_handle	Vertex_handle
typedef Arrangement_2::Halfedge_handle	Halfedge_handle
typedef Arrangement_2::Face_handle	Face_handle
typedef Arrangement_2::Point_2	Point_2
typedef Arrangement_2::X_monotone_curve_2	X_monotone_curve_2
typedef std::pair < Halfedge_handle, bool >	Result
Public Member Functions
	Arr_compute_zone_visitor (OutputIterator &oi)
void	init (Arrangement_2 *)
Result	found_subcurve (const X_monotone_curve_2 &, Face_handle face, Vertex_handle left_v, Halfedge_handle left_he, Vertex_handle right_v, Halfedge_handle right_he)
Result	found_overlap (const X_monotone_curve_2 &, Halfedge_handle he, Vertex_handle left_v, Vertex_handle right_v)

template<class Arrangement_, class OutputIterator_>
class Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >

---

Member Typedef Documentation

template<class Arrangement_ , class OutputIterator_ >

typedef Arrangement_ Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::Arrangement_2

template<class Arrangement_ , class OutputIterator_ >

typedef Arrangement_2::Face_handle Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::Face_handle

template<class Arrangement_ , class OutputIterator_ >

typedef Arrangement_2::Halfedge_handle Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::Halfedge_handle

template<class Arrangement_ , class OutputIterator_ >

typedef OutputIterator_ Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::OutputIterator

template<class Arrangement_ , class OutputIterator_ >

typedef Arrangement_2::Point_2 Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::Point_2

template<class Arrangement_ , class OutputIterator_ >

typedef std::pair<Halfedge_handle, bool> Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::Result

template<class Arrangement_ , class OutputIterator_ >

typedef Arrangement_2::Vertex_handle Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::Vertex_handle

template<class Arrangement_ , class OutputIterator_ >

typedef Arrangement_2::X_monotone_curve_2 Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::X_monotone_curve_2

---

Constructor & Destructor Documentation

template<class Arrangement_ , class OutputIterator_ >

Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::Arr_compute_zone_visitor

(

OutputIterator &

oi

)

[inline]

Constructor.

---

Member Function Documentation

template<class Arrangement_ , class OutputIterator_ >

Result Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::found_overlap	(	const X_monotone_curve_2 &	,
		Halfedge_handle	he,
		Vertex_handle	left_v,
		Vertex_handle	right_v
	)		[inline]

Handle the a subcurve that overlaps a given edge.

Parameters:

cv	The overlapping subcurve.
he	The overlapped halfedge (directed from left to right).
left_v	The vertex that corresponds to the left endpoint of cv (or an invalid handle if no such arrangement vertex exists).
right_v	The vertex that corresponds to the right endpoint of cv (or an invalid handle if no such arrangement vertex exists).

Returns:

A handle to the halfedge obtained from the insertion of the overlapping subcurve into the arrangement.

Here is the call graph for this function:

template<class Arrangement_ , class OutputIterator_ >

Result Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::found_subcurve	(	const X_monotone_curve_2 &	,
		Face_handle	face,
		Vertex_handle	left_v,
		Halfedge_handle	left_he,
		Vertex_handle	right_v,
		Halfedge_handle	right_he
	)		[inline]

Handle the a subcurve located in the interior of a given face.

Parameters:

cv	The subcurve.
face	The face containing cv's interior.
left_v	The vertex that corresponds to the left endpoint of cv (or an invalid handle if no such arrangement vertex exists).
left_he	The halfedge that contains the left endpoint of cv (or an invalid handle if no such halfedge exists).
right_v	The vertex that corresponds to the right endpoint of cv (or an invalid handle if no such arrangement vertex exists).
right_he	The halfedge that contains the right endpoint of cv (or an invalid handle if no such halfedge exists).

Returns:

A handle to the halfedge obtained from the insertion of the subcurve into the arrangement.

Here is the call graph for this function:

template<class Arrangement_ , class OutputIterator_ >

void Arr_compute_zone_visitor< Arrangement_, OutputIterator_ >::init

(

Arrangement_2 *

)

[inline]

Initialize the visitor.

---

The documentation for this class was generated from the following file:

• SPAR/AIModule/BWTA/vendors/CGAL/CGAL/Arrangement_2/Arr_compute_zone_visitor.h