wolffd@0: /* $Id: geom.h,v 1.14 2009/06/03 01:10:52 ellson Exp $ $Revision: 1.14 $ */ wolffd@0: /* vim:set shiftwidth=4 ts=8: */ wolffd@0: wolffd@0: /********************************************************** wolffd@0: * This software is part of the graphviz package * wolffd@0: * http://www.graphviz.org/ * wolffd@0: * * wolffd@0: * Copyright (c) 1994-2004 AT&T Corp. * wolffd@0: * and is licensed under the * wolffd@0: * Common Public License, Version 1.0 * wolffd@0: * by AT&T Corp. * wolffd@0: * * wolffd@0: * Information and Software Systems Research * wolffd@0: * AT&T Research, Florham Park NJ * wolffd@0: **********************************************************/ wolffd@0: wolffd@0: /* geometric types and macros (e.g. points and boxes) with application to, but wolffd@0: * no specific dependance on graphs */ wolffd@0: wolffd@0: #ifndef GV_GEOM_H wolffd@0: #define GV_GEOM_H wolffd@0: wolffd@0: #ifdef HAVE_CONFIG_H wolffd@0: #include "arith.h" wolffd@0: #endif wolffd@0: wolffd@0: #ifdef __cplusplus wolffd@0: extern "C" { wolffd@0: #endif wolffd@0: wolffd@0: typedef struct { int x, y; } point; wolffd@0: wolffd@0: typedef struct pointf_s { double x, y; } pointf; wolffd@0: wolffd@0: /* tell pathplan/pathgeom.h */ wolffd@0: #define HAVE_POINTF_S wolffd@0: wolffd@0: typedef struct { point LL, UR; } box; wolffd@0: wolffd@0: typedef struct { pointf LL, UR; } boxf; wolffd@0: wolffd@0: #ifdef HAVE_CONFIG_H wolffd@0: wolffd@0: /* true if point p is inside box b */ wolffd@0: #define INSIDE(p,b) (BETWEEN((b).LL.x,(p).x,(b).UR.x) && BETWEEN((b).LL.y,(p).y,(b).UR.y)) wolffd@0: wolffd@0: /* true if boxes b0 and b1 overlap */ wolffd@0: #define OVERLAP(b0,b1) (((b0).UR.x >= (b1).LL.x) && ((b1).UR.x >= (b0).LL.x) && ((b0).UR.y >= (b1).LL.y) && ((b1).UR.y >= (b0).LL.y)) wolffd@0: wolffd@0: /* true if box b0 completely contains b1*/ wolffd@0: #define CONTAINS(b0,b1) (((b0).UR.x >= (b1).UR.x) && ((b0).UR.y >= (b1).UR.y) && ((b0).LL.x <= (b1).LL.x) && ((b0).LL.y <= (b1).LL.y)) wolffd@0: wolffd@0: /* expand box b as needed to enclose point p */ wolffd@0: #define EXPANDBP(b, p) ((b).LL.x = MIN((b).LL.x, (p).x), (b).LL.y = MIN((b).LL.y, (p).y), (b).UR.x = MAX((b).UR.x, (p).x), (b).UR.y = MAX((b).UR.y, (p).y)) wolffd@0: wolffd@0: /* expand box b0 as needed to enclose box b1 */ wolffd@0: #define EXPANDBB(b0, b1) ((b0).LL.x = MIN((b0).LL.x, (b1).LL.x), (b0).LL.y = MIN((b0).LL.y, (b1).LL.y), (b0).UR.x = MAX((b0).UR.x, (b1).UR.x), (b0).UR.y = MAX((b0).UR.y, (b1).UR.y)) wolffd@0: wolffd@0: /* clip box b0 to fit box b1 */ wolffd@0: #define CLIPBB(b0, b1) ((b0).LL.x = MAX((b0).LL.x, (b1).LL.x), (b0).LL.y = MAX((b0).LL.y, (b1).LL.y), (b0).UR.x = MIN((b0).UR.x, (b1).UR.x), (b0).UR.y = MIN((b0).UR.y, (b1).UR.y)) wolffd@0: wolffd@0: #define LEN2(a,b) (SQR(a) + SQR(b)) wolffd@0: #define LEN(a,b) (sqrt(LEN2((a),(b)))) wolffd@0: wolffd@0: #define DIST2(p,q) (LEN2(((p).x - (q).x),((p).y - (q).y))) wolffd@0: #define DIST(p,q) (sqrt(DIST2((p),(q)))) wolffd@0: wolffd@0: #define POINTS_PER_INCH 72 wolffd@0: #define POINTS_PER_PC ((double)POINTS_PER_INCH / 6) wolffd@0: #define POINTS_PER_CM ((double)POINTS_PER_INCH * 0.393700787) wolffd@0: #define POINTS_PER_MM ((double)POINTS_PER_INCH * 0.0393700787) wolffd@0: wolffd@0: #define POINTS(a_inches) (ROUND((a_inches)*POINTS_PER_INCH)) wolffd@0: #define PS2INCH(a_points) ((a_points)/(double)POINTS_PER_INCH) wolffd@0: wolffd@0: #define P2PF(p,pf) ((pf).x = (p).x,(pf).y = (p).y) wolffd@0: #define PF2P(pf,p) ((p).x = ROUND((pf).x),(p).y = ROUND((pf).y)) wolffd@0: wolffd@0: #define B2BF(b,bf) (P2PF((b).LL,(bf).LL),P2PF((b).UR,(bf).UR)) wolffd@0: #define BF2B(bf,b) (PF2P((bf).LL,(b).LL),PF2P((bf).UR,(b).UR)) wolffd@0: wolffd@0: #define APPROXEQ(a,b,tol) (ABS((a) - (b)) < (tol)) wolffd@0: #define APPROXEQPT(p,q,tol) (DIST2((p),(q)) < SQR(tol)) wolffd@0: wolffd@0: /* some common tolerance values */ wolffd@0: #define MILLIPOINT .001 wolffd@0: #define MICROPOINT .000001 wolffd@0: wolffd@0: #endif wolffd@0: wolffd@0: #ifdef __cplusplus wolffd@0: } wolffd@0: #endif wolffd@0: wolffd@0: #endif