On Computing and Drawing Maxmin-Height Covering Triangulation

  • Binhai Zhu
  • Xiaotie Deng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)


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.


  1. [BDE95]
    M. Bern, D. Dobkin and D. Eppstein. Triangulating polygons without large angles. Intl. J. Comput. Geom. and Appl., 5:171–192, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  2. [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
  3. [Mit97]
    S. Mitchell. Approximating the maxmin-angle covering triangulation. Comput. Geom. Theo. and Appl., 7:93–111, 1997.zbMATHGoogle Scholar
  4. [EET93]
    H. ElGindy, H. Everett and G. Toussaint. Slicing an ear in linear time. Patt. Recog. Lett., 14:719–722, 1993.zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Binhai Zhu
    • 1
  • Xiaotie Deng
    • 1
  1. 1.Dept. of Computer ScienceCity University of Hong KongKowloonHong Kong SARChina

Personalised recommendations