CGAL 6.1.2 - 3D Spherical Geometry Kernel: Class and Concept List

CGAL 6.1.2 - 3D Spherical Geometry Kernel

Loading...
Searching...
No Matches
Class and Concept List
Here is the list of all concepts and classes of this package. Classes are inside the namespace CGAL. Concepts are in the global namespace.
[detail level 12]

▼N CGAL |
C Algebraic_kernel_for_spheres_2_3 |
C Circular_arc_3 |
C Circular_arc_point_3 |
C Exact_spherical_kernel_3 | A typedef to a spherical kernel that provides both exact geometric predicates and exact geometric constructions
C Line_arc_3 |
C Polynomial_1_3 |
C Polynomial_for_spheres_2_3 |
C Polynomials_for_lines_3 |
C Root_for_spheres_2_3 |
C Spherical_kernel_3 |
▼C AlgebraicKernelForSpheres | The `AlgebraicKernelForSpheres` concept is meant to provide the curved kernel with all the algebraic functionalities required for the manipulation of spheres, circles, and circular arcs in 3D
C CompareX |
C CompareXY |
C CompareXYZ |
C CompareY |
C CompareZ |
C ConstructPolynomial_1_3 |
C ConstructPolynomialForSpheres_2_3 |
C ConstructPolynomialsForLines_3 |
C Polynomial_1_3 | Concept to represent trivariate polynomials of degree 1 whose coefficients are of a type that is a model of the concept `RingNumberType`
C PolynomialForSpheres_2_3 | Concept to represent trivariate polynomials of degree up to 2 capable of storing equations of spheres, whose center's coordinates, as well as the square of the radius, are of a type that is a model of the concept `FieldNumberType`
C PolynomialsForCircles_3 | Concept to represent a system of polynomials on `FieldNumberType` capable of storing equations of circles
C PolynomialsForLines_3 | Concept to represent a system of polynomials on `FieldNumberType` capable of storing equations of lines
C RootForSpheres_2_3 | Concept to represent the roots of a system of three equations of degree 2 in three variables `x`, `y` and `z` that are models of concept `AlgebraicKernelForSpheres::PolynomialForSpheres_2_3`
C SignAt |
C Solve |
C XCriticalPoints |
C YCriticalPoints |
C ZCriticalPoints |
▼C SphericalKernel |
C BoundedSide_3 |
C CircularArc_3 | Concept for arcs of circles
C CircularArcPoint_3 | Concept for points on spheres, circles, circular arcs or line arcs
C CompareTheta_3 |
C CompareThetaZ_3 |
C CompareX_3 |
C CompareXY_3 |
C CompareXYZ_3 |
C CompareY_3 |
C CompareZ_3 |
C CompareZAtTheta_3 |
C CompareZToRight_3 |
C ComputeApproximateAngle_3 |
C ComputeApproximateSquaredLength_3 |
C ComputeCircularX_3 |
C ComputeCircularY_3 |
C ComputeCircularZ_3 |
C ConstructBbox_3 |
C ConstructCircle_3 |
C ConstructCircularArc_3 | The circular arc constructed from a circle, a source, and a target, is defined as the set of points of the circle that lie between the source `p1` and the target `p2`, when traversing the circle counterclockwise seen from the side of the plane of the circle pointed by its positive normal vectors
C ConstructCircularArcPoint_3 |
C ConstructCircularMaxVertex_3 |
C ConstructCircularMinVertex_3 |
C ConstructCircularSourceVertex_3 |
C ConstructCircularTargetVertex_3 |
C ConstructLine_3 |
C ConstructLineArc_3 |
C ConstructPlane_3 |
C ConstructSphere_3 |
C DoIntersect_3 | Testing whether two curves or surfaces intersect
C DoOverlap_3 |
C Equal_3 | Testing equality between objects
C GetEquation |
C HasOn_3 |
C HasOnBoundedSide_3 |
C HasOnUnboundedSide_3 |
C Intersect_3 |
C IsThetaMonotone_3 |
C LineArc_3 | Concept for line segments supported by a line that is a model of `Kernel::Line_3`, and whose endpoints are models of the `SphericalKernel::CircularArcPoint_3` concept
C MakeThetaMonotone_3 |
C Split_3 |