67 lines
1.7 KiB
C
67 lines
1.7 KiB
C
/* SPDX-License-Identifier: GPL-2.0-or-later
|
|
* Copyright 2012 Blender Foundation. All rights reserved. */
|
|
|
|
#pragma once
|
|
|
|
struct ListBase;
|
|
|
|
/** \file
|
|
* \ingroup bli
|
|
*/
|
|
|
|
#ifdef __cplusplus
|
|
extern "C" {
|
|
#endif
|
|
|
|
typedef struct VoronoiSite {
|
|
float co[2];
|
|
float color[3];
|
|
} VoronoiSite;
|
|
|
|
typedef struct VoronoiEdge {
|
|
struct VoronoiEdge *next, *prev;
|
|
|
|
/* start and end points */
|
|
float start[2], end[2];
|
|
|
|
/* this fields are used during diagram computation only */
|
|
|
|
/* directional vector, from "start", points to "end", normal of |left, right| */
|
|
float direction[2];
|
|
|
|
/* point on Voronoi place on the left side of edge */
|
|
float left[2];
|
|
/* point on Voronoi place on the right side of edge */
|
|
float right[2];
|
|
|
|
/* Directional coefficients satisfying equation `y = f * x + g` (edge lies on this line). */
|
|
float f, g;
|
|
|
|
/* some edges consist of two parts,
|
|
* so we add the pointer to another part to connect them at the end of an algorithm */
|
|
struct VoronoiEdge *neighbor;
|
|
} VoronoiEdge;
|
|
|
|
typedef struct VoronoiTriangulationPoint {
|
|
float co[2];
|
|
float color[3];
|
|
int power;
|
|
} VoronoiTriangulationPoint;
|
|
|
|
void BLI_voronoi_compute(
|
|
const VoronoiSite *sites, int sites_total, int width, int height, struct ListBase *edges);
|
|
|
|
void BLI_voronoi_triangulate(const VoronoiSite *sites,
|
|
int sites_total,
|
|
struct ListBase *edges,
|
|
int width,
|
|
int height,
|
|
VoronoiTriangulationPoint **r_triangulated_points,
|
|
int *r_triangulated_points_total,
|
|
int (**r_triangles)[3],
|
|
int *r_triangles_total);
|
|
|
|
#ifdef __cplusplus
|
|
}
|
|
#endif
|