-
Notifications
You must be signed in to change notification settings - Fork 147
/
_convex.cpp
115 lines (102 loc) · 2.52 KB
/
_convex.cpp
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
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
// Copyright (C) 2008-2012 Luis Pedro Coelho <luis@luispedro.org>
//
// License: MIT (see COPYING file)
#include <algorithm>
#include <vector>
#include "numpypp/array.hpp"
#include "utils.hpp"
extern "C" {
#include <Python.h>
#include <numpy/ndarrayobject.h>
}
namespace {
struct Point {
Point(int y_, int x_):y(y_), x(x_) { }
long y, x;
};
inline
bool forward_cmp(const Point& a, const Point& b) {
if (a.y == b.y) return a.x < b.x;
return a.y < b.y;
}
inline
bool reverse_cmp(const Point& a, const Point& b) {
if (a.y == b.y) return a.x > b.x;
return a.y > b.y;
}
inline
double isLeft(Point p0, Point p1, Point p2) {
return (p1.y-p0.y)*(p2.x-p0.x) - (p2.y-p0.y)*(p1.x-p0.x);
}
unsigned inPlaceScan(Point* P, unsigned N, bool reverse) {
if (reverse) {
std::sort(P, P+N, reverse_cmp);
} else {
std::sort(P, P+N, forward_cmp);
}
int h = 1;
for (int i = 1; i != int(N); ++i) {
while (h >= 2 && isLeft(P[h-2],P[h-1],P[i]) >= 0) {
--h;
}
std::swap(P[h],P[i]);
++h;
}
return h;
}
unsigned inPlaceGraham(std::vector<Point>& Pv) {
const int N = Pv.size();
if (N <= 3) return N;
Point* P = &Pv[0];
int h = inPlaceScan(P,N,false);
for (int i = 0; i != h - 1; ++i) {
std::swap(P[i],P[i+1]);
}
int h_=inPlaceScan(P+h-2,N-h+2,true);
return h + h_ - 2;
}
PyObject*
convexhull(PyObject* self, PyObject* args) {
PyArrayObject* array;
if (!PyArg_ParseTuple(args,"O", &array) ||
!PyArray_ISCARRAY(array) ||
!PyArray_EquivTypenums(PyArray_TYPE(array), NPY_BOOL)) return 0;
holdref r(array);
unsigned h;
std::vector<Point> Pv;
try { // Release GIL
gil_release nogil;
numpy::aligned_array<bool> barray(array);
const int N0 = barray.dim(0);
const int N1 = barray.dim(1);
for (int y = 0; y != N0; ++y) {
for (int x = 0; x != N1; ++x) {
if (barray.at(y,x)) Pv.push_back(Point(y,x));
}
}
h = inPlaceGraham(Pv);
} catch (const std::bad_alloc&) {
PyErr_NoMemory();
return NULL;
}
npy_intp dims[2];
dims[0] = h;
dims[1] = 2;
PyObject* output = PyArray_SimpleNew(2, dims, NPY_INTP);
if (!output) {
PyErr_NoMemory();
return 0;
}
npy_intp* oiter = static_cast<npy_intp*>(PyArray_DATA(output));
for (unsigned i = 0; i != h; ++i) {
*oiter++ = Pv[i].y;
*oiter++ = Pv[i].x;
}
return output;
}
}
PyMethodDef methods[] = {
{"convexhull", convexhull, METH_VARARGS , "compute convex hull"},
{NULL, NULL,0,NULL},
};
DECLARE_MODULE(_convex)