Where and how Ruppert’s algorithm fails
Several examples are given to demonstrate non-termination of Ruppert’s Delaunay refinement algorithm for triangular mesh generation exploring the relationship between the minimum angle in the input and the minimum allowable angle in the output. These examples show non-termination despite requiring a...
| Published in: | Examples and Counterexamples |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2022-11-01
|
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2666657X22000118 |
| Summary: | Several examples are given to demonstrate non-termination of Ruppert’s Delaunay refinement algorithm for triangular mesh generation exploring the relationship between the minimum angle in the input and the minimum allowable angle in the output. These examples show non-termination despite requiring a minimum output angle of less than 30° which is smaller than the value generally observed in practice. For input containing only points, an example demonstrates failure of the algorithm with a minimum angle of 30° showing that the theoretical analysis in that context is sharp. |
|---|---|
| ISSN: | 2666-657X |