furtherest_point.c File Reference

#include <cgraph/alloc.h>
#include <cgraph/list.h>
#include <cgraph/prisize_t.h>
#include <sparse/general.h>
#include <sparse/QuadTree.h>
#include <edgepaint/furtherest_point.h>
#include <stdbool.h>
#include <stddef.h>
#include <string.h>

Include dependency graph for furtherest_point.c:

Go to the source code of this file.

Functions
static double	dist (int dim, double *x, double *y)
static double	distance_to_group (int k, int dim, double *wgt, double *pts, double *center)
void	furtherest_point (int k, int dim, double *wgt, double *pts, double *center, double width, int max_level, double *dist_max, double **argmax)
void	furtherest_point_in_list (int k, int dim, double *wgt, double *pts, QuadTree qt, int max_level, double *dist_max, double **argmax)

Function Documentation

dist()

static double dist ( int  dim, double *  x, double *  y  )

static

Definition at line 21 of file furtherest_point.c.

Referenced by applyAttr(), applyAttr(), average_edge_length(), beautify_leaves(), bend(), bfs(), compute_stress1(), compute_stressf(), diffeq_model(), dijkstra(), dijkstra_f(), distance(), distance_cropped(), distance_to_group(), distvec(), doRep(), doRep(), embed_graph(), extractMax(), extractMax_f(), figColorResolve(), findClosestActiveNode(), get_edge_label_matrix(), get_stress(), heapify(), heapify_f(), improve_contiguity(), increaseKey(), increaseKey_f(), initHeap(), initHeap_f(), map_palette_optimal_coloring(), mapGraphs(), measure_distance(), Block::merge(), Block::merge(), Blocks::mergeLeft(), Blocks::mergeRight(), mkConstraintG(), mkNConstraintG(), pcp_rotate(), pick_object(), place_portlabel(), point_distance(), polylineMidpoint(), post(), QuadTree_get_nearest_internal(), QuadTree_get_supernodes_internal(), QuadTree_repulsive_force_interact(), set_leaves(), setdist(), sparse_stress_subspace_majorization_kD(), SparseStressMajorizationSmoother_new(), spring_electrical_embedding(), spring_electrical_embedding_fast(), spring_electrical_embedding_slow(), spring_electrical_spring_embedding(), StressMajorizationSmoother2_new(), StressMajorizationSmoother_smooth(), taper(), total_distance(), TriangleSmoother_new(), update_arrays(), and voronoi().

Here is the caller graph for this function:

distance_to_group()

static double distance_to_group ( int  k, int  dim, double *  wgt, double *  pts, double *  center  )

static

Definition at line 29 of file furtherest_point.c.

References center(), dist(), distance(), and MIN.

Referenced by furtherest_point(), and furtherest_point_in_list().

Here is the call graph for this function:

Here is the caller graph for this function:

furtherest_point()

void furtherest_point	(	int	k,
		int	dim,
		double *	wgt,
		double *	pts,
		double *	center,
		double	width,
		int	max_level,
		double *	dist_max,
		double **	argmax
	)

Definition at line 56 of file furtherest_point.c.

References QuadTree_struct::center, center(), QuadTree_struct::dim, distance(), distance_to_group(), gv_calloc(), MAX, PRISIZE_T, QuadTree_struct::qts, QuadTree_delete(), QuadTree_new(), QuadTree_new_in_quadrant(), QuadTree_struct::total_weight, Verbose, and QuadTree_struct::width.

Referenced by node_distinct_coloring_internal2().

Here is the call graph for this function:

Here is the caller graph for this function:

furtherest_point_in_list()

void furtherest_point_in_list	(	int	k,
		int	dim,
		double *	wgt,
		double *	pts,
		QuadTree	qt,
		int	max_level,
		double *	dist_max,
		double **	argmax
	)

Definition at line 156 of file furtherest_point.c.

References QuadTree_struct::average, QuadTree_struct::center, distance(), distance_to_group(), gv_calloc(), MAX, QuadTree_struct::n, PRISIZE_T, QuadTree_struct::qts, QuadTree_struct::total_weight, Verbose, and QuadTree_struct::width.

Referenced by node_distinct_coloring_internal2().

Here is the call graph for this function:

Here is the caller graph for this function: