From cca66b9ec4e494c1d919bff0f71a820d8afab1fa Mon Sep 17 00:00:00 2001 From: Daniel Baumann Date: Sun, 7 Apr 2024 20:24:48 +0200 Subject: Adding upstream version 1.2.2. Signed-off-by: Daniel Baumann --- src/3rdparty/adaptagrams/libavoid/geometry.h | 129 +++++++++++++++++++++++++++ 1 file changed, 129 insertions(+) create mode 100644 src/3rdparty/adaptagrams/libavoid/geometry.h (limited to 'src/3rdparty/adaptagrams/libavoid/geometry.h') diff --git a/src/3rdparty/adaptagrams/libavoid/geometry.h b/src/3rdparty/adaptagrams/libavoid/geometry.h new file mode 100644 index 0000000..47f1199 --- /dev/null +++ b/src/3rdparty/adaptagrams/libavoid/geometry.h @@ -0,0 +1,129 @@ +/* + * vim: ts=4 sw=4 et tw=0 wm=0 + * + * libavoid - Fast, Incremental, Object-avoiding Line Router + * + * Copyright (C) 2004-2011 Monash University + * + * -------------------------------------------------------------------- + * Much of the code in this module is based on code published with + * and/or described in "Computational Geometry in C" (Second Edition), + * Copyright (C) 1998 Joseph O'Rourke + * -------------------------------------------------------------------- + * The segmentIntersectPoint function is based on code published and + * described in Franklin Antonio, Faster Line Segment Intersection, + * Graphics Gems III, p. 199-202, code: p. 500-501. + * -------------------------------------------------------------------- + * + * This library 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 2.1 of the License, or (at your option) any later version. + * See the file LICENSE.LGPL distributed with the library. + * + * Licensees holding a valid commercial license may use this file in + * accordance with the commercial license agreement provided with the + * library. + * + * This library 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. + * + * Author(s): Michael Wybrow +*/ + + +#ifndef AVOID_GEOMETRY_H +#define AVOID_GEOMETRY_H + +#include "libavoid/geomtypes.h" +#include "libavoid/assertions.h" + +namespace Avoid { + + +extern double euclideanDist(const Point& a, const Point& b); +extern double manhattanDist(const Point& a, const Point& b); +extern double totalLength(const Polygon& poly); +extern double angle(const Point& a, const Point& b, const Point& c); +extern bool segmentIntersect(const Point& a, const Point& b, + const Point& c, const Point& d); +extern bool segmentShapeIntersect(const Point& e1, const Point& e2, + const Point& s1, const Point& s2, bool& seenIntersectionAtEndpoint); +extern bool inPoly(const Polygon& poly, const Point& q, bool countBorder = true); +extern bool inPolyGen(const PolygonInterface& poly, const Point& q); +extern bool inValidRegion(bool IgnoreRegions, const Point& a0, + const Point& a1, const Point& a2, const Point& b); +extern int cornerSide(const Point &c1, const Point &c2, const Point &c3, + const Point& p); +extern bool pointOnLine(const Point& a, const Point& b, const Point& c, + const double tolerance = 0.0); +extern bool colinear(const Point& a, const Point& b, const Point& c, + const double tolerance = 0.0); +// To be used only when the points are known to be colinear. +extern bool inBetween(const Point& a, const Point& b, const Point& c); + + +// Direction from vector. +// Looks at the position of point c from the directed segment ab and +// returns the following: +// 1 counterclockwise +// 0 collinear +// -1 clockwise +// +// Based on the code of 'AreaSign'. +// +// The 'maybeZero' argument can be used to adjust the tolerance of the +// function. It will be most accurate when 'maybeZero' == 0.0, the default. +// +static inline int vecDir(const Point& a, const Point& b, const Point& c, + const double maybeZero = 0.0) +{ + COLA_ASSERT(maybeZero >= 0); + + double area2 = ((b.x - a.x) * (c.y - a.y)) - + ((c.x - a.x) * (b.y - a.y)); + + if (area2 < (-maybeZero)) + { + return -1; + } + else if (area2 > maybeZero) + { + return 1; + } + return 0; +} + +// Finds the projection point of (a,b) onto (a,c) +static inline Point projection(const Point& a, const Point& b, const Point& c) +{ + double ux = c.x - a.x, + uy = c.y - a.y, + vx = b.x - a.x, + vy = b.y - a.y, + scalarProj = ux * vx + uy * vy; + scalarProj /= ux * ux + uy * uy; + Point p; + p.x = scalarProj * ux + a.x; + p.y = scalarProj * uy + a.y; + return p; +} + +// Line Segment Intersection +// Original code by Franklin Antonio +// +static const int DONT_INTERSECT = 0; +static const int DO_INTERSECT = 1; +static const int PARALLEL = 3; +extern int segmentIntersectPoint(const Point& a1, const Point& a2, + const Point& b1, const Point& b2, double *x, double *y); +extern int rayIntersectPoint(const Point& a1, const Point& a2, + const Point& b1, const Point& b2, double *x, double *y); +extern double rotationalAngle(const Point& p); + + +} + + +#endif -- cgit v1.2.3