Constrained Triangulation

Baolin Yang / Applied Mathematics


Constrained triangulation is the triangulation of a set S of N points and a set E of M non- intersecting edges on S (the constraints), which must appear in the triangulation. Our objective is to efficiently regularize and then decompose the sets into simpler polygonal regions which can be easily triangulated. Then we use the chain method in the triangulation of the simple polygons. For more detail of the algorithms, please see the documentation . There are also some relevant references .

Project Demonstration

If you have any suggestion, please contact me:

Baolin Yang Box F Brown University Providence RI 02912 E-mail: Phone: (401) 863-3878 (work) (401) 453-0772 (home)

Back to the My Home Page