USING LONGEST-SIDE BISECTION TECHNIQUES FOR THE AUTOMATIC REFINEMENT OF DELAUNAY TRIANGULATIONS
✍ Scribed by MARÍA-CECILIA RIVARA; PATRICIO INOSTROZA
- Publisher
- John Wiley and Sons
- Year
- 1997
- Tongue
- English
- Weight
- 185 KB
- Volume
- 40
- Category
- Article
- ISSN
- 0029-5981
No coin nor oath required. For personal study only.
✦ Synopsis
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 automatic point insertion criterion, taken from the fractal property of optimal (linear) longest-side bisection algorithms, assures the construction of good quality Delaunay triangulations in linear time. Numerical evidence, showing that the practical behaviour of the new algorithm is in complete agreement with the theory, is included.