GRASS GIS 8 Programmer's Manual
8.5.0dev(2024)-66aae0a5a0
|
#include <stdio.h>
#include <stdlib.h>
#include <grass/dataquad.h>
Go to the source code of this file.
Functions | |
struct triple * | quad_point_new (double x, double y, double z, double sm) |
struct quaddata * | quad_data_new (double x_or, double y_or, double xmax, double ymax, int rows, int cols, int n_points, int kmax) |
int | quad_compare (struct triple *point, struct quaddata *data) |
int | quad_add_data (struct triple *point, struct quaddata *data, double dmin) |
int | quad_intersect (struct quaddata *data_inter, struct quaddata *data) |
int | quad_division_check (struct quaddata *data, int kmax) |
struct quaddata ** | quad_divide_data (struct quaddata *data, int kmax, double dmin) |
int | quad_get_points (struct quaddata *data_inter, struct quaddata *data, int MAX) |
Add point to a given data.
Definition at line 139 of file dataquad.c.
Return the quadrant the point should be inserted in
Definition at line 95 of file dataquad.c.
struct quaddata* quad_data_new | ( | double | x_or, |
double | y_or, | ||
double | xmax, | ||
double | ymax, | ||
int | rows, | ||
int | cols, | ||
int | n_points, | ||
int | kmax | ||
) |
Initialize quaddata structure with given arguments
This is a constructor of the quaddata structure and it allocates memory. It also creates (and allocates memory for) the given number of points (given by kmax). The point attributes are set to zero.
Definition at line 59 of file dataquad.c.
Divide data into four new ones
Divides data into 4 new data reinserting data->points
in them by calling data function quad_compare()
to determine were to insert. Returns array of 4 new data (allocates memory).
Definition at line 226 of file dataquad.c.
int quad_division_check | ( | struct quaddata * | data, |
int | kmax | ||
) |
Check if data needs to be divided
Checks if data needs to be divided. If data->points
is empty, returns -1; if its not empty but there aren't enough points in data for division returns 0. Otherwise (if its not empty and there are too many points) returns 1.
Definition at line 209 of file dataquad.c.
Gets such points from data that lie within region determined by data_inter. Called by tree function region_data()
.
Definition at line 305 of file dataquad.c.
Check intersection of two quaddata structures
Checks if region defined by data intersects the region defined by data_inter.
Definition at line 176 of file dataquad.c.
struct triple* quad_point_new | ( | double | x, |
double | y, | ||
double | z, | ||
double | sm | ||
) |
Initialize point structure with given arguments
This is a constructor of the point structure and it allocates memory.
Definition at line 36 of file dataquad.c.
References malloc(), NULL, triple::sm, x, triple::x, triple::y, and triple::z.