\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 4.7 - 2D and 3D Linear Geometry Kernel
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
Functions
CGAL::min_vertex()
2D and 3D Linear Geometry Kernel Reference » Global Kernel Functions

Functions

template<typename Kernel >
CGAL::Point_2< Kernel > CGAL::min_vertex (const CGAL::Iso_rectangle_2< Kernel > &ir)
 computes the vertex with the lexicographically smallest coordinates of the iso rectangle ir. More...
 
template<typename Kernel >
CGAL::Point_3< Kernel > CGAL::min_vertex (const CGAL::Iso_cuboid_3< Kernel > &ic)
 computes the vertex with the lexicographically smallest coordinates of the iso cuboid ic. More...
 

Function Documentation

template<typename Kernel >
CGAL::Point_2<Kernel> CGAL::min_vertex ( const CGAL::Iso_rectangle_2< Kernel > &  ir)

computes the vertex with the lexicographically smallest coordinates of the iso rectangle ir.

template<typename Kernel >
CGAL::Point_3<Kernel> CGAL::min_vertex ( const CGAL::Iso_cuboid_3< Kernel > &  ic)

computes the vertex with the lexicographically smallest coordinates of the iso cuboid ic.