Tulip  4.0.0
Better Visualization Through Research
 All Classes Files Functions Variables Enumerations Enumerator Properties Groups Pages
ConvexHull.h
1 /*
2  *
3  * This file is part of Tulip (www.tulip-software.org)
4  *
5  * Authors: David Auber and the Tulip development Team
6  * from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
7  *
8  * Tulip is free software; you can redistribute it and/or modify
9  * it under the terms of the GNU Lesser General Public License
10  * as published by the Free Software Foundation, either version 3
11  * of the License, or (at your option) any later version.
12  *
13  * Tulip is distributed in the hope that it will be useful,
14  * but WITHOUT ANY WARRANTY; without even the implied warranty of
15  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
16  * See the GNU General Public License for more details.
17  *
18  */
19 ///@cond DOXYGEN_HIDDEN
20 
21 #ifndef TLP_GEO_CONVEX_HULL_H
22 #define TLP_GEO_CONVEX_HULL_H
23 #include <vector>
24 #include <tulip/Coord.h>
25 
26 namespace tlp {
27 
28 /**
29  * @ingroup Graph
30  * \brief function for convex hull manipulation
31  *
32  * \author : Daniel Archambault archam@cs.ubc.ca,
33  *
34  * \version 0.0.3 26/06/2006
35  *
36  * Compute the convex hull and return a list of indexes for the
37  * points on the convex hull in counterclockwise order. The convexHull
38  * vector is automatically cleared. The algorithm runs in O(nlgn) time.
39  */
40 TLP_SCOPE void convexHull (const std::vector<Coord> &points,
41  std::vector<unsigned int> &convexHull);
42 
43 
44 
45 }
46 #endif
47 ///@endcond