You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+15-4Lines changed: 15 additions & 4 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -79,12 +79,23 @@ Setting the polygon and planning the path is the same as for Coverage Planning.
79
79
## Licensing
80
80
This repository is subject to GNU General Public License version 3 or later due to its dependencies.
81
81
82
-
The underlying (exact) geometric operations rely on [CGAL](https://www.cgal.org/license.html) which is restricted by GNU General Public License version 3 or later.
83
-
84
-
The underlying optimization the [memetic solver](https://csee.essex.ac.uk/staff/dkarap/?page=publications&key=Gutin2009a) presented in
82
+
# CGAL dependencies
83
+
The underlying (exact) geometric operations rely on [CGAL 5.0.3](https://www.cgal.org/license.html) which is restricted by GNU General Public License version 3 or later.
84
+
In particular the dependencies are:
85
+
- Algebraic Foundations (LGPL)
86
+
- 2D and 3D Linear Geometry Kernel (LPGL)
87
+
- 2D Polygon (LPGL)
88
+
- Geometric Object Generators (LPGL)
89
+
- STL Extensions (LGPL)
90
+
- 2D Triangulation (GPL)
91
+
- 2D Regularized Boolean Set-Operations (GPL)
92
+
- 2D Straight Skeleton and Polygon Offsetting (GPL)
93
+
94
+
# GTSP solver
95
+
The underlying optimization uses the [memetic solver](https://csee.essex.ac.uk/staff/dkarap/?page=publications&key=Gutin2009a) presented in
85
96
```
86
97
Gutin, Gregory, and Daniel Karapetyan.
87
98
"A memetic algorithm for the generalized traveling salesman problem."
88
99
Natural Computing 9.1 (2010): 47-60.
89
100
```
90
-
is free of charge for non-commercial purposes only.
101
+
It is free of charge for non-commercial purposes only.
0 commit comments