Given an edge, return its dual as a container of points. More...

#include <Delaunay_triangulation_extension_3.hpp>

Constructors
	Get_dual_of_edge (const DelaunayTriangulation3 &T)
	The functor has to be constructed with a given 3D Delaunay triangulation. More...

Functors
template<class OutputIterator >
OutputIterator	operator() (const Edge &edge, bool &is_infinite, OutputIterator out) const
	Given an edge, return its dual as a container of points. More...

Detailed Description

template<class DelaunayTriangulation3>
class SBL::GT::T_Delaunay_triangulation_extension_3< DelaunayTriangulation3 >::Get_dual_of_edge

Given an edge, return its dual as a container of points.

It iterates over all the cells bounding the edge and store the dual vertex in a container. If there is an infinite cell, its dual is not recorded and the is_infinite input parameter is set to true.

Constructor & Destructor Documentation

◆ Get_dual_of_edge()

Get_dual_of_edge ( const DelaunayTriangulation3 & T )

inline

The functor has to be constructed with a given 3D Delaunay triangulation.

Member Function Documentation

◆ operator()()

OutputIterator operator()	(	const Edge &	edge,
		bool &	is_infinite,
		OutputIterator	out
	)		const

inline

Given an edge, return its dual as a container of points.

It iterates over all the cells bounding the edge and store the dual vertex in a container. If there is an infinite cell, its dual is not recorded and the is_infinite input parameter is set to true.

Template Parameters

OutputIterator Output iterator over a container of points.

Parameters

edge	The input edge for which we want the dual.
is_infinite	Output tag checking that the dual is infinite.
out	Output iterator over a container of points. template <typename OutputIterator>

Constructors