/usr/include/tulip/ConvexHull.h is in libtulip-dev 4.8.0dfsg-2build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 | /*
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux
*
* Tulip is free software; 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, either version 3
* of the License, or (at your option) any later version.
*
* Tulip is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
* See the GNU General Public License for more details.
*
*/
#ifndef TLP_GEO_CONVEX_HULL_H
#define TLP_GEO_CONVEX_HULL_H
#include <vector>
#include <tulip/Coord.h>
namespace tlp {
/**
* \brief function for computing a 2D convex hull
*
* Computes a 2D convex hull using the Qhull library (www.qhull.org)
*
* Computes the 2D convex hull and returns a list of indexes for the
* points on the convex hull in counterclockwise order.
*
* The convexHull vector is automatically cleared.
*
*/
TLP_SCOPE void convexHull(const std::vector<Coord> &points,
std::vector<unsigned int> &convexHull);
/**
* \brief function for computing a 2D/3D convex hull
*
* Computes a 2D/3D convex hull using the Qhull library (www.qhull.org)
*
* Computes a 2D/3D convex hull and returns a list of the hull facets (segments for 2D, triangles for 3D)
* and a list of neighbors facets for each facet. A facet is defined by a list of indexes in the points vector.
* The neighbors facets of a facet are defined by a list of indexes in the convexHullFacets vector
* (facetNeighbors[i] stores the neighbors of facet convexHullFacets[i]).
*
* The convexHullFacets and facetNeighbors vectors are automatically cleared.
*/
TLP_SCOPE void convexHull(const std::vector<Coord> &points,
std::vector<std::vector<unsigned int> > &convexHullFacets,
std::vector<std::vector<unsigned int> > &facetNeighbors);
/*@}*/
}
#endif
|