#include <CGAL/Construct_theta_graph_2.h>
A template functor for constructing Theta graphs with a given set of 2D points and a given initial direction for the cone boundaries.
- Template Parameters
-
- Examples:
- Cone_spanners_2/dijkstra_theta.cpp, and Cone_spanners_2/theta_io.cpp.
|
typedef Graph_ | Graph |
| the specific type of boost::adjacency_list . More...
|
|
typedef Traits::Point_2 | Point_2 |
| the point type
|
|
typedef Traits::Direction_2 | Direction_2 |
| the direction type
|
|
|
| Construct_theta_graph_2 (unsigned int k, Direction_2 initial_direction=Direction_2(1, 0)) |
| Constructor. More...
|
|
template<typename PointInputIterator > |
Graph_ & | operator() (const PointInputIterator &start, const PointInputIterator &end, Graph_ &g) |
| Function operator to construct a Theta graph. More...
|
|
unsigned int | number_of_cones () const |
| returns the number of cones.
|
|
template<class DirectionOutputIterator > |
DirectionOutputIterator | directions (DirectionOutputIterator result) |
| outputs the set of directions to the iterator result . More...
|
|
template<typename Traits_, typename Graph_>
the specific type of boost::adjacency_list
.
template<typename Traits_, typename Graph_>
Constructor.
- Parameters
-
k | Number of cones to divide space into |
initial_direction | A direction denoting one of the rays dividing the cones. This allows arbitary rotations of the rays that divide the plane. (default: positive x-axis) |
template<typename Traits_, typename Graph_>
template<class DirectionOutputIterator >
outputs the set of directions to the iterator result
.
- Template Parameters
-
- Returns
result
template<typename Traits_, typename Graph_>
template<typename PointInputIterator >
Graph_& CGAL::Construct_theta_graph_2< Traits_, Graph_ >::operator() |
( |
const PointInputIterator & |
start, |
|
|
const PointInputIterator & |
end, |
|
|
Graph_ & |
g |
|
) |
| |
Function operator to construct a Theta graph.
For the details of this algorithm, please refer to the User Manual.
- Template Parameters
-
- Parameters
-
[in] | start | An iterator pointing to the first vertex of the input. |
[in] | end | An iterator pointing to the past-the-end location of the input. |
[out] | g | The constructed graph object. |