1
/* Libart_LGPL - library of basic graphic primitives
2
* Copyright (C) 1999 Raph Levien
4
* This library is free software; you can redistribute it and/or
5
* modify it under the terms of the GNU Library General Public
6
* License as published by the Free Software Foundation; either
7
* version 3 of the License, or (at your option) any later version.
9
* This library is distributed in the hope that it will be useful,
10
* but WITHOUT ANY WARRANTY; without even the implied warranty of
11
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12
* Library General Public License for more details.
14
* You should have received a copy of the GNU Library General Public
15
* License along with this library; if not, see <http://www.gnu.org/licenses/>.
16
* Boston, MA 02111-1307, USA.
20
#include "art_svp_point.h"
27
/* Determine whether a point is inside, or near, an svp. */
29
/* return winding number of point wrt svp */
31
* art_svp_point_wind: Determine winding number of a point with respect to svp.
33
* @x: The X coordinate of the point.
34
* @y: The Y coordinate of the point.
36
* Determine the winding number of the point @x, @y with respect to @svp.
38
* Return value: the winding number.
41
art_svp_point_wind (ArtSVP *svp, double x, double y)
46
for (i = 0; i < svp->n_segs; i++)
48
ArtSVPSeg *seg = &svp->segs[i];
56
wind += seg->dir ? 1 : -1;
57
else if (seg->bbox.x0 <= x)
59
double x0, y0, x1, y1, dx, dy;
61
for (j = 0; j < seg->n_points - 1; j++)
63
if (seg->points[j + 1].y > y)
66
x0 = seg->points[j].x;
67
y0 = seg->points[j].y;
68
x1 = seg->points[j + 1].x;
69
y1 = seg->points[j + 1].y;
73
if ((x - x0) * dy > (y - y0) * dx)
74
wind += seg->dir ? 1 : -1;
83
* art_svp_point_dist: Determine distance between point and svp.
85
* @x: The X coordinate of the point.
86
* @y: The Y coordinate of the point.
88
* Determines the distance of the point @x, @y to the closest edge in
89
* @svp. A large number is returned if @svp is empty.
91
* Return value: the distance.
94
art_svp_point_dist (ArtSVP *svp, double x, double y)
100
for (i = 0; i < svp->n_segs; i++)
102
ArtSVPSeg *seg = &svp->segs[i];
103
for (j = 0; j < seg->n_points - 1; j++)
105
double x0 = seg->points[j].x;
106
double y0 = seg->points[j].y;
107
double x1 = seg->points[j + 1].x;
108
double y1 = seg->points[j + 1].y;
113
double dxx0 = x - x0;
114
double dyy0 = y - y0;
116
double dot = dxx0 * dx + dyy0 * dy;
119
dist_sq = dxx0 * dxx0 + dyy0 * dyy0;
122
double rr = dx * dx + dy * dy;
125
dist_sq = (x - x1) * (x - x1) + (y - y1) * (y - y1);
128
double perp = (y - y0) * dx - (x - x0) * dy;
130
dist_sq = perp * perp / rr;
133
if (best_sq < 0 || dist_sq < best_sq)
139
return sqrt (best_sq);