CGAL 4.7 - 2D Circular Geometry Kernel: AlgebraicKernelForCircles::XCriticalPoints Concept Reference

\( \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 Circular Geometry Kernel

All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Groups Pages
List of all members
AlgebraicKernelForCircles::XCriticalPoints Concept Reference
Algebraic Concepts

## Definition

See Also
  `AlgebraicKernelForCircles::YCriticalPoints`

## Operations

A model of this concept must provide:
template<class OutputIterator >
OutputIterator | operator() (const AlgebraicKernelForCircles::Polynomial_for_circles_2_2 &p, OutputIterator res)
| Copies in the output iterator the `x`-critical points of polynomial `p`, as objects of type `AlgebraicKernelForCircles::Root_for_circles_2_2`.
template<class OutputIterator >
AlgebraicKernelForCircles::Root_for_circles_2_2 | operator() (const AlgebraicKernelForCircles::Polynomial_for_circles_2_2 &p, bool b)
| Computes the `x`-critical point with smallest (resp. largest) `x` of polynomial `p` if `b` is `true` (resp. `false`).