1/*************************************************************************
2 * Copyright (c) 2011 AT&T Intellectual Property
3 * All rights reserved. This program and the accompanying materials
4 * are made available under the terms of the Eclipse Public License v1.0
5 * which accompanies this distribution, and is available at
6 * http://www.eclipse.org/legal/epl-v10.html
7 *
8 * Contributors: See CVS logs. Details at http://www.graphviz.org/
9 *************************************************************************/
10
11#ifndef INK_H
12#define INK_H
13
14#include <edge_bundling.h>
15
16typedef struct {
17 double x, y;
18} point_t;
19
20/* given a list of edges, find the best ink bundling by making them meet at 2 points
21 \ /
22 -meet1 ---------- meet2 -
23 / \
24 edges: list of edges
25 numEdges: number of edges
26 pick: if not NULL, consider edges pick[0], pick[1], ..., pick[numedges-1],
27 . othetwise consider edges 0, 1, ..., numEdge-1
28 ink0: ink needed if no bundling
29 meet1, meet2: meeting point
30 return: best ink needed if bundled.
31*/
32double ink(pedge* edges, int numEdges, int *pick, double *ink0, point_t *meet1, point_t *meet2, real angle_param, real angle);
33double ink1(pedge e);
34
35extern double ink_count;
36
37#endif /* INK_H */
38