2 * SGI FREE SOFTWARE LICENSE B (Version 2.0, Sept. 18, 2008)
3 * Copyright (C) 1991-2000 Silicon Graphics, Inc. All Rights Reserved.
5 * Permission is hereby granted, free of charge, to any person obtaining a
6 * copy of this software and associated documentation files (the "Software"),
7 * to deal in the Software without restriction, including without limitation
8 * the rights to use, copy, modify, merge, publish, distribute, sublicense,
9 * and/or sell copies of the Software, and to permit persons to whom the
10 * Software is furnished to do so, subject to the following conditions:
12 * The above copyright notice including the dates of first publication and
13 * either this permission notice or a reference to
14 * http://oss.sgi.com/projects/FreeB/
15 * shall be included in all copies or substantial portions of the Software.
17 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
18 * OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
19 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
20 * SILICON GRAPHICS, INC. BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
21 * WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF
22 * OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
25 * Except as contained in this notice, the name of Silicon Graphics, Inc.
26 * shall not be used in advertising or otherwise to promote the sale, use or
27 * other dealings in this Software without prior written authorization from
28 * Silicon Graphics, Inc.
36 #include "definitions.h"
37 #include "directedLine.h"
38 #include "monoTriangulation.h"
40 Int
DBG_edgesIntersectGen(Real A
[2], Real B
[2], Real C
[2], Real D
[2]);
41 Int
DBG_intersectChain(vertexArray
* chain
, Int start
, Int end
, Real A
[2], Real B
[2]);
44 Int
DBG_edgesIntersect(directedLine
* l1
, directedLine
* l2
);
45 Int
DBG_polygonSelfIntersect(directedLine
* poly
);
46 Int
DBG_edgeIntersectPoly(directedLine
* edge
, directedLine
* poly
);
47 Int
DBG_polygonsIntersect(directedLine
* p1
, directedLine
* p2
);
48 Int
DBG_polygonListIntersect(directedLine
* pList
);
50 Int
DBG_isCounterclockwise(directedLine
* poly
);
51 Int
DBG_rayIntersectEdge(Real v0
[2], Real dx
, Real dy
, Real v10
[2], Real v1
[2], Real v2
[2]);
52 Int
DBG_pointInsidePoly(Real v
[2], directedLine
* poly
);
53 Int
DBG_enclosingPolygons(directedLine
* poly
, directedLine
* list
);
54 void DBG_reverse(directedLine
* poly
);
55 Int
DBG_check(directedLine
*polyList
);
57 Int
DBG_isConvex(directedLine
*poly
);
58 Int
DBG_is_U_direction(directedLine
*poly
);
59 Int
DBG_is_U_monotone(directedLine
* poly
);
61 directedLine
* DBG_cutIntersectionAllPoly(directedLine
* list
);
62 directedLine
* DBG_cutIntersectionPoly(directedLine
*polygon
, int& cutOccur
);
64 sampledLine
* DBG_collectSampledLinesAllPoly(directedLine
*polygonList
);
66 void DBG_collectSampledLinesPoly(directedLine
*polygon
, sampledLine
*& retHead
, sampledLine
*& retTail
);