CGAL::Random_points_on_graph_edges_3< EdgeListGraph, VertexPointMap, Creator > Struct Template Reference

#include <CGAL/point_generators_3.h>

Definition

template<class EdgeListGraph, class VertexPointMap = typename boost::property_map<EdgeListGraph, CGAL::vertex_point_t>::type, class Creator = Creator_uniform_3< typename Kernel_traits< typename boost::property_traits<VertexPointMap>::value_type >::Kernel::RT, typename boost::property_traits<VertexPointMap>::value_type >>
struct CGAL::Random_points_on_graph_edges_3< EdgeListGraph, VertexPointMap, Creator >

The class Random_points_on_graph_edges_3 is an input iterator creating points uniformly distributed on the edges of a graph model of EdgeListGraph.

The graph must be valid and unchanged while the generator is used.

Is model of

InputIterator

PointGenerator

See also

CGAL::Random_points_in_disc_2<Point_2, Creator>

CGAL::Random_points_in_cube_3<Point_3, Creator>

CGAL::Random_points_in_triangle_3<Point_3, Creator>

CGAL::Random_points_on_sphere_3<Point_3, Creator>

CGAL::Random_points_in_triangle_mesh_2<Point_2, Triangulation>

CGAL::Random_points_in_tetrahedral_mesh_boundary_3<C3T3>

CGAL::Random_points_in_tetrahedral_mesh_3<C3T3>

CGAL::Random_points_in_triangles_2<Point_2>

CGAL::Random_points_in_triangles_3<Point_3>

Types
typedef std::input_iterator_tag	iterator_category
typedef boost::property_traits< VertexPointMap >::value_type	Point_3
typedef Point_3	value_type
typedef std::ptrdiff_t	difference_type
typedef const Point_3 *	pointer
typedef const Point_3 &	reference

Functions
	Random_points_on_graph_edges_3 (const EdgeListGraph &mesh, VertexPointMap vpm=get(vertex_point, mesh), Random &rnd=get_default_random())
	creates an input iterator g generating points of type Point_3 uniformly distributed on the edges of the graph.
std::pair< Point_3, typename boost::graph_traits< EdgeListGraph >::edge_descriptor >	point_and_support () const
	returns the last point generated and a descriptor of the edge used to generate that point.

Constructor & Destructor Documentation

Random_points_on_graph_edges_3()

template<class EdgeListGraph , class VertexPointMap = typename boost::property_map<EdgeListGraph, CGAL::vertex_point_t>::type, class Creator = Creator_uniform_3< typename Kernel_traits< typename boost::property_traits<VertexPointMap>::value_type >::Kernel::RT, typename boost::property_traits<VertexPointMap>::value_type >>

CGAL::Random_points_on_graph_edges_3< EdgeListGraph, VertexPointMap, Creator >::Random_points_on_graph_edges_3	(	const EdgeListGraph &	mesh,
		VertexPointMap	vpm = get(vertex_point, mesh),
		Random &	rnd = get_default_random()
	)

creates an input iterator g generating points of type Point_3 uniformly distributed on the edges of the graph.

Each edge has a probability to be chosen to hold the point depending on its length.