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
|
/* $Id$ $Revision$ */
/* vim:set shiftwidth=4 ts=8: */
/*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors: See CVS logs. Details at http://www.graphviz.org/
*************************************************************************/
#ifndef QUAD_TREE_H
#define QUAD_TREE_H
#include "LinkedList.h"
/* #include "sfdpinternal.h" */
#include <stdio.h>
typedef struct QuadTree_struct *QuadTree;
struct QuadTree_struct {
/* a data structure containing coordinates of n items, their average is in "average".
The current level is a square or cube of width "width", which is subdivided into
2^dim QuadTrees qts. At the last level, all coordinates are stored in a single linked list l.
total_weight is the combined weights of the nodes */
int n;/* number of items */
real total_weight;
int dim;
real *center;/* center of the bounding box, array of dimension dim. Allocated inside */
real width;/* center +/- width gives the lower/upper bound, so really width is the
"radius" */
real *average;/* the average coordinates. Array of length dim. Allocated inside */
QuadTree *qts;/* subtree . If dim = 2, there are 4, dim = 3 gives 8 */
SingleLinkedList l;
int max_level;
void *data;
};
QuadTree QuadTree_new(int dim, real *center, real width, int max_level);
void QuadTree_delete(QuadTree q);
QuadTree QuadTree_add(QuadTree q, real *coord, real weight, int id);/* coord is copied in */
void QuadTree_print(FILE *fp, QuadTree q);
QuadTree QuadTree_new_from_point_list(int dim, int n, int max_level, real *coord, real *weight);
real point_distance(real *p1, real *p2, int dim);
void QuadTree_get_supernodes(QuadTree qt, real bh, real *point, int nodeid, int *nsuper,
int *nsupermax, real **center, real **supernode_wgts, real **distances, real *counts, int *flag);
void QuadTree_get_repulsive_force(QuadTree qt, real *force, real *x, real bh, real p, real KP, real *counts, int *flag);
/* find the nearest point and put in ymin, index in imin and distance in min */
void QuadTree_get_nearest(QuadTree qt, real *x, real *ymin, int *imin, real *min, int *flag);
QuadTree QuadTree_new_in_quadrant(int dim, real *center, real width, int max_level, int i);
#endif
|
