|
CGAL 6.0 - 2D and 3D Linear Geometry Kernel
|
AdaptableUnaryFunction CGAL::Circle_2<Kernel> CGAL::squared_radius() Operations | |
A model of this concept must provide: | |
| Kernel::FT | operator() (const Kernel::Circle_2 &c) |
returns the squared radius of c. | |
| Kernel::FT | operator() (const Kernel::Point_2 &p, const Kernel::Point_2 &q, const Kernel::Point_2 &r) |
returns the squared radius of the circle passing through p, q and r. | |
| Kernel::FT | operator() (const Kernel::Point_2 &p, const Kernel::Point_2 &q) |
returns the squared radius of the smallest circle passing through p, and q, i.e. one fourth of the squared distance between p and q. | |
| Kernel::FT | operator() (const Kernel::Point_2 &p) |
returns the squared radius of the smallest circle passing through p, i.e. \( 0\). | |
| Kernel::FT Kernel::ComputeSquaredRadius_2::operator() | ( | const Kernel::Point_2 & | p, |
| const Kernel::Point_2 & | q, | ||
| const Kernel::Point_2 & | r | ||
| ) |
returns the squared radius of the circle passing through p, q and r.
p, q and r are not collinear.