CGAL HelloWorld

点和线段

如何创建点和线段，并计算两点之间的距离、点到线段的距离、点与线段的位置关系和中点。

• 定义Kernel(几何图元)
• 操作predicate(位置，距离和中点)

Code

1#include <iostream>
2#include <CGAL/Simple_cartesian.h>
3typedef CGAL::Simple_cartesian<double> Kernel;
4typedef Kernel::Point_2 Point_2;
5typedef Kernel::Segment_2 Segment_2;
6int main()
7{
8   
9   
10   
11  //!笛卡尔坐标系双精度浮点类型的点和线段
12  Point_2 p(1,1), q(10,10);
13  std::cout << "p = " << p << std::endl;
14  std::cout << "q = " << q.x() << " " << q.y() << std::endl;
15  std::cout << "sqdist(p,q) = " 
16            << CGAL::squared_distance(p,q) << std::endl;
17  
18  Segment_2 s(p,q);
19  Point_2 m(5, 9);
20  
21  std::cout << "m = " << m << std::endl;
22  std::cout << "sqdist(Segment_2(p,q), m) = "
23            << CGAL::squared_distance(s,m) << std::endl;
24  std::cout << "p, q, and m ";
25  //!方位
26  switch (CGAL::orientation(p,q,m)){
27   
28   
29   
30  case CGAL::COLLINEAR: 
31    std::cout << "are collinear\n";
32    break;
33  case CGAL::LEFT_TURN:
34    std::cout << "make a left turn\n";
35    break;
36  case CGAL::RIGHT_TURN: 
37    std::cout << "make a right turn\n";
38    break;
39  }
40  std::cout << " midpoint(p,q) = " << CGAL::midpoint(p,q) << std::endl;
41  return 0;
42}

Result

1p = 1 1
2q = 10 10
3sqdist(p,q) = 162
4m = 5 9
5sqdist(Segment_2(p,q), m) = 8
6p, q, and m make a left turn
7 midpoint(p,q) = 5.5 5.5
8

链接

HelloWorld

Reference

1. Hello World 之 CGAL
2. tutorial_hello_world

本文分享 CSDN - wbaolong。
如有侵权，请联系 support@oschina.cn 删除。
本文参与“OSC源创计划”，欢迎正在阅读的你也加入，一起分享。