Re: [Yade-dev] new CGAL algorithms
You can ask them if the interpretation and implication is right. Many thanks. I'll try. vtk doesn't have regular delaunay (triangulation of spheres - not points). So, it can be usefull for something else perhaps but it would not replace CGAL. I am not familiar with vtk so much and to be honest I don't know what regular delaunay is ;-), but I will check it tomorrow. I checked already, vtk don't do that. Delaunay is very common, it is a triangulation of point sets. Regular Delaunay is based on weighted points (for us : center+radius), and the only library (that I know) doing that is CGAL. The dual graph of Delaunay is Voronoi tesselation, the dual of regular is Dirichlet tesselation (so, Dirichlet is a better keword for search engines than regular delaunay). I think there is a reason e.g. vtk is used so much compared to cgal (although their focus is quite different), and that's the license. Anyone should be reluctant to use something that excludes commercial use, since it is commercial funding AFAIK that drives non-negligible part of applied research. I agree. And from what I've read on CGAL website, the reason for QPL license is precisely to let CGAL developpers get commercial fundings. True : they don't mention commercial use from others... It also implies that the library is not packaged or is in special repositories, whereas more standard things can be found at any decent distribution -- this maintenance burden counts, for me at least, as well (recall wm3 and qglviewer). CGAL is a debian package you know? Possible solution if we find license conflicts : I can easily split the code into Yade engines using triangulations, and code doing the triangulation that I would remove from Yade (TesselationWrapper class). The Yade part would be compiled only if TesselationWrapper lib is found. There would be only references to TesselationWrapper in Yade, and this is not a CGAL class (one could even write another wrapper based on a different library). What do you think of this option? Bruno -- ___ Chareyre Bruno Maître de Conférences Grenoble INP Laboratoire 3SR - bureau E145 BP 53 - 38041, Grenoble cedex 9 - France Tél : 33 4 56 52 86 21 Fax : 33 4 76 82 70 43 ___ Mailing list: https://launchpad.net/~yade-dev Post to : yade-dev@lists.launchpad.net Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
Re: [Yade-dev] new CGAL algorithms
CGAL is a debian package you know? Yes, but in non-free part. Possible solution if we find license conflicts : I can easily split the code into Yade engines using triangulations, and code doing the triangulation that I would remove from Yade (TesselationWrapper class). The Yade part would be compiled only if TesselationWrapper lib is found. There would be only references to TesselationWrapper in Yade, and this is not a CGAL class (one could even write another wrapper based on a different library). What do you think of this option? You don't even have to write wrappers, just use CGAL in plugins that need it and mark the file YADE_REQUIRE_FEATURE(cgal) (works only for file in pkg/, not extra). If will be compiled only if cgal is present -- cgal detection logic is even in SConstruct already, but I haven't tested it since cgal packages want to install non-default boost libs. Just say scons features=gts,vtk,cgal,log4cxx,python (or whatever you want). We do it with VTK, GTS etc as well and I think it works well. For every feature YADE_FEATURE macro is defined, so you can test that in your files as well (YADE_CGAL in this case), if you want to compile them even without CGAL. Vaclav ___ Mailing list: https://launchpad.net/~yade-dev Post to : yade-dev@lists.launchpad.net Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
Re: [Yade-dev] new CGAL algorithms
Dne 23.9.2009 18:25, Bruno Chareyre napsal(a): For your information, CGAL 3.5 (beta) includes periodic triangulation (which means the TriangulationCollider I wrote for Yade can now easily be extended to periodic geometries), and AABB tree for distance detection. Nice. Can you ask them if we can use it in a GPL-licensed software without the restrictions of commercial use, though? It is not clear from their website. ___ Mailing list: https://launchpad.net/~yade-dev Post to : yade-dev@lists.launchpad.net Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
Re: [Yade-dev] new CGAL algorithms
Václav Šmilauer said: (by the date of Thu, 24 Sep 2009 10:44:41 +0200) Dne 23.9.2009 18:25, Bruno Chareyre napsal(a): For your information, CGAL 3.5 (beta) includes periodic triangulation (which means the TriangulationCollider I wrote for Yade can now easily be extended to periodic geometries), and AABB tree for distance detection. Nice. Can you ask them if we can use it in a GPL-licensed software without the restrictions of commercial use, though? It is not clear from their website. heh, and CGAL is already used. Although as an external library. And we still don't know if their license permits it. -- Janek Kozicki | ___ Mailing list: https://launchpad.net/~yade-dev Post to : yade-dev@lists.launchpad.net Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
Re: [Yade-dev] new CGAL algorithms
What is the (possible) problem with commercial use? What sort of situation would be impacted by this? Bruno // Copyright (c) 2001,2004 INRIA Sophia-Antipolis (France). // All rights reserved. // // This file is part of CGAL (www.cgal.org); you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public License as // published by the Free Software Foundation; version 2.1 of the License. // See the file LICENSE.LGPL distributed with CGAL. // // Licensees holding a valid commercial license may use this file in // accordance with the commercial license agreement provided with the software. Janek Kozicki a écrit : Václav Šmilauer said: (by the date of Thu, 24 Sep 2009 10:44:41 +0200) Dne 23.9.2009 18:25, Bruno Chareyre napsal(a): For your information, CGAL 3.5 (beta) includes periodic triangulation (which means the TriangulationCollider I wrote for Yade can now easily be extended to periodic geometries), and AABB tree for distance detection. Nice. Can you ask them if we can use it in a GPL-licensed software without the restrictions of commercial use, though? It is not clear from their website. heh, and CGAL is already used. Although as an external library. And we still don't know if their license permits it. -- ___ Chareyre Bruno Maître de Conférences Grenoble INP Laboratoire 3SR - bureau E145 BP 53 - 38041, Grenoble cedex 9 - France Tél : 33 4 56 52 86 21 Fax : 33 4 76 82 70 43 ___ Mailing list: https://launchpad.net/~yade-dev Post to : yade-dev@lists.launchpad.net Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
Re: [Yade-dev] new CGAL algorithms
What is the (possible) problem with commercial use? What sort of situation would be impacted by this? It is not clear whether commercial means used for commercial purposes or that the code using cgal is actually sold for money. The problem is that academia research can be sponsored by private companies that might need to use the code for their own (commercial) research (not selling the code). GPL, under which is yade licensed, permits this freedom. V. ___ Mailing list: https://launchpad.net/~yade-dev Post to : yade-dev@lists.launchpad.net Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
[Yade-dev] new CGAL algorithms
For your information, CGAL 3.5 (beta) includes periodic triangulation (which means the TriangulationCollider I wrote for Yade can now easily be extended to periodic geometries), and AABB tree for distance detection. See http://www.cgal.org/releases.html#release3.5 Bruno Triangulations and Delaunay Triangulations 3D Periodic Triangulations (new package) * This package allows to build and handle triangulations of point sets in the three dimensional flat torus. Triangulations are built incrementally and can be modified by insertion or removal of vertices. They offer point location facilities. [...] Spatial Searching and Sorting AABB tree (new package) * This package implements a hierarchy of axis-aligned bounding boxes (a AABB tree) for efficient intersection and distance computations between 3D queries and sets of input 3D geometric objects. -- ___ Chareyre Bruno Maître de Conférences Grenoble INP Laboratoire 3SR - bureau E145 BP 53 - 38041, Grenoble cedex 9 - France Tél : 33 4 56 52 86 21 Fax : 33 4 76 82 70 43 ___ Mailing list: https://launchpad.net/~yade-dev Post to : yade-dev@lists.launchpad.net Unsubscribe : https://launchpad.net/~yade-dev More help : https://help.launchpad.net/ListHelp
