LMT-skeleton heuristics for several new classes of optimal triangulations

Abstract Given a planar point set, we consider three classes of optimal triangulations: (1) the minimum weight triangulation with angular constraints (constraints on the minimum angle and the maximum angle in a triangulation), (2) the angular balanced triangulation which minimizes the sum of the ratios of the maximum angle to the minimum angle for each triangle, and (3) the area balanced triangulation which minimizes the variance of the areas of triangles in the triangulation. With appropriate definition of local optimality for each class, a simple unified method is established for the computation of the subgraphs of optimal triangulations. Computational experiments demonstrate that the method successfully identifies large portion of edges of the optimal triangulations of each class for all problem instances tested, and hence optimal triangulations for each class can be obtained from them by applying dynamic programming.

[1]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

[2]  J. Mark Keil,et al.  Computing a Subgraph of the Minimum Weight Triangulation , 1994, Comput. Geom..

[3]  Siu-Wing Cheng,et al.  A Study of the LMT-Skeleton , 1996, ISAAC.

[4]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[5]  Tiow Seng Tan,et al.  An O(n2 log n) Time Algorithm for the Minmax Angle Triangulation , 1992, SIAM J. Sci. Comput..

[6]  David Eppstein,et al.  Edge insertion for optimal triangulations , 1993, Discret. Comput. Geom..

[7]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .

[8]  Jack Snoeyink,et al.  Implementations of the LMT heuristic for minimum weight triangulation , 1998, SCG '98.

[9]  J. W. Butterworth,et al.  The traviation process , 1997 .

[10]  Matthew Dickerson,et al.  A Large Subgraph of the Minimum Weight Triangulation , 1997, Discret. Comput. Geom..

[11]  Jack Snoeyink,et al.  On computing edges that are in all minimum-weight triangulations , 1996, SCG '96.

[12]  Yin-Feng Xu,et al.  Approaching the largest β-skeleton within a minimum weight triangulation , 1996, SCG '96.

[13]  Robin Sibson,et al.  Locally Equiangular Triangulations , 1978, Comput. J..

[14]  David Eppstein,et al.  Finding minimum areak-gons , 1992, Discret. Comput. Geom..

[15]  Makoto Ohsaki,et al.  Shape Optimization of a Double-Layer Space Truss Described by a Parametric Surface , 1997 .

[16]  I. Babuska,et al.  ON THE ANGLE CONDITION IN THE FINITE ELEMENT METHOD , 1976 .

[17]  Naoki Katoh,et al.  On Computing New Classes of Optimal Trangulations with Angular Constraints , 1998, COCOON.

[18]  Prosenjit Bose,et al.  Diamonds are Not a Minimum Weight Triangulation's Best Friend , 1996, Int. J. Comput. Geom. Appl..

[19]  D. Kirkpatrick,et al.  A Framework for Computational Morphology , 1985 .

[20]  Tiow Seng Tan,et al.  A quadratic time algorithm for the minmax length triangulation , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[21]  I. Fried.  Condition of finite element matrices generated from nonuniform meshes. , 1972 .

[22]  Matthew Dickerson,et al.  A (usually?) connected subgraph of the minimum weight triangulation , 1996, SCG '96.