Alpha shapes from weighted Delaunay Triangulation

Question

I am looking for an algorithm to solve alpha shapes from weighted delaunay triangulation (assuming we have weighted DT) in 2D and 3D. I've looked at a few online links that provide complicated explanations. It'll be great if i can get pseudo code of the algorithm with good explanation.

Answer 1

Alpha shapes is alpha value and every edges exceeding alpha. Hence you can remove those edges. I don't think it needs dt. a weighted dt.

Answer 2

You can try to use CGAL that provides both 3D and 2D weighted alpha-shapes.

Examples in 3D are available here and here . The 2D case is similar.