I'm clueless how to put this into code.. Could someone please give me a headstart, I am willing to pay for it that's how bad I need this, I know that is not the purpose of this forum, but it's urgent..

I'm clueless how to put this into code.. Could someone please give me a headstart, I am willing to pay for it that's how bad I need this, I know that is not the purpose of this forum, but it's urgent..

create a simplex of d + 1 points

for each facet F

for each unassigned point p

if p is above F

assign p to F's outside set

for each facet F with a non-empty outside set

select the furthest point p of F's outside set

initialize the visible set V to F

for all unvisited neighbors N of facets in V

if p is above N

add N to V

the boundary of V is the set of horizon ridges H

for each ridge R in H

create a new facet from R and p

link the new facet to its neighbors

for each new facet F'

for each unassigned point q in an outside set of a facet in V

if q is above F'

assign q to F's outside set

delete the facets in V