\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
cgal.org
Top
Getting Started
Tutorials
Package Overview
Acknowledging CGAL
CGAL 4.10 - 2D and 3D Linear Geometry Kernel
All
Classes
Namespaces
Files
Functions
Variables
Typedefs
Enumerations
Enumerator
Groups
Pages
Kernel_23/surprising.cpp
#include <iostream>
#include <CGAL/Simple_cartesian.h>
typedef
CGAL::Simple_cartesian<double>
Kernel
;
typedef
Kernel::Point_2
Point_2;
int
main()
{
{
Point_2 p(0, 0.3), q(1, 0.6), r(2, 0.9);
std::cout << (
CGAL::collinear
(p,q,r) ?
"collinear\n"
:
"not collinear\n"
);
}
{
Point_2 p(0, 1.0/3.0), q(1, 2.0/3.0), r(2, 1);
std::cout << (
CGAL::collinear
(p,q,r) ?
"collinear\n"
:
"not collinear\n"
);
}
{
Point_2 p(0,0), q(1, 1), r(2, 2);
std::cout << (
CGAL::collinear
(p,q,r) ?
"collinear\n"
:
"not collinear\n"
);
}
return
0;
}