✦ LIBER ✦

An automatic mesh coarsening technique for Delaunay triangulations

✍ Scribed by Xu, X. ;Pain, C. C. ;De Oliveira, C. R. E. ;Umpleby, A. P. ;Goddard, A. J. H.

Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 152 KB
Volume: 14
Category: Article
ISSN: 1069-8299
DOI: 10.1002/(sici)1099-0887(199801)14:1<59::aid-cnm129>3.0.co;2-8

No coin nor oath required. For personal study only.

✦ Synopsis

A new algorithm is described for automatic coarsening of Delaunay triangulations. The method automatically identi®es the nodes of the mesh which are candidates for deletion in each region to be coarsened. The mesh coarsening procedure is to regenerate a Delaunay triangulation for all the remaining nodes in the solution domain. The adapted mesh retains a high quality for two reasons: (i) because a set of nodes have been used to obtain the coarse mesh, which are equidistant apart in some sense de®ned by the original mesh; (ii) because the triangulation is Delaunay. A two-dimensional example demonstrates the quality of the mesh after coarsening.

📜 SIMILAR VOLUMES

Geometry-based fully automatic mesh gene

Geometry-based fully automatic mesh generation and the delaunay triangulation

✍ W. J. Schroeder; M. S. Shephard 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 813 KB

USING LONGEST-SIDE BISECTION TECHNIQUES

USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS

✍ MARÍA-CECILIA RIVARA; PATRICIO INOSTROZA 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 1 views

In this paper we discuss, study and compare two linear algorithms for the triangulation reÿnement problem: the known longest-side (triangle bisection) reÿnement algorithm, as well as a new algorithm that uses longest side bisection techniques for reÿning Delaunay triangulations. We show that the aut

Algorithms for automatic generating inte

Algorithms for automatic generating interior nodal points and Delaunay triangulation using advancing front technique

✍ Li, S. S. ;Shi, John Z. 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 612 KB

Delaunay versus max-min solid angle tria

Delaunay versus max-min solid angle triangulations for three-dimensional mesh generation

✍ Barry Joe 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 705 KB

Mesh relaxation: A new technique for imp

Mesh relaxation: A new technique for improving triangulations

✍ William H. Frey; David A. Field 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 780 KB

An Advancing Front Delaunay Triangulatio

An Advancing Front Delaunay Triangulation Algorithm Designed for Robustness

✍ Dimitri J. Mavriplis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 922 KB

A new algorithm is described for generating an unstructured mesh about an arbitrary two-dimensional configuration. Mesh points are generated automatically by the algorithm in a manner which ensures a smooth variation of elements, and the resulting triangulation constitutes the Delaunay triangulation