CGAL 6.2 - 2D and 3D Linear Geometry Kernel: CGAL::Simple_cartesian< FieldNumberType > Struct Template Reference

CGAL 6.2 - 2D and 3D Linear Geometry Kernel

Loading...
Searching...
No Matches
List of all members
CGAL::Simple_cartesian< FieldNumberType > Struct Template Reference
Reference Manual » Kernel Classes

`#include <CGAL/Simple_cartesian.h>`

## Definition

template<typename FieldNumberType>
struct CGAL::Simple_cartesian< FieldNumberType >

A model for a `Kernel` using Cartesian coordinates to represent the geometric objects.

In order for `Simple_cartesian` to model Euclidean geometry in \( E^2\) and/or \( E^3\), for some mathematical field \( E\) (e.g., the rationals \(\mathbb{Q}\) or the reals \(\mathbb{R}\)), the template parameter `FieldNumberType` must model the mathematical field \( E\). That is, the field operations on this number type must compute the mathematically correct results. If the number type provided as a model for `FieldNumberType` is only an approximation of a field (such as the built-in type `double`), then the geometry provided by the kernel is only an approximation of Euclidean geometry.

Is model of
  `Kernel`

Implementation

In contrast to `Cartesian`, no reference counting is used internally. This eases debugging, but may slow down algorithms that copy objects intensively.

See also
  `CGAL::Cartesian<FieldNumberType>`
  `CGAL::Homogeneous<RingNumberType>`
  `CGAL::Simple_homogeneous<RingNumberType>`

Examples
  Filtered_kernel/Filtered_predicate.cpp, Kernel_23/cartesian_converter.cpp, Kernel_23/points_and_segment.cpp, and Kernel_23/surprising.cpp.

## Types
typedef FieldNumberType | FT
typedef FieldNumberType | RT