CGAL 6.2 - 3D Convex Hulls
Loading...
Searching...
No Matches
Directional Queries Functions

Functions

template<class Mesh , class Direction_3 , class NamedParameters >
vertex_descriptor CGAL::extreme_vertex_3 (const Convex_hull_hierarchy< Mesh > &ch, const Direction_3 &dir, const NamedParameters &np)
 computes the furthest point of the convex hull along the direction; If not unique, a single vertex is returned.
 
template<class Range , class Direction_3 , class NamedParameters >
Point_3 CGAL::extreme_point_3 (const Range &r, const Direction_3 &dir, const NamedParameters &np)
 computes the furthest point of the range along the direction; If not unique, a single point is returned.
 
template<class Graph , class NamedParameters , class Direction_3 >
vertex_descriptor CGAL::extreme_vertex_3 (const Graph &g, const Direction_3 &dir, const NamedParameters &np)
 computes the furthest point of the convex graph along the direction and returns the associated vertex; If not unique, a single vertex is returned.
 

Function Documentation

◆ extreme_point_3()

template<class Range , class Direction_3 , class NamedParameters >
Point_3 CGAL::extreme_point_3 ( const Range r,
const Direction_3 dir,
const NamedParameters &  np 
)

#include <CGAL/extreme_point_3.h>

computes the furthest point of the range along the direction; If not unique, a single point is returned.

Template Parameters
Rangeis a model of ConstRange. The value type of its iterator is the key type of the named parameter point_map.
Direction_3is a model of CGAL::Direction_3.
NamedParametersa sequence of Named Parameters
Parameters
rthe range of points
dirthe direction
npan optional sequence of Named Parameters among the ones listed below
Optional Named Parameters
  • A Converter from the point type of point_map to the point type of geom_traits
  • Type: a class model of NT_Converter
  • Default: a CGAL Cartesian_converter deduced from point_map and geom_traits, using CGAL::Kernel_traits
Returns
an instance of the key type of point_map parameter

◆ extreme_vertex_3() [1/2]

template<class Mesh , class Direction_3 , class NamedParameters >
vertex_descriptor CGAL::extreme_vertex_3 ( const Convex_hull_hierarchy< Mesh > &  ch,
const Direction_3 dir,
const NamedParameters &  np 
)

#include <CGAL/Convex_hull_hierarchy.h>

computes the furthest point of the convex hull along the direction; If not unique, a single vertex is returned.

Template Parameters
Mesha model of VertexListGraph and MutableFaceGraph used byCGAL::Convex_hull_hierarchy
Direction_3is a model of CGAL::Direction_3.
NamedParametersa sequence of Named Parameters
Parameters
chthe convex hull
dirthe direction
npan optional sequence of Named Parameters among the ones listed below
Optional Named Parameters
  • A Converter from the point type of vertex_point_map to the point type of geom_traits
  • Type: a class model of NT_Converter
  • Default: a CGAL Cartesian_converter deduced from vertex_point_map and geom_traits, using CGAL::Kernel_traits
Returns
a boost::graph_traits<Mesh>::vertex_descriptor

◆ extreme_vertex_3() [2/2]

template<class Graph , class NamedParameters , class Direction_3 >
vertex_descriptor CGAL::extreme_vertex_3 ( const Graph &  g,
const Direction_3 dir,
const NamedParameters &  np 
)

#include <CGAL/extreme_point_3.h>

computes the furthest point of the convex graph along the direction and returns the associated vertex; If not unique, a single vertex is returned.

Template Parameters
Graphis a model of VertexListGraph and AdjacencyGraph.
Direction_3is a model of Kernel::Direction_3.
NamedParametersa sequence of Named Parameters
Parameters
gthe convex graph
dirthe direction
npan optional sequence of Named Parameters among the ones listed below
Precondition
The input graph must represent a convex object to guarantee a correct answer.
Optional Named Parameters
  • a property map associating points to the vertices of g
  • Type: a model of ReadablePropertyMap
  • Default: boost::get(CGAL::vertex_point, g)
  • Extra: If this parameter is omitted, an internal property map for CGAL::vertex_point_t must be available in Graph.
  • A converter from the point type of vertex_point_map to the point type of geom_traits
  • Type: a class model of NT_Converter
  • Default: a CGAL Cartesian_converter deduced from vertex_point_map and geom_traits, using CGAL::Kernel_traits
Returns
a boost::graph_traits<Graph>::vertex_descriptor