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
60
61
62
63
64
65
66
67
68
|
/**
*
* This file is part of Tulip (www.tulip-software.org)
*
* Authors: David Auber and the Tulip development Team
* from LaBRI, University of Bordeaux 1 and Inria Bordeaux - Sud Ouest
*
* 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.
*
*/
%ModuleHeaderCode
#include <tulip/ConvexHull.h>
%End
namespace tlp {
void convexHull(const std::vector<tlp::Coord> &points,
std::vector<unsigned int> &convexHull /Out/) /PyName=convexHull2D/;
%Docstring
tlp.convexHull2D(points)
.. versionadded:: 4.2
Computes the 2D convex hull of a list of points (the z-coordinate is not taken into acccount)
using the Qhull_ library.
Returns a list of indexes in the list of points defining the hull polygon in counterclockwise order.
:param points: the points on which to compute the 2D convex hull
:type points: list of :class:`tlp.Coord`
:rtype: list of integers
.. _Qhull: http://www.qhull.org
%End
void convexHull(const std::vector<tlp::Coord> &points,
std::vector<vectorUint> &convexHullFacets /Out/,
std::vector<vectorUint> &facetNeighbors /Out/);
%Docstring
tlp.convexHull(points)
.. versionadded:: 4.2
Computes the 2D/3D convex hull of a list of points using the Qhull_ library.
Returns a tuple whose first member is the list of facets defining the
convex hull (segments for 2D, triangles for 3D) and second member is the list
of neighbors facets for each facet. A facet is defined by a list of indexes
in the list of points. The ith element of the neighbors list is a list
of indexes in the facets list corresponding to the neighbors facets of the ith facet.
:param points: the points on which to compute the 2D/3D convex hull
:type points: list of :class:`tlp.Coord`
:rtype: (list of list of integers, list of list of integers)
.. _Qhull: http://www.qhull.org
%End
};
|
