#include "config.h"
#include <math.h>
#include <string.h>
#include "utils_core.h"
#include "geometry.h"
#include "yac_lapack_interface.h"
Go to the source code of this file.
|
static void | compute_middle_point (double(*restrict vertices)[3], size_t num_vertices, double *restrict middle_point) |
|
static double * | find_furthest_vertex (double(*restrict vertices)[3], size_t num_vertices, double *restrict middle_point) |
|
static void | compute_triangle (double *a, double *x_middle, double *x_t, double(*x_triangle)[3]) |
|
void | yac_compute_bnd_triangle (double *vertices, size_t num_vertices, double triangle[][3], size_t num_tests) |
|
◆ compute_middle_point()
static void compute_middle_point |
( |
double(*) |
vertices[3], |
|
|
size_t |
num_vertices, |
|
|
double *restrict |
middle_point |
|
) |
| |
|
inlinestatic |
◆ compute_triangle()
static void compute_triangle |
( |
double * |
a, |
|
|
double * |
x_middle, |
|
|
double * |
x_t, |
|
|
double(*) |
x_triangle[3] |
|
) |
| |
|
static |
◆ find_furthest_vertex()
static double * find_furthest_vertex |
( |
double(*) |
vertices[3], |
|
|
size_t |
num_vertices, |
|
|
double *restrict |
middle_point |
|
) |
| |
|
inlinestatic |
◆ yac_compute_bnd_triangle()
void yac_compute_bnd_triangle |
( |
double * |
vertices, |
|
|
size_t |
num_vertices, |
|
|
double |
triangle[][3], |
|
|
size_t |
num_tests |
|
) |
| |
computes a spherical triangle that contains all given vertices, the algorithm tries to minimise the size of the triangle
- Parameters
-
[in] | vertices | vertices that are supposed to be within the triangle |
[in] | num_vertices | number of vertices in vertices |
[out] | triangle | bounding triangle |
[in] | num_tests | with increasing number of tests computation time and chance of smaller bounding triangle increases |
Definition at line 99 of file bnd_triangle.c.