File: InsidePolygonWithBounds.h

package info (click to toggle)
pymca 5.1.3%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: stretch
  • size: 40,004 kB
  • ctags: 17,800
  • sloc: python: 132,302; ansic: 20,016; cpp: 827; makefile: 48; sh: 30; xml: 24
file content (71 lines) | stat: -rw-r--r-- 2,720 bytes parent folder | download | duplicates (6)
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
/* Source http://paulbourke.net/geometry/polygonmesh/
 with contribution by Alexander Motrichuk: InsidePolygonWithBounds.cpp
 to deal with points exactly on a vertex 
 Any source code found in the previous site may be freely used provided 
 credits are given to the author. Credits follow:
 */
#/*##########################################################################
#
# Copyright Paul Bourke
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
# THE SOFTWARE.
#
#############################################################################*/

/* SOLUTION #1 (2D) */
#define MIN(x,y) (x < y ? x : y)
#define MAX(x,y) (x > y ? x : y)
#define INSIDE 1
#define OUTSIDE 0

typedef struct {
   double x,y;
} Point;

typedef struct {
   float x,y;
} PointF;

typedef struct {
   int x,y;
} PointInt;


unsigned char _InsidePolygonF(Point *polygon, int N,\
                              PointF p, unsigned char bound_value);

void PointsInsidePolygonF(double *polygon_xy, int N_xy, \
                         float *points_xy, int N_points_xy,
                         int border_value, unsigned char *output);

unsigned char _InsidePolygonInt(Point *polygon, int N,\
                              PointInt p, unsigned char bound_value);

void PointsInsidePolygonInt(double *polygon_xy, int N_xy, \
                         int *points_xy, int N_points_xy,
                         int border_value, unsigned char *output);


unsigned char _InsidePolygon(Point *polygon, int N,\
                              Point p, unsigned char bound_value);

void PointsInsidePolygon(double *polygon_xy, int N_xy, \
                         double *points_xy, int N_points_xy,
                         int border_value, unsigned char *output);