c - Voronoi diagram bound by circular tour -

c - Voronoi diagram bound by circular tour -

i'm facing next problem: i'm given point cloud p , subset of point cloud b. nodes b in b constitute boundary of (whole) point cloud p. (in fact, b given closed, oriented circular tour). now, compute voronoi diagram of p, intersected b, , extract area of each (intersected) voronoi polygon. here illustration of situation: intersect bluish polygons greenish segments. questions:

is there, chance, c library solves exact problem? if not, there improve way solve problem computing voronoi diagram using library, explicitly intersecting (green) segments polygons library output? maybe exploiting constrained delaunay triangulation?

ps: know feat possible using cgal. however, having never used cgal, cgal seems quite complex , adapting illustration code such this seems far straight forward. also, prefer solution in c.

so decided go against alpha shapes since know exact boundary , not want fine tune alpha value avoid holes in interior. instead, used ante's comment come implementation in cgal. if interested, can found here. utilize of cgal clumsy , 1 can tell i'm coming c world, it's start. test input can found here (in.txt) , here (bnd_ind.txt). visualization of output (highlighted cutting faces @ boundary) :

c computational-geometry voronoi