CGAL 6.1.1 - 2D and 3D Linear Geometry Kernel

Loading...
Searching...
No Matches
Functions
CGAL::min_vertex()
Reference Manual » 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`.
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`.

## Function Documentation

## ◆ min_vertex() [1/2]

template<typename Kernel >

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

`#include <CGAL/Kernel/global_functions.h>`

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

Exactness
  This construction is trivial and therefore always exact in `Exact_predicates_inexact_constructions_kernel`.

## ◆ min_vertex() [2/2]

template<typename Kernel >

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

`#include <CGAL/Kernel/global_functions.h>`

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

Exactness
  This construction is trivial and therefore always exact in `Exact_predicates_inexact_constructions_kernel`.