Advertisement

On Computing New Classes of Optimal Triangulations with Angular Constraints

  • Yang Dai
  • Naoki Katoh
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1449)

Abstract

Given a planar point set S, a triangulation of S is a maximal set of non-intersecting edges connecting points in S. Triangulating a point set has many applications in computational geometry and other related fields. Specifically, in numerical solutions for scientific and engineering applications, poorly shaped triangles can cause serious difficulty. Traditionally, triangulations which minimize the maximum angle, maximize the minimum angle, minimize the maximum edge length, and maximize the minimum hight are considered. For example, if angles of triangles become too large, the discretization error in the finite element solution is increased and, if the angles become too small, the condition number of the element matrix is increased [1, 10, 11]. Polynomial time algorithms have been developed in determining those triangulations [2, 7, 8, 15]. In computational geometry another important research object is to compute the minimum weight triangulation. The weight of a triangulation is defined to be the sum of the Euclidean lengths of the edges in the triangulation. Despite the intensive study made during the lase two decades, it remains unknown that whether the minimum weight triangulation problem is NP-complete or polynomially solvable.

Keywords

Polynomial Time Algorithm Delaunay Triangulation Simple Polygon Dynamic Programming Approach Diagonal Edge 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    I. Babuska and A. Aziz, “On the angle condition in the finite element method”, SIAM Journal on Numerical Analysis 13, pp.214–226, 1976.zbMATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    M. Bern, H. Edelsbrunner, D. Eppstein, S. Mitchell, and T. S. Tan, “Edge insertion for optimal triangulations”, Discrete Comput. Geom., 10, pp.47–65, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    M. Bern and D. Eppstein, “Mesh generation and optimal triangulation”, in D.-Z. Du eds. Computing in Euclidean Geometry, World Scientific Publishing, pp.23–90, 1992.Google Scholar
  4. 4.
    S.-W. Cheng, N. Katoh and M. Sugai, “A study of the LMT-Skeleton”, Proceedings of ISAAC’96, Lecture Notes in Computing Science 1178, pp.339–359, 1996.Google Scholar
  5. 5.
    S.-W. Cheng and Y. Xu, “Approaching the largest β — skeleton within a minimum weight triangulation”, Proceedings of the 12th Annual ACM Symposium on Computational Geometry, 1996.Google Scholar
  6. 6.
    M. T. Dickerson and M. H. Montague, “The exact minimum weight triangulation”, Proceedings of the 12th Annual ACM Symposium on Computational Geometry, 1996.Google Scholar
  7. 7.
    H. Edelsbrunner and T. S. Tan, “A quadratic time algorithm for the minmax length triangulation”, SIAM J. Comput. 22, pp. 527–551, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    H. Edelsbrunner, T. S. Tan and R. Waupotitsch, “A O(n log n) time algorithm for the minmax angle triangulation”, SIAM J. Sci. Statist. Comput. 13, pp. 994–1008, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    D. Eppstein, M. Overmars, G. Rote and G. Woeginger, “Finding Minimum Area k-gons”, Discrete Comput. Geom. 7, pp. 45–58, 1992.zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    L. Freitag, M. Jones and P. Plassmann, “An efficient parallel algorithm for mesh smoothing”, Proceedings of the 5th International Mesh Roundtable, 1996.Google Scholar
  11. 11.
    I. Fried, “Condition of finite element matrices generated from nonuniform meshes”, AIAA Journal 10, pp.219–221, 1972.zbMATHCrossRefGoogle Scholar
  12. 12.
    J. M. Keil, “Computing a subgraph of the minimum weight triangulation”, Computational Geometry: Theory and Applications, Vol. 4, pp.13–26, 1994.zbMATHMathSciNetGoogle Scholar
  13. 13.
    D. Kirkpatrick and J. Radke, “A framework for computational morphology”, in G. Toussaint ed, Computational Geometry, pp. 217–248, Elsevier Science Publishers, 1985.Google Scholar
  14. 14.
    G. Klincsek, “Minimum triangulations of polygonal domains”, Annual Discrete Mathematics 9, pp.121–123, 1980.zbMATHMathSciNetCrossRefGoogle Scholar
  15. 15.
    R. Sibson, “Locally equiangular triangulations”, Comput. J, 21, pp.243–245, 1978.CrossRefMathSciNetGoogle Scholar
  16. 16.
    K. Sugihara and M. Iri, “VORONOI2 reference manual, Research Memorandum RMI-89-04, Department of Mathematical Engineering and Information Physics, Faculty of Engineering, University of Tokyo, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Yang Dai
    • 1
  • Naoki Katoh
    • 2
  1. 1.Tokyo Institute of TechnologyTokyo
  2. 2.Kyoto UniversityKyoto

Personalised recommendations