For a series of scattered points with reasonably well defined voids (eg a large cone with a circular apex, finely meshed at the apex, and loosely elsewhere) I am trying to find the constrained triangulation.

It was pointed out to me in the previous post (below) that the new triangulation tools in matlab are better suited to this situation, so I've been trying to work within that framework (2009b currently). I can triangulate the mesh (with no constraints), and use triscatteredinterp to plot, with a reasonable accuracy (it doesn't do as badly on the interior/edge of the original holes as the old griddata for example).

Can we do better though?

What I can't figure out how to do is take this scattered cloud of points and find the constrained region, then do the mesh. I do NOT have access to the exact boundary points off the bat, it needs to be determined dynamically if possible. The demo examples given are not quite getting me there I'm afraid.

Suggestions, thoughts?

Thanks

Shawn

original thread

http://www.yqcomputer.com/ #705346

"Empty areas" can be detected in a Delaunay triangulation because they have triangle with greater circumcenter.

http://www.yqcomputer.com/

1. How can I get optimal element quality with constrained Delaunay triangulation?

2. About 3D Constrained Delaunay Triangulation: is there any existed open-source code I can use?

3. Constrained 3D Delaunay Triangulation

4. Any way to 'sort' boundary nodes after delaunay triangulation ?

5. 2D Delaunay Triangulation Query

7. Deleting point in Delaunay triangulation

8. how to use delaunay perfomance the all triangulations?

9. Navigating a Delaunay triangulation

10. add-remove edges in a delaunay triangulation

11. Spherical map; Delaunay Triangulation

12. size of Delaunay triangulation in 3 dimensions?

13. Simple 2D Delaunay Triangulation

14. Can randomized Delaunay triangulation take quadratic time?

15. Delaunay triangulation part of sphere

2 post • Page:**1** of **1**