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
70
71
72
|
/* $Id: util.c,v 1.3 2004/12/11 19:26:11 ellson Exp $ $Revision: 1.3 $ */
/* 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 *
**********************************************************/
#include <assert.h>
#include <pathutil.h>
#include <stdlib.h>
#ifdef DMALLOC
#include "dmalloc.h"
#endif
Ppoly_t copypoly(Ppoly_t argpoly)
{
Ppoly_t rv;
int i;
rv.pn = argpoly.pn;
rv.ps = malloc(sizeof(Ppoint_t) * argpoly.pn);
for (i = 0; i < argpoly.pn; i++)
rv.ps[i] = argpoly.ps[i];
return rv;
}
void freepoly(Ppoly_t argpoly)
{
free(argpoly.ps);
}
int Ppolybarriers(Ppoly_t ** polys, int npolys, Pedge_t ** barriers,
int *n_barriers)
{
Ppoly_t pp;
int i, j, k, n, b;
Pedge_t *bar;
n = 0;
for (i = 0; i < npolys; i++)
n = n + polys[i]->pn;
bar = malloc(n * sizeof(Pedge_t));
b = 0;
for (i = 0; i < npolys; i++) {
pp = *polys[i];
for (j = 0; j < pp.pn; j++) {
k = j + 1;
if (k >= pp.pn)
k = 0;
bar[b].a = pp.ps[j];
bar[b].b = pp.ps[k];
b++;
}
}
assert(b == n);
*barriers = bar;
*n_barriers = n;
return 1;
}
|
