On the Non-Termination of Ruppert's Algorithm
Computational Geometry
2015-03-17 v1
Abstract
A planar straight-line graph which causes the non-termination Ruppert's algorithm for a minimum angle threshold larger than about 29.5 degrees is given. The minimum input angle of this example is about 74.5 degrees meaning that failure is not due to small input angles. Additionally, a similar non-acute input is given for which Chew's second algorithm does not terminate for a minimum angle threshold larger than about 30.7 degrees.
Cite
@article{arxiv.1101.1071,
title = {On the Non-Termination of Ruppert's Algorithm},
author = {Alexander Rand},
journal= {arXiv preprint arXiv:1101.1071},
year = {2015}
}
Comments
4 pages, 5 figures