Abstract
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.
This work is partially supported by the research grant No. 7000743 from City University of Hong Kong and UGC grant CityU1049/98E.
Chapter PDF
Similar content being viewed by others
References
M. Bern, D. Dobkin and D. Eppstein. Triangulating polygons without large angles. Intl. J. Comput. Geom. and Appl., 5:171–192, 1995.
S. Mitchell. Finding a covering triangulation whose maximum angle is provably small. Proc. 17th Australian Computer Science Conf. pages 55–64, 1994.
S. Mitchell. Approximating the maxmin-angle covering triangulation. Comput. Geom. Theo. and Appl., 7:93–111, 1997.
H. ElGindy, H. Everett and G. Toussaint. Slicing an ear in linear time. Patt. Recog. Lett., 14:719–722, 1993.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhu, B., Deng, X. (1998). On Computing and Drawing Maxmin-Height Covering Triangulation. In: Whitesides, S.H. (eds) Graph Drawing. GD 1998. Lecture Notes in Computer Science, vol 1547. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37623-2_48
Download citation
DOI: https://doi.org/10.1007/3-540-37623-2_48
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65473-5
Online ISBN: 978-3-540-37623-1
eBook Packages: Springer Book Archive