Computing Triangulations without Small and Large Angles

We propose a heuristic method for computing Steiner triangulations without small and large angles. Given a two-dimensional domain, a minimum angle constraint alpha and a maximum angle constraint gamma, our methodcomputes a triangulation of the domain such that all angles are in the interval [alpha, gamma]. Previously known Steiner triangulation methods generally consider a lower bound alpha only, and claim a trivial upper bound (gamma = 180 - 2*alpha). Available software work for alpha as high as 34 degrees (implying a gamma value of 112 degrees), However, they fail consistently whenever larger alpha and/or smaller gamma values are desired.Experimental study shows that the proposed method works for alpha as high as 41 degrees, and gamma as low as 81 degrees. This is also the first software for computing high quality acute and non-obtuse triangulations of complex geometry.

[1]  María Cecilia Rivara,et al.  LEPP - Delaunay Algorithm: a Robust Tool for Producing Size-Optimal Quality Triangulations , 1999, IMR.

[2]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[3]  Alper Üngör,et al.  Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations , 2004, Comput. Geom..

[4]  Charles Cassidy,et al.  A square acutely triangulated , 1980 .

[5]  Brenda S. Baker,et al.  Nonobtuse triangulation of polygons , 1988, Discret. Comput. Geom..

[6]  Alper Üngör,et al.  A time-optimal delaunay refinement algorithm in two dimensions , 2005, SCG.

[7]  Marshall W. Bern,et al.  Linear-size nonobtuse triangulation of polygons , 1994, SCG '94.

[8]  Ulrich Pinkall,et al.  Computing Discrete Minimal Surfaces and Their Conjugates , 1993, Exp. Math..

[9]  J A Sethian,et al.  Computing geodesic paths on manifolds. , 1998, Proceedings of the National Academy of Sciences of the United States of America.

[10]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[11]  Gary L. Miller,et al.  A time efficient Delaunay refinement algorithm , 2004, SODA '04.

[12]  Herbert Edelsbrunner,et al.  Sink-insertion for mesh improvement , 2001, SCG '01.

[13]  Jim Ruppert,et al.  A new and simple algorithm for quality 2-dimensional mesh generation , 1993, SODA '93.

[14]  Alper Üngör,et al.  Computing Acute and Non-obtuse Triangulations , 2007, CCCG.

[15]  Alla Sheffer,et al.  Pitching Tents in Space-Time: Mesh Generation for Discontinuous Galerkin Method , 2002, Int. J. Found. Comput. Sci..

[16]  Alper Üngör,et al.  Triangulations with locally optimal Steiner points , 2007, Symposium on Geometry Processing.

[17]  David Eppstein,et al.  Optimal point placement for mesh smoothing , 1997, SODA '97.

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

[19]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

[20]  Jonathan Richard Shewchuk,et al.  What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures , 2002, IMR.

[21]  Tony DeRose,et al.  Multiresolution analysis of arbitrary meshes , 1995, SIGGRAPH.

[22]  Hiroshi Maehara,et al.  Acute Triangulations of Polygons , 2002, Eur. J. Comb..

[23]  Damrong Guoy,et al.  Well-centered Planar Triangulation - An Iterative Approach , 2008, IMR.

[24]  Todd S. Munson,et al.  A comparison of two optimization methods for mesh quality improvement , 2005, Engineering with Computers.