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
|
/* $Id: simple.h,v 1.1.1.1 2004/12/23 04:05:16 ellson Exp $ $Revision: 1.1.1.1 $ */
/* vim:set shiftwidth=4 ts=8: */
/**********************************************************
* This software is part of the graphviz package *
* http://www.graphviz.org/ *
* *
* Copyright (c) 1994-2004 AT&T Corp. *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Corp. *
* *
* Information and Software Systems Research *
* AT&T Research, Florham Park NJ *
**********************************************************/
#ifdef __cplusplus
extern "C" {
#endif
#include <stdio.h>
#include "pathplan.h"
#define MAXINTS 10000 /* modify this line to reflect the max no. of
intersections you want reported -- 50000 seems to break the program */
#define SLOPE(p,q) ( ( ( p.y ) - ( q.y ) ) / ( ( p.x ) - ( q.x ) ) )
#define after(v) (((v)==((v)->poly->finish))?((v)->poly->start):((v)+1))
#define prior(v) (((v)==((v)->poly->start))?((v)->poly->finish):((v)-1))
struct position {
double x, y;
};
struct vertex {
struct position pos;
struct polygon *poly;
struct active_edge *active;
};
struct polygon {
struct vertex *start, *finish;
};
struct intersection {
struct vertex *firstv, *secondv;
struct polygon *firstp, *secondp;
double x, y;
};
struct active_edge {
struct vertex *name;
struct active_edge *next, *last;
};
struct active_edge_list {
struct active_edge *first, *final;
int number;
};
struct data {
int nvertices, npolygons, ninters;
};
#ifdef __cplusplus
}
#endif
|
