On Computing and Drawing Maxmin-Height Covering Triangulation
Given a simple polygon P, a covering triangulation is another triangulation over the vertices of P and some inner Steiner points (see Fig 1 for a covering triangulation generated by our heuristic). In other words, when computing a covering triangulation one is only allowed to add Steiner points in the interior of P. This problem is originally from mesh smoothing: one is not happy with the mesh over a specific region (say P) and would like to re-triangulate that region. Certainly, adding Steiner points on the boundary of P would destroy the neighboring part of P and would result in further changes of the mesh.
- [Mit94]S. Mitchell. Finding a covering triangulation whose maximum angle is provably small. Proc. 17th Australian Computer Science Conf. pages 55–64, 1994.Google Scholar