| Approximating uniform triangular meshes in polygons,” Theor (2002) | |||||||||||||||
Abstract | |||||||||||||||
| Given a convex polygon P in the plane and a positive integer n, weconsider the problem of generating a length-uniform triangular mesh for the interior of P using n Steiner points. More specifically, we want to find both a set Sn of n points inside P, and a triangulation of P using Sn, with respect to the following | |||||||||||||||
Publication details | |||||||||||||||
| |||||||||||||||