## "Fossies" - the Fresh Open Source Software Archive

### Member "doc_html/Kernel_23/classKernel_1_1ComputeSquaredRadius__2.html" (8 Nov 2019, 14080 Bytes) of package /linux/misc/CGAL-5.0-doc_html.tar.xz:

Caution: In this restricted "Fossies" environment the current HTML page may not be correctly presentated and may have some non-functional links. You can here alternatively try to browse the pure source code or just view or download the uninterpreted raw source code. If the rendering is insufficient you may try to find and view the page on the project site itself.

 CGAL 5.0 - 2D and 3D Linear Geometry Kernel

## Definition

Refines:
AdaptableFunctor (with one argument)
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. More...

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$$.

## ◆ operator()()

 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.

Precondition
p, q and r are not collinear.