On Computing New Classes of Optimal Triangulations with Angular Constraints
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.
KeywordsPolynomial Time Algorithm Delaunay Triangulation Simple Polygon Dynamic Programming Approach Diagonal Edge
Unable to display preview. Download preview PDF.
- 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.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.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.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
- 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
- 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
- 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