CGAL 5.6.3 - 2D and 3D Linear Geometry Kernel

Loading...
Searching...
No Matches
List of all members
Kernel::ConstructCircumcenter_2 Concept Reference
2D and 3D Linear Geometry Kernel Reference » Concepts » Kernel Function Object Concepts

## Definition

Refines
  `AdaptableTernaryFunction`

See also
  `CGAL::circumcenter()`

## Operations
A model of this concept must provide:
Kernel::Point_2 | operator() (const Kernel::Point_2 &p, const Kernel::Point_2 &q)
| compute the center of the smallest circle passing through the points `p` and `q`.
Kernel::Point_2 | operator() (const Kernel::Point_2 &p, const Kernel::Point_2 &q, const Kernel::Point_2 &r)
| compute the center of the circle passing through the points `p`, `q`, and `r`.
Kernel::Point_2 | operator() (const Kernel::Triangle_2 &t)
| compute the center of the circle passing through the three vertices of `t`.

## Member Function Documentation

## ◆ operator()() [1/3]

Kernel::Point_2 Kernel::ConstructCircumcenter_2::operator() | ( | const Kernel::Point_2 & | p,
|  | const Kernel::Point_2 & | q
| ) |  |

compute the center of the smallest circle passing through the points `p` and `q`.

Note : this is the same as `Kernel::ConstructMidpoint_2`.

## ◆ operator()() [2/3]

Kernel::Point_2 Kernel::ConstructCircumcenter_2::operator() | ( | const Kernel::Point_2 & | p,
|  | const Kernel::Point_2 & | q,
|  | const Kernel::Point_2 & | r
| ) |  |

compute the center of the circle passing through the points `p`, `q`, and `r`.

Precondition
  `p`, `q`, and `r` are not collinear.

## ◆ operator()() [3/3]

Kernel::Point_2 Kernel::ConstructCircumcenter_2::operator() | ( | const Kernel::Triangle_2 & | t | ) |

compute the center of the circle passing through the three vertices of `t`.

Precondition
  `t` is not degenerate.