Bowyer/Watson algorithm: continue

by Yi Zhang

Here is Delaunay triangulation for one thousand random points, using Bowyer/Watson algorithm in my last post.

The second plot above comes up when the enlosing trianlge is erased from the first one, which usually leaves some concave spaces at the boundary, instead of convex hull shown in the third plot. It seems that the error of those random concaves diminshes as the number of random points arises, I am not sure whether one can use this fact to ignore those concaves in finite element method.

Before erasing enclosing triangle

After erasing enclosing triangle

Output of PlanarGraphPlot

Advertisements

Like this:

LikeLoading...

Related

2 Comments to “Bowyer/Watson algorithm: continue”

I’m having similar problems with my Bowyer-Watson algorithm. I’m trying to determine how to get the true convex hull, but I’m not coming up with anything. Have you researched more into this since your post?

Unfortunately I’m not working on this topic anymore, my area is about finite element. So I try not to reinvent the wheel after gaining some understanding in mesh generation techniques. Though I remember there is a convex hull generation command in mathematica, if that’s what you’re looking for.