#include <gandalf/common/bit_array.h>
Go to the source code of this file.
Functions | |
Gan_Bool | gan_modified_fht2D (double *x, double *y, int *weight, int no_points, double m_range, double c_range, double c_root, int max_level, int T_thres, Gan_MemoryStack *memory_stack, double *m_best, double *c_best, int *level_best, int *accum_best, Gan_BitArray *list_best) |
General purpose FHT line finder function. |
Part of: Gandalf Library
Revision: Last edited: Author:
Copyright: (c) 2000 Imagineer Software Limited
|
General purpose FHT line finder function.
![]()
where ![]()
in ![]()
and subdivides into 2x2 "child" hypercubes, checking each child to see whether enough This is a depth-first version of the FHT, i.e. the child hypercubes are subdivided exhaustively before trying another child. This minimises memory requirement by limiting it to ![]()
|