CGAL 5.6 - 2D and 3D Linear Geometry Kernel
|
AdaptableTernaryFunction
CGAL::circumcenter()
Operations | |
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 . More... | |
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 . More... | |
Kernel::Point_2 | operator() (const Kernel::Triangle_2 &t) |
compute the center of the circle passing through the three vertices of t . More... | |
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
.
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
.
p
, q
, and r
are not collinear. 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
.
t
is not degenerate.