On Computing and Drawing MaxminHeight Covering TriangulationZhu, Binhai and Deng, Xiaotie (1998) On Computing and Drawing MaxminHeight Covering Triangulation. In: Graph Drawing 6th International Symposium, GD’ 98, August 1315, 1998 , pp. 464466(Official URL: http://dx.doi.org/10.1007/3540376232_48). Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/3540376232_48
AbstractGiven 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 retriangulate 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.
Actions (login required)
